Using an Index of Precomputed Joins in order to speed up SPARQL Processing

Sven Groppe, Jinghua Groppe, Volker Linnemann

Abstract

SparQL is a query language developed by the W3C, the purpose of which is to query a data set in RDF representing a directed graph. Many free available or commercial products already support SparQL processing. Current index-based optimizations integrated in these products typically construct indices on the subject, predicate and object of an RDF triple, which is a single datum of the RDF data, in order to speed up the execution time of SparQL queries. In order to query the directed graph of RDF data, SparQL queries typically contain many joins over a set of triples. We propose to construct and use an index of precomputed joins, where we take advantage of the homogenous structure of RDF data. Furthermore, we present experimental results, which demonstrate the achievable speed-up factors for SparQL processing.

Original languageEnglish
Title of host publicationProceedings 9th International Conference on Enterprise Information Systems (ICEIS 2007 (1), Volume DISI)
EditorsJorge Cardoso, José Cordeiro, Joaquim Filipe
Number of pages8
Place of PublicationFunchal, Madeira, Portugal
PublisherINSTICC
Publication date12.06.2007
Pages13-20
ISBN (Print)978-972-8865-88-7
Publication statusPublished - 12.06.2007
Event9th International Conference on Enterprise Information Systems
- Funchal, Portugal
Duration: 12.06.200716.06.2007
Conference number: 76454

Research Areas and Centers

  • Research Area: Intelligent Systems
  • Centers: Center for Artificial Intelligence Luebeck (ZKIL)

DFG Research Classification Scheme

  • 409-04 Operating, Communication, Database and Distributed Systems

Fingerprint

Dive into the research topics of 'Using an Index of Precomputed Joins in order to speed up SPARQL Processing'. Together they form a unique fingerprint.

Cite this