Matches in ScholarlyData for { <https://w3id.org/scholarlydata/inproceedings/www2010/paper/main/213> ?p ?o. }
Showing items 1 to 16 of
16
with 100 items per page.
- 213 creator james-hendler.
- 213 creator medha-atre.
- 213 creator mohammed-zaki.
- 213 creator vineet-chaoji.
- 213 type InProceedings.
- 213 label "Matrix "Bit"loaded: A scalable lightweight join query processor for RDF data".
- 213 sameAs 213.
- 213 abstract "The Semantic Web community, until now, has used traditional database systems for the storage and querying of RDF data. The SPARQL query language also closely follows SQL syntax. As a natural consequence, most of the SPARQL query processing techniques are based on database query processing and optimization techniques. For SPARQL join query optimization, previous works like RDF-3X and Hexastore have proposed to use 6-way indexes on the RDF data. Although these indexes speed up merge-joins by orders of magnitude, for complex join queries generating large intermediate join results, the scalability of the query processor still remains a challenge. In this paper, we introduce (i) BitMat -- a compressed bit-matrix structure for storing huge RDF graphs, and (ii) a novel, light-weight SPARQL join query processing method that employs an initial pruning technique, followed by a variable-binding-matching algorithm on BitMats to produce the final results. Our query processing method does not build intermediate join tables and works directly on the compressed data. We have demonstrated our method against RDF graphs of upto 1.33 billion triples -- the largest among results published until now (single-node, non-parallel systems), and have compared our method with the state-of-the-art RDF stores -- RDF-3X and MonetDB. Our results show that the competing methods are most effective with highly selective queries. On the other hand, BitMat can deliver 2-3 orders of magnitude better performance on complex, low-selectivity queries over massive data.".
- 213 hasAuthorList authorList.
- 213 isPartOf proceedings.
- 213 keyword "Querying".
- 213 keyword "distributed approaches".
- 213 keyword "including combinations with statistics".
- 213 keyword "searching the Semantic/Data Web".
- 213 keyword "soft computing".
- 213 title "Matrix "Bit"loaded: A scalable lightweight join query processor for RDF data".