{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:18Z","timestamp":1750306338286,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,15]],"date-time":"2016-06-15T00:00:00Z","timestamp":1465948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["UMO-2013\/11\/D\/ST6\/03075"],"award-info":[{"award-number":["UMO-2013\/11\/D\/ST6\/03075"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["MA 4938\/2-1"],"award-info":[{"award-number":["MA 4938\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,15]]},"DOI":"10.1145\/2902251.2902295","type":"proceedings-article","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T20:16:05Z","timestamp":1466108165000},"page":"43-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Minimization of Tree Pattern Queries"],"prefix":"10.1145","author":[{"given":"Wojciech","family":"Czerwinski","sequence":"first","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Bayreuth, Bayreuth, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Niewerth","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Bayreuth, Universit\u00e4t Bayreuth, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawel","family":"Parys","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1620585.1620590"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/13.6.939"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-002-0076-7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2669205"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1870103.1870107"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346330.1346333"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.04.005"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_17"},{"key":"e_1_3_2_1_9_1","volume-title":"Extreme Markup Languages Conference","author":"Cassidy S.","year":"2003","unstructured":"S. Cassidy . Generalizing XPath for directed graphs . In Extreme Markup Languages Conference , 2003 . S. Cassidy. Generalizing XPath for directed graphs. In Extreme Markup Languages Conference, 2003."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/137097.137869"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00220-0"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376678"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745754.2745766"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866480.1866504"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.203"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315466"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1326554.1326556"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1938551.1938578"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39666-3_2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071614"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1131342.1131345"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/382780.382783"},{"key":"e_1_3_2_1_24_1","volume-title":"https:\/\/github.com\/tinkerpop\/gremlin\/wiki","author":"Language Gremlin","year":"2013","unstructured":"Gremlin Language . https:\/\/github.com\/tinkerpop\/gremlin\/wiki , 2013 . Gremlin Language. https:\/\/github.com\/tinkerpop\/gremlin\/wiki, 2013."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353355"},{"key":"e_1_3_2_1_26_1","first-page":"131","volume-title":"International Conference on Database Theory (ICDT)","author":"Kostylev E. V.","year":"2014","unstructured":"E. V. Kostylev , J. L. Reutter , and D. Vrgoc . Containment of data graph queries . In International Conference on Database Theory (ICDT) , pages 131 -- 142 , 2014 . E. V. Kostylev, J. L. Reutter, and D. Vrgoc. Containment of data graph queries. In International Conference on Database Theory (ICDT), pages 131--142, 2014."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448513"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45206-5_13"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/962446.962448"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656266"},{"key":"e_1_3_2_1_31_1","volume-title":"On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science, 2(3)","author":"Neven F.","year":"2006","unstructured":"F. Neven and T. Schwentick . On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science, 2(3) , 2006 . F. Neven and T. Schwentick. On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science, 2(3), 2006."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564726"},{"key":"e_1_3_2_1_33_1","volume-title":"XML Path Language 3.0. Technical report","author":"Robie J.","year":"2014","unstructured":"J. Robie , D. Chamberlin , M. Dyck , and J. Snelson . XML Path Language 3.0. Technical report , World Wide Web Consortium , April 2014 . Recommendation, http:\/\/www.w3.org\/TR\/2014\/REC-xpath-30--20140408\/. J. Robie, D. Chamberlin, M. Dyck, and J. Snelson. XML Path Language 3.0. Technical report, World Wide Web Consortium, April 2014. Recommendation, http:\/\/www.w3.org\/TR\/2014\/REC-xpath-30--20140408\/."},{"key":"e_1_3_2_1_34_1","first-page":"144","volume-title":"International Conference on Database Theory (ICDT)","author":"Staworko S.","year":"2015","unstructured":"S. Staworko and P. Wieczorek . Characterizing XML twig queries with examples . In International Conference on Database Theory (ICDT) , pages 144 -- 160 , 2015 . S. Staworko and P. Wieczorek. Characterizing XML twig queries with examples. In International Conference on Database Theory (ICDT), pages 144--160, 2015."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-008-9151-9"},{"key":"e_1_3_2_1_36_1","first-page":"13","volume-title":"WebDB","author":"Wood P. T.","year":"2001","unstructured":"P. T. Wood . Minimising simple XPath expressions . In WebDB , pages 13 -- 18 , 2001 . P. T. Wood. Minimising simple XPath expressions. In WebDB, pages 13--18, 2001."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083610"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1286831.1286840"}],"event":{"name":"SIGMOD\/PODS'16: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"San Francisco California USA","acronym":"SIGMOD\/PODS'16"},"container-title":["Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2902251.2902295","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2902251.2902295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:59Z","timestamp":1750222499000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2902251.2902295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,15]]},"references-count":38,"alternative-id":["10.1145\/2902251.2902295","10.1145\/2902251"],"URL":"https:\/\/doi.org\/10.1145\/2902251.2902295","relation":{},"subject":[],"published":{"date-parts":[[2016,6,15]]},"assertion":[{"value":"2016-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}