{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:17:20Z","timestamp":1778807840241,"version":"3.51.4"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2017,10]]},"abstract":"<jats:p>With the adoption of RDF as the data model for Linked Data and the Semantic Web, query specification from end-users has become more and more common in SPARQL endpoints. In this paper, we conduct an in-depth analytical study of the queries formulated by end-users and harvested from large and up-to-date query logs from a wide variety of RDF data sources. As opposed to previous studies, ours is the first assessment on a voluminous query corpus, spanning over several years and covering many representative SPARQL endpoints. Apart from the syntactical structure of the queries, that exhibits already interesting results on this generalized corpus, we drill deeper in the structural characteristics related to the graph and hypergraph representation of queries. We outline the most common shapes of queries when visually displayed as undirected graphs, and characterize their (hyper-)tree width. Moreover, we analyze the evolution of queries over time, by introducing the novel concept of a streak, i.e., a sequence of queries that appear as subsequent modifications of a seed query. Our study offers several fresh insights on the already rich query features of real SPARQL queries formulated by real users, and brings us to draw a number of conclusions and pinpoint future directions for SPARQL query evaluation, query optimization, tuning, and benchmarking.<\/jats:p>","DOI":"10.14778\/3149193.3149196","type":"journal-article","created":{"date-parts":[[2017,12,12]],"date-time":"2017-12-12T18:33:38Z","timestamp":1513103618000},"page":"149-161","source":"Crossref","is-referenced-by-count":50,"title":["An analytical study of large SPARQL query logs"],"prefix":"10.14778","volume":"11","author":[{"given":"Angela","family":"Bonifati","sequence":"first","affiliation":[{"name":"Lyon 1 University, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[{"name":"University of Bayreuth, Bayreuth, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Timm","sequence":"additional","affiliation":[{"name":"University of Bayreuth, Bayreuth, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,10,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915213"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2016.7495625"},{"key":"e_1_2_1_3_1","volume-title":"An empirical study of real-world SPARQL queries. CoRR, abs\/1103.5043","author":"Arias M.","year":"2011","unstructured":"M. Arias , J. D. Fern\u00e1ndez , M. A. Mart\u00ednez-Prieto , and P. de la Fuente . An empirical study of real-world SPARQL queries. CoRR, abs\/1103.5043 , 2011 . M. Arias, J. D. Fern\u00e1ndez, M. A. Mart\u00ednez-Prieto, and P. de la Fuente. An empirical study of real-world SPARQL queries. CoRR, abs\/1103.5043, 2011."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2633993"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2467795"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745754.2745767"},{"key":"e_1_2_1_7_1","volume-title":"An analytical study of large SPARQL query logs. CoRR, abs\/1708.00363","author":"Bonifati A.","year":"2017","unstructured":"A. Bonifati , W. Martens , and T. Timm . An analytical study of large SPARQL query logs. CoRR, abs\/1708.00363 , 2017 . A. Bonifati, W. Martens, and T. Timm. An analytical study of large SPARQL query logs. CoRR, abs\/1708.00363, 2017."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/645502.656110"},{"key":"e_1_2_1_10_1","volume-title":"Visited on August 10th","year":"2016","unstructured":"detkdecomp.wwwinfo.deis.unical.it\/~frank\/Hypertrees. Visited on August 10th , 2016 . detkdecomp.wwwinfo.deis.unical.it\/~frank\/Hypertrees. Visited on August 10th, 2016."},{"key":"e_1_2_1_11_1","first-page":"598","volume-title":"International Conference on Extending Database Technology (EDBT)","author":"Fletcher G. H. L.","year":"2017","unstructured":"G. H. L. Fletcher , H. Voigt , and N. Yakovets . Declarative graph querying in practice and theory . In International Conference on Extending Database Technology (EDBT) , pages 598 -- 601 , 2017 . G. H. L. Fletcher, H. Voigt, and N. Yakovets. Declarative graph querying in practice and theory. In International Conference on Extending Database Technology (EDBT), pages 598--601, 2017."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902309"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1017\/CBO9781139177801.002","volume-title":"Tractability: Practical Approaches to Hard Problems","author":"Gottlob G.","year":"2014","unstructured":"G. Gottlob , G. Greco , and F. Scarcello . Treewidth and hypertree width . In Tractability: Practical Approaches to Hard Problems , pages 3 -- 38 . Cambridge University Press , 2014 . G. Gottlob, G. Greco, and F. Scarcello. Treewidth and hypertree width. In Tractability: Practical Approaches to Hard Problems, pages 3--38. Cambridge University Press, 2014."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2932194.2932196"},{"key":"e_1_2_1_16_1","volume-title":"SPARQL 1.1 query language. Technical report","author":"Harris S.","year":"2013","unstructured":"S. Harris and A. Seaborne . SPARQL 1.1 query language. Technical report , World Wide Web Consortium (W 3C), March 2013 . https:\/\/www.w3.org\/TR\/2013\/REC-sparql11-query-20130321. S. Harris and A. Seaborne. SPARQL 1.1 query language. Technical report, World Wide Web Consortium (W3C), March 2013. https:\/\/www.w3.org\/TR\/2013\/REC-sparql11-query-20130321."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25639-9_44"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247483"},{"key":"e_1_2_1_19_1","first-page":"282","volume-title":"International Conference on Extending Database Technology (EDBT)","author":"Kalinsky O.","year":"2017","unstructured":"O. Kalinsky , Y. Etsion , and B. Kimelfeld . Flexible caching in trie joins . In International Conference on Extending Database Technology (EDBT) , pages 282 -- 293 , 2017 . O. Kalinsky, Y. Etsion, and B. Kimelfeld. Flexible caching in trie joins. In International Conference on Extending Database Technology (EDBT), pages 282--293, 2017."},{"key":"e_1_2_1_20_1","first-page":"1","volume-title":"International Conference on Database Theory (ICDT)","author":"Kaminski M.","year":"2016","unstructured":"M. Kaminski and E. V. Kostylev . Beyond well-designed SPARQL . In International Conference on Database Theory (ICDT) , pages 5: 1 -- 5 :18, 2016 . M. Kaminski and E. V. Kostylev. Beyond well-designed SPARQL. In International Conference on Database Theory (ICDT), pages 5:1--5:18, 2016."},{"key":"e_1_2_1_21_1","first-page":"1","volume-title":"International Conference on Database Theory (ICDT)","author":"Kr\u00f6ll M.","year":"2016","unstructured":"M. Kr\u00f6ll , R. Pichler , and S. Skritek . On the complexity of enumerating the answers to well-designed pattern trees . In International Conference on Database Theory (ICDT) , pages 22: 1 -- 22 :18, 2016 . M. Kr\u00f6ll, R. Pichler, and S. Skritek. On the complexity of enumerating the answers to well-designed pattern trees. In International Conference on Database Theory (ICDT), pages 22:1--22:18, 2016."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500130"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.021"},{"key":"e_1_2_1_24_1","volume-title":"Enumeration problems for regular path queries. CoRR, abs\/1710.02317","author":"Martens W.","year":"2017","unstructured":"W. Martens and T. Trautner . Enumeration problems for regular path queries. CoRR, abs\/1710.02317 , 2017 . W. Martens and T. Trautner. Enumeration problems for regular path queries. CoRR, abs\/1710.02317, 2017."},{"key":"e_1_2_1_25_1","volume-title":"Web Science Conference (WSC)","author":"M\u00f6ller K.","year":"2010","unstructured":"K. M\u00f6ller , M. Hausenblas , R. Cyganiak , S. Handschuh , and G. Grimnes . Learning from linked open data usage: Patterns & metrics . In Web Science Conference (WSC) , 2010 . K. M\u00f6ller, M. Hausenblas, R. Cyganiak, S. Handschuh, and G. Grimnes. Learning from linked open data usage: Patterns & metrics. In Web Science Conference (WSC), 2010."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2063016.2063046"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402755.3402797"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0165-y"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1567274.1567278"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1999299.1999306"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25010-6_15"},{"key":"e_1_2_1_32_1","unstructured":"http:\/\/ldbcouncil.org.  http:\/\/ldbcouncil.org."},{"key":"e_1_2_1_33_1","unstructured":"https:\/\/databasetheory.org\/node\/47.  https:\/\/databasetheory.org\/node\/47."},{"key":"e_1_2_1_34_1","unstructured":"http:\/\/wikidata.org.  http:\/\/wikidata.org."},{"key":"e_1_2_1_35_1","unstructured":"http:\/\/wiki.dbpedia.org\/datasets.  http:\/\/wiki.dbpedia.org\/datasets."},{"key":"e_1_2_1_36_1","unstructured":"http:\/\/www.blazegraph.com.  http:\/\/www.blazegraph.com."},{"key":"e_1_2_1_37_1","unstructured":"http:\/\/www.opencypher.org\/ocig2.  http:\/\/www.opencypher.org\/ocig2."},{"key":"e_1_2_1_38_1","unstructured":"http:\/\/www.postgresql.org.  http:\/\/www.postgresql.org."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13486-9_16"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629489"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3149193.3149196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:34:10Z","timestamp":1672220050000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3149193.3149196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["10.14778\/3149193.3149196"],"URL":"https:\/\/doi.org\/10.14778\/3149193.3149196","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}