The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An efficient SQL-based RDF querying scheme
VLDB '05 Proceedings of the 31st international conference on Very large data bases
From SPARQL to rules (and back)
Proceedings of the 16th international conference on World Wide Web
Scalable semantic web data management using vertical partitioning
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Hexastore: sextuple indexing for semantic web data management
Proceedings of the VLDB Endowment
Column-store support for RDF data management: not all swans are white
Proceedings of the VLDB Endowment
Scalable join processing on very large RDF graphs
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
Scalable indexing of RDF graphs for efficient join processing
Proceedings of the 18th ACM conference on Information and knowledge management
The RDF-3X engine for scalable management of RDF data
The VLDB Journal — The International Journal on Very Large Data Bases
Foundations of SPARQL query optimization
Proceedings of the 13th International Conference on Database Theory
Efficiently joining group patterns in SPARQL queries
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part I
Static analysis and optimization of semantic web queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
SPARQL for a web of linked data: semantics and computability
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
A structural approach to indexing triples
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
SPAM: a SPARQL analysis and manipulation tool
Proceedings of the VLDB Endowment
SPLODGE: systematic generation of SPARQL benchmark queries for linked open data
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Strabon: a semantic geospatial DBMS
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Federating queries in SPARQL 1.1: Syntax, semantics and evaluation
Web Semantics: Science, Services and Agents on the World Wide Web
Static analysis and optimization of semantic web queries
ACM Transactions on Database Systems (TODS) - Invited papers issue
Tractable queries for lightweight description logics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We present statistics on real world SPARQL queries that may be of interest for building SPARQL query processing engines and benchmarks. In particular, we analyze the syntactical structure of queries in a log of about 3 million queries, harvested from the DBPedia SPARQL endpoint. Although a sizable portion of the log is shown to consist of so-called conjunctive SPARQL queries, non-conjunctive queries that use SPARQL's union or optional operators are more than substantial. It is known, however, that query evaluation quickly becomes hard for queries including the non-conjunctive operators union or optional. We therefore drill deeper into the syntactical structure of the queries that are not conjunctive and show that in 50% of the cases, these queries satisfy certain structural restrictions that imply tractable evaluation in theory. We hope that the identification of these restrictions can aid in the future development of practical heuristics for processing non-conjunctive SPARQL queries.