{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T07:15:16Z","timestamp":1784099716787,"version":"3.55.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T00:00:00Z","timestamp":1564704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T00:00:00Z","timestamp":1564704000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00778-019-00558-9","type":"journal-article","created":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T11:10:08Z","timestamp":1564744208000},"page":"655-679","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":92,"title":["An analytical study of large SPARQL query logs"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9582-869X","authenticated-orcid":false,"given":"Angela","family":"Bonifati","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Timm","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,2]]},"reference":[{"key":"558_CR1","doi-asserted-by":"crossref","unstructured":"Aberger, C.R., Tu, S., Olukotun, K., R\u00e9, C.: EmptyHeaded: a relational engine for graph processing. In: International Conference on Management of Data (SIGMOD), pp. 431\u2013446 (2016)","DOI":"10.1145\/2882903.2915213"},{"key":"558_CR2","doi-asserted-by":"crossref","unstructured":"Aberger, C.R., Tu, S., Olukotun, K., R\u00e9, C.: Old techniques for new join algorithms: a case study in RDF processing. In: International Conference on Data Engineering (ICDE) Workshops, pp. 97\u2013102 (2016)","DOI":"10.1109\/ICDEW.2016.7495625"},{"key":"558_CR3","unstructured":"Arias, M., Fern\u00e1ndez, J.D., Mart\u00ednez-Prieto, M.A., de\u00a0la Fuente, P.: An empirical study of real-world SPARQL queries. CoRR, arXiv:1103.5043 (2011)"},{"issue":"4","key":"558_CR4","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1109\/TKDE.2016.2633993","volume":"29","author":"G Bagan","year":"2017","unstructured":"Bagan, G., Bonifati, A., Ciucanu, R., Fletcher, G.H.L., Lemay, A., Advokaat, N.: gmark: Schema-driven generation of graphs and queries. IEEE Trans. Knowl. Data Eng. 29(4), 856\u2013869 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"558_CR5","doi-asserted-by":"crossref","unstructured":"Bagan, G., Bonifati, A., Groz, B.: A trichotomy for regular simple path queries on graphs. In: Principles of Database Systems (PODS), pp. 261\u2013272 (2013)","DOI":"10.1145\/2463664.2467795"},{"key":"558_CR6","doi-asserted-by":"crossref","unstructured":"Bagan, G., Durand, A., Grandjean, E.: On acyclic conjunctive queries and constant delay enumeration. In: Computer Science Logic (CSL), pp. 208\u2013222 (2007)","DOI":"10.1007\/978-3-540-74915-8_18"},{"key":"558_CR7","unstructured":"Bannach, M., Berndt, S., Ehlers, T.: Jdrasil: a modular library for computing tree decompositions. In: 16th International Symposium on Experimental Algorithms (SEA), pp. 28:1\u201328:21 (2017)"},{"key":"558_CR8","doi-asserted-by":"crossref","unstructured":"Barcel\u00f3, P., Pichler, R., Skritek, S.: Efficient evaluation and approximation of well-designed pattern trees. In: Principles of Database Systems (PODS), pp. 131\u2013144 (2015)","DOI":"10.1145\/2745754.2745767"},{"key":"558_CR9","unstructured":"Bielefeldt, A., Gonsior, J., Kr\u00f6tzsch, M.: Practical linked data access via SPARQL: the case of wikidata. In: Workshop on Linked Data (LDOW) (2018)"},{"key":"558_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01864-0","volume-title":"Querying Graphs. Synthesis Lectures on Data Management","author":"A Bonifati","year":"2018","unstructured":"Bonifati, A., Fletcher, G.H.L., Voigts, H., Yakovets, N.: Querying Graphs. Synthesis Lectures on Data Management. Morgan & Claypool, San Rafael (2018)"},{"issue":"2","key":"558_CR11","first-page":"149","volume":"11","author":"A Bonifati","year":"2017","unstructured":"Bonifati, A., Martens, W., Timm, T.: An analytical study of large SPARQL query logs. PVLDB 11(2), 149\u2013161 (2017)","journal-title":"PVLDB"},{"key":"558_CR12","doi-asserted-by":"crossref","unstructured":"Bonifati, A., Martens, W., Timm, T.: Navigating the maze of Wikidata query logs. In: The World Wide Web Conference (WWW), pp. 127\u2013138 (2019)","DOI":"10.1145\/3308558.3313472"},{"key":"558_CR13","doi-asserted-by":"crossref","unstructured":"Chandra, A., Merlin, P.: Optimal implementation of conjunctive queries in relational data bases. In: Symposium on the Theory of Computing (STOC), pp. 77\u201390 (1977)","DOI":"10.1145\/800105.803397"},{"key":"558_CR14","first-page":"56","volume-title":"Lecture Notes in Computer Science","author":"Chandra Chekuri","year":"1996","unstructured":"Chekuri, C., Rajaraman, A.: Conjunctive query containment revisited. In: International Conference on Database Theory (ICDT), pp. 56\u201370 (1997)"},{"issue":"4","key":"558_CR15","doi-asserted-by":"publisher","first-page":"26:1","DOI":"10.1145\/3180281","volume":"65","author":"W Czerwi\u0144ski","year":"2018","unstructured":"Czerwi\u0144ski, W., Martens, W., Niewerth, M., Parys, P.: Minimization of tree patterns. J. ACM 65(4), 26:1\u201326:46 (2018)","journal-title":"J. ACM"},{"key":"558_CR16","doi-asserted-by":"crossref","unstructured":"Czerwi\u0144ski, W., Martens, W., Parys, P., Przybylko, M.: The (almost) complete guide to tree pattern containment. In: ACM Symposium on Principles of Database Systems (PODS), pp. 117\u2013130 (2015)","DOI":"10.1145\/2745754.2745766"},{"key":"558_CR17","unstructured":"detkdecomp. wwwinfo.deis.unical.it\/~frank\/Hypertrees . Visited on August 10th (2016)"},{"key":"558_CR18","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Greco, G., Leone, N., Scarcello, F.: Hypertree decompositions: questions and answers. In: Principles of Database Systems (PODS), pp. 57\u201374 (2016)","DOI":"10.1145\/2902251.2902309"},{"key":"558_CR19","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Greco, G., Scarcello, F.: Treewidth and hypertree width. In: Tractability: Practical Approaches to Hard Problems, pp. 3\u201338. Cambridge University Press (2014)","DOI":"10.1017\/CBO9781139177801.002"},{"issue":"3","key":"558_CR20","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jcss.2001.1809","volume":"64","author":"G Gottlob","year":"2002","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64(3), 579\u2013627 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"558_CR21","doi-asserted-by":"crossref","unstructured":"Han, X., Feng, Z., Zhang, X., Wang, X., Rao, G., Jiang, S.: On the statistical analysis of practical SPARQL queries. In: WebDB, p.\u00a02 (2016)","DOI":"10.1145\/2932194.2932196"},{"key":"558_CR22","unstructured":"Harris, S., Seaborne, A.: 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":"558_CR23","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-319-25639-9_44","volume-title":"The Semantic Web: ESWC 2015 Satellite Events","author":"Jochen Huelss","year":"2015","unstructured":"Huelss, J., Paulheim, H.: What SPARQL query logs tell and do not tell about semantic relatedness in LOD\u2014or: The unsuccessful attempt to improve the browsing experience of DBpedia by exploiting query logs. In: ESWC Satellite Events, pp. 297\u2013308 (2015)"},{"key":"558_CR24","unstructured":"http:\/\/ldbcouncil.org"},{"key":"558_CR25","unstructured":"https:\/\/databasetheory.org\/node\/47"},{"key":"558_CR26","unstructured":"http:\/\/wikidata.org"},{"key":"558_CR27","unstructured":"http:\/\/wiki.dbpedia.org\/datasets"},{"key":"558_CR28","unstructured":"http:\/\/www.blazegraph.com"},{"key":"558_CR29","unstructured":"http:\/\/www.opencypher.org\/ocig2"},{"key":"558_CR30","unstructured":"http:\/\/www.postgresql.org"},{"key":"558_CR31","doi-asserted-by":"crossref","unstructured":"Idris, M., Ugarte, M., Vansummeren, S.: The dynamic yannakakis algorithm: compact and efficient query processing under updates. In: International Conference on Management of Data (SIGMOD), pp. 1259\u20131274 (2017)","DOI":"10.1145\/3035918.3064027"},{"key":"558_CR32","doi-asserted-by":"crossref","unstructured":"Jagadish, H.\u00a0V., Chapman, A., Elkiss, A., Jayapandian, M., Li, Y., Nandi, A., Yu, C.: Making database systems usable. In: International Conference on Management of Data (SIGMOD), pp. 13\u201324 (2007)","DOI":"10.1145\/1247480.1247483"},{"key":"558_CR33","unstructured":"Kalinsky, O., Etsion, Y., Kimelfeld, B.: Flexible caching in trie joins. In: International Conference on Extending Database Technology (EDBT), pp. 282\u2013293 (2017)"},{"key":"558_CR34","unstructured":"Kaminski, M., Kostylev, E.V.: Beyond well-designed SPARQL. In: International Conference on Database Theory (ICDT), pp. 5:1\u20135:18 (2016)"},{"key":"558_CR35","doi-asserted-by":"crossref","unstructured":"Kimelfeld, B., Sagiv, Y.: Revisiting redundancy and minimization in an XPath fragment. In: International Conference on Extending Database Technology (EDBT), pp. 61\u201372 (2008)","DOI":"10.1145\/1353343.1353355"},{"key":"558_CR36","unstructured":"Kr\u00f6ll, M., Pichler, R., Skritek, S.: On the complexity of enumerating the answers to well-designed pattern trees. In: International Conference on Database Theory (ICDT), pp. 22:1\u201322:18 (2016)"},{"issue":"4","key":"558_CR37","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/2500130","volume":"38","author":"A Letelier","year":"2013","unstructured":"Letelier, A., P\u00e9rez, J., Pichler, R., Skritek, S.: Static analysis and optimization of semantic web queries. ACM Trans. Database Syst. 38(4), 25:1\u201325:45 (2013)","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"558_CR38","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/2850413","volume":"63","author":"L Libkin","year":"2016","unstructured":"Libkin, L., Martens, W., Vrgoc, D.: Querying graphs with data. J. ACM 63(2), 14:1\u201314:53 (2016)","journal-title":"J. ACM"},{"key":"558_CR39","first-page":"376","volume-title":"Lecture Notes in Computer Science","author":"Stanislav Malyshev","year":"2018","unstructured":"Malyshev, S., Kr\u00f6tzsch, M., Gonz\u00e1lez, L., Gonsior, J., Bielefeldt, A.: Getting the most out of wikidata: Semantic technology usage in wikipedia\u2019s knowledge graph. In: International Semantic Web Conference (ISWC), pp. 376\u2013394 (2018)"},{"issue":"4","key":"558_CR40","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.jcss.2006.10.021","volume":"73","author":"W Martens","year":"2007","unstructured":"Martens, W., Niehren, J.: On the minimization of XML schemas and tree automata for unranked trees. J. Comput. Syst. Sci. 73(4), 550\u2013583 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"558_CR41","unstructured":"Martens, W., Trautner, T.: Enumeration problems for regular path queries. CoRR, arXiv:1710.02317 (2017)"},{"issue":"1","key":"558_CR42","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/962446.962448","volume":"51","author":"G Miklau","year":"2004","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for a fragment of xpath. J. ACM 51(1), 2\u201345 (2004)","journal-title":"J. ACM"},{"key":"558_CR43","unstructured":"M\u00f6ller, K., Hausenblas, M., Cyganiak, R., Handschuh, S., Grimnes, G.: Learning from linked open data usage: Patterns & metrics. In: Web Science Conference (WSC) (2010)"},{"key":"558_CR44","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-642-25073-6_29","volume-title":"The Semantic Web \u2013 ISWC 2011","author":"Mohamed Morsey","year":"2011","unstructured":"Morsey, M., Lehmann, J., Auer, S., Ngomo, A.N.: DBpedia SPARQL benchmark\u2014performance assessment with real queries on real data. In: International Semantic Web Conference (ISWC), pp. 454\u2013469 (2011)"},{"issue":"12","key":"558_CR45","first-page":"1466","volume":"4","author":"A Nandi","year":"2011","unstructured":"Nandi, A., Jagadish, H.V.: Guided interaction: rethinking the query-result paradigm. PVLDB 4(12), 1466\u20131469 (2011)","journal-title":"PVLDB"},{"issue":"1","key":"558_CR46","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00778-009-0165-y","volume":"19","author":"T Neumann","year":"2010","unstructured":"Neumann, T., Weikum, G.: The RDF-3X engine for scalable management of RDF data. VLDB J. 19(1), 91\u2013113 (2010)","journal-title":"VLDB J."},{"issue":"3","key":"558_CR47","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/1567274.1567278","volume":"34","author":"J P\u00e9rez","year":"2009","unstructured":"P\u00e9rez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. ACM Trans. Database Syst. 34(3), 16:1\u201316:45 (2009)","journal-title":"ACM Trans. Database Syst."},{"key":"558_CR48","doi-asserted-by":"crossref","unstructured":"Picalausa, F., Vansummeren, S.: What are real SPARQL queries like? In: International Workshop on Semantic Web Information Management (SWIM), pp. 1\u20137 (2011)","DOI":"10.1145\/1999299.1999306"},{"key":"558_CR49","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-25010-6_15","volume-title":"The Semantic Web - ISWC 2015","author":"Muhammad Saleem","year":"2015","unstructured":"Saleem, M., Ali, I., Hogan, A., Mehmood, Q., Ngonga Ngomo, A.-C.: LSQ: The linked SPARQL queries dataset. In: International Semantic Web Conference (ISWC), pp. 261\u2013269 (2015)"},{"key":"558_CR50","first-page":"228","volume-title":"Lecture Notes in Computer Science","author":"Mar\u00eda-Esther Vidal","year":"2010","unstructured":"Vidal, M., Ruckhaus, E., Lampo, T., Mart\u00ednez, A., Sierra, J., Polleres, A.: Efficiently joining group patterns in SPARQL queries. In: Extended Semantic Web Conference (ESWC), pp. 228\u2013242 (2010)"},{"issue":"10","key":"558_CR51","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629489","volume":"57","author":"D Vrandecic","year":"2014","unstructured":"Vrandecic, D., Kr\u00f6tzsch, M.: Wikidata: a free collaborative knowledgebase. Commun. ACM 57(10), 78\u201385 (2014)","journal-title":"Commun. ACM"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00558-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-019-00558-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00558-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T01:55:49Z","timestamp":1664070949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-019-00558-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,2]]},"references-count":51,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["558"],"URL":"https:\/\/doi.org\/10.1007\/s00778-019-00558-9","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,2]]},"assertion":[{"value":"12 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}