{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:06Z","timestamp":1750306086070,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T00:00:00Z","timestamp":1494547200000},"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":[[2017,5,12]]},"DOI":"10.1145\/3093754.3093758","type":"journal-article","created":{"date-parts":[[2017,5,15]],"date-time":"2017-05-15T12:13:58Z","timestamp":1494850438000},"page":"14-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Technical Perspective"],"prefix":"10.1145","volume":"46","author":[{"given":"Benny","family":"Kimelfeld","sequence":"first","affiliation":[{"name":"Technion -- Israel Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902295"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50022-7"},{"issue":"1","key":"e_1_2_1_3_1","first-page":"1","volume":"55","author":"Flesca S.","year":"2008","unstructured":"S. Flesca , F. Furfaro , and E. Masciari . On the minimization of XPath queries. J. ACM , 55 ( 1 ):2: 1 -- 2 :46, 2008 . S. Flesca, F. Furfaro, and E. Masciari. On the minimization of XPath queries. J. ACM, 55(1):2:1--2:46, 2008.","journal-title":"On the minimization of XPath queries. J. ACM"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353355"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3093754.3093758","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3093754.3093758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:16Z","timestamp":1750217416000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3093754.3093758"}},"subtitle":["Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data"],"short-title":[],"issued":{"date-parts":[[2017,5,12]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,5,12]]}},"alternative-id":["10.1145\/3093754.3093758"],"URL":"https:\/\/doi.org\/10.1145\/3093754.3093758","relation":{},"ISSN":["0163-5808"],"issn-type":[{"type":"print","value":"0163-5808"}],"subject":[],"published":{"date-parts":[[2017,5,12]]},"assertion":[{"value":"2017-05-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}