S2RDF
Authors:
Open Access
- 1 June 2016
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 9 (10) , 804-815
Abstract
RDF has become very popular for semantic data publishing due to its flexible and universal graph-like data model. Thus, the ever-increasing size of RDF data collections raises the need for scalable distributed approaches. We endorse the usage of existing infrastructures for Big Data processing like Hadoop for this purpose. Yet, SPARQL query performance is a major challenge as Hadoop is not intentionally designed for RDF processing. Existing approaches often favor certain query pattern shapes while performance drops significantly for other shapes. In this paper, we introduce a novel relational partitioning schema for RDF data called ExtVP that uses a semi-join based preprocessing, akin to the concept of Join Indices in relational databases, to efficiently minimize query input size regardless of its pattern shape and diameter. Our prototype system S2RDF is built on top of Spark and uses SQL to execute SPARQL queries over ExtVP. We demonstrate its superior performance in comparison to state of the art SPARQL-on-Hadoop approaches.Keywords
This publication has 21 references indexed in Scilit:
- RDF in the clouds: a surveyThe VLDB Journal, 2014
- Sempala: Interactive SPARQL Query Processing on Hadoop2014
- YAGO2: A spatially and temporally enhanced knowledge base from WikipediaArtificial Intelligence, 2013
- Virtuoso: RDF Support in a Native RDBMS2009
- The RDF-3X engine for scalable management of RDF dataThe VLDB Journal, 2009
- Semantics and complexity of SPARQLACM Transactions on Database Systems, 2009
- HexastoreProceedings of the VLDB Endowment, 2008
- Access support relations: An indexing method for object basesInformation Systems, 1992
- Join indicesACM Transactions on Database Systems, 1987
- Using Semi-Joins to Solve Relational QueriesJournal of the ACM, 1981