CoDE Publications CoDE Publications
IRIDIA Publications IRIDIA Publications
SMG Publications
WIT Publications
WIT Publications
SMG Publications
Home People Research Activities Publications Teaching Resources
By Class By Topic By Year Technical Reports
By Class By Topic By Year Technical Reports
login
F. Picalausa and S. Vansummeren. What are real SPARQL queries like? In Proceedings of the 3rd International Workshop on Semantic Web Information Management, SWIM 2011, ACM International Conference Proceedings Series. ACM Press, June 2011.

Abstract

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.


Updated: 2017-03-27