{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:13:56Z","timestamp":1778807636668,"version":"3.51.4"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T00:00:00Z","timestamp":1572912000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOD Rec."],"published-print":{"date-parts":[[2019,11,5]]},"abstract":"<jats:p>Since large structured query logs have recently become available, we have a new opportunity to gain insights in the types of queries that users ask. Even though such logs can be quite volatile, there are various new observations that can be made about the structure of queries inside them, on which we report here. Furthermore, building on an extensive analysis that has been done on such logs, we were able to provide a theoretical explanation why regular path queries in graph database applications behave better than worst-case complexity results suggest at first sight.<\/jats:p>","DOI":"10.1145\/3371316.3371319","type":"journal-article","created":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T18:56:07Z","timestamp":1572980167000},"page":"6-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Bridging Theory and Practice with Query Log Analysis"],"prefix":"10.1145","volume":"48","author":[{"given":"Wim","family":"Martens","sequence":"first","affiliation":[{"name":"University of Bayreuth, Bayreuth, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tina","family":"Trautner","sequence":"additional","affiliation":[{"name":"University of Bayreuth, Bayreuth, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,5]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Foundations of Databases","author":"Abiteboul S.","year":"1995","unstructured":"S. Abiteboul , R. Hull , and V. Vianu . Foundations of Databases . Addison-Wesley , 1995 . S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2467795"},{"key":"e_1_2_1_4_1","volume-title":"LDOW@WWW","author":"Bielefeldt A.","year":"2018","unstructured":"A. Bielefeldt , J. Gonsior , and M. Kr\u00a8otzsch . Practical linked data access via SPARQL: the case of wikidata . In LDOW@WWW , 2018 . A. Bielefeldt, J. Gonsior, and M. Kr\u00a8otzsch. Practical linked data access via SPARQL: the case of wikidata. In LDOW@WWW, 2018."},{"issue":"2","key":"e_1_2_1_5_1","first-page":"149","article-title":"An analytical study of large SPARQL query logs","volume":"11","author":"Bonifati A.","year":"2017","unstructured":"A. Bonifati , W. Martens , and T. Timm . An analytical study of large SPARQL query logs . PVLDB , 11 ( 2 ): 149 -- 161 , 2017 . A. Bonifati, W. Martens, and T. Timm. An analytical study of large SPARQL query logs. PVLDB, 11(2):149--161, 2017.","journal-title":"PVLDB"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00558-9"},{"key":"e_1_2_1_7_1","first-page":"127","volume-title":"WWW","author":"Bonifati A.","year":"2019","unstructured":"A. Bonifati , W. Martens , and T. Timm . Navigating the maze of wikidata query logs . In WWW , pages 127 -- 138 , 2019 . A. Bonifati, W. Martens, and T. Timm. Navigating the maze of wikidata query logs. In WWW, pages 127--138, 2019."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38749"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2886094"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190657"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902309"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90057-4"},{"key":"e_1_2_1_13_1","volume-title":"A trichotomy for regular trail queries. CoRR, abs\/1903.00226","author":"Martens W.","year":"2019","unstructured":"W. Martens , M. Niewerth , and T. Trautner . A trichotomy for regular trail queries. CoRR, abs\/1903.00226 , 2019 . W. Martens, M. Niewerth, and T. Trautner. A trichotomy for regular trail queries. CoRR, abs\/1903.00226, 2019."},{"key":"e_1_2_1_14_1","first-page":"1","volume-title":"ICDT","author":"Martens W.","year":"2018","unstructured":"W. Martens and T. Trautner . Evaluation and enumeration problems for regular path queries . In ICDT , pages 19: 1 -- 19 :21, 2018 . W. Martens and T. Trautner. Evaluation and enumeration problems for regular path queries. In ICDT, pages 19:1--19:21, 2018."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331446"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979122370X"},{"key":"e_1_2_1_17_1","volume-title":"The neo4j developer manual v3.2. https:\/\/neo4j.com\/docs\/developer-manual\/3.2\/","year":"2017","unstructured":"Neo4j. The neo4j developer manual v3.2. https:\/\/neo4j.com\/docs\/developer-manual\/3.2\/ , 2017 . Neo4j. The neo4j developer manual v3.2. https:\/\/neo4j.com\/docs\/developer-manual\/3.2\/, 2017."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322048"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371316.3371319","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3371316.3371319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:05Z","timestamp":1750204385000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371316.3371319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,5]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,11,5]]}},"alternative-id":["10.1145\/3371316.3371319"],"URL":"https:\/\/doi.org\/10.1145\/3371316.3371319","relation":{},"ISSN":["0163-5808"],"issn-type":[{"value":"0163-5808","type":"print"}],"subject":[],"published":{"date-parts":[[2019,11,5]]},"assertion":[{"value":"2019-11-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}