The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Query rewriting for semistructured data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
MiniCon: A scalable algorithm for answering queries using views
The VLDB Journal — The International Journal on Very Large Data Bases
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Extending query rewriting techniques for fine-grained access control
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Secure XML querying with security views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
On synopses for distinct-value estimation under multiset operations
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Scalable semantic web data management using vertical partitioning
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
On the correctness criteria of fine-grained access control in relational databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
The Expressive Power of SPARQL
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Querying data sources that export infinite sets of views
Proceedings of the 12th International Conference on Database Theory
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
SPARQL query rewriting for implementing data integration over linked data
Proceedings of the 2010 EDBT/ICDT Workshops
Enabling advanced and context-dependent access control in RDF stores
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
View selection in Semantic Web databases
Proceedings of the VLDB Endowment
SPARQL-RW: transparent query access over mapped RDF data sources
Proceedings of the 15th International Conference on Extending Database Technology
SPAM: a SPARQL analysis and manipulation tool
Proceedings of the VLDB Endowment
Optimizing query rewriting in ontology-based data access
Proceedings of the 16th International Conference on Extending Database Technology
RDF analytics: lenses over semantic graphs
Proceedings of the 23rd international conference on World wide web
Hi-index | 0.00 |
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, or when integrating RDF data from disparate sources. We approach this problem by rewriting SPARQL queries over the views to equivalent queries over the underlying RDF data, thus avoiding the costs entailed by view materialization and maintenance. We show that SPARQL query rewriting combines the most challenging aspects of rewriting for the relational and XML cases: like the relational case, SPARQL query rewriting requires synthesizing multiple views; like the XML case, the size of the rewritten query is exponential to the size of the query and the views. In this paper, we present the first native query rewriting algorithm for SPARQL. For an input SPARQL query over a set of virtual SPARQL views, the rewritten query resembles a union of conjunctive queries and can be of exponential size. We propose optimizations over the basic rewriting algorithm to (i) minimize each conjunctive query in the union; (ii) eliminate conjunctive queries with empty results from evaluation; and (iii) efficiently prune out big portions of the search space of empty rewritings. The experiments, performed on two RDF stores, show that our algorithms are scalable and independent of the underlying RDF stores. Furthermore, our optimizations have order of magnitude improvements over the basic rewriting algorithm in both the rewriting size and evaluation time.