Scalable indexing of RDF graphs for efficient join processing

Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structures. Weak data locality negatively impacts storage and query processing costs. Towards stronger data locality, we propose a Three-way Triple Tree (TripleT) secondary memory indexing technique to facilitate flexible and efficient join evaluation on RDF data. The novelty of TripleT is that the index is built over the atoms occurring in the data set, rather than at a coarser granularity, such as whole triples occurring in the data set; and, the atoms are indexed regardless of the roles (i.e., subjects, predicates, or objects) they play in the triples of the data set. We show through extensive empirical evaluation that TripleT exhibits multiple orders of magnitude improvement over the state-of-the-art, in terms of both storage and query processing costs. Categories and Subject Descriptors H.2.4 [Database Managemen...

• Type: Conference
• Year: 2009
• Where: CIKM
• Authors: George H. L. Fletcher, Peter W. Beck
• Keywords: CIKM 2009, Data Locality, Information Management, Query Processing Costs, Weak Data Locality