{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:31Z","timestamp":1750307731578,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,3,23]],"date-time":"2009-03-23T00:00:00Z","timestamp":1237766400000},"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":[],"published-print":{"date-parts":[[2009,3,23]]},"DOI":"10.1145\/1514894.1514916","type":"proceedings-article","created":{"date-parts":[[2009,4,6]],"date-time":"2009-04-06T16:34:53Z","timestamp":1239035693000},"page":"174-182","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficient asymmetric inclusion between regular expression types"],"prefix":"10.1145","author":[{"given":"Dario","family":"Colazzo","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris Sud, Orsay"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Ghelli","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Pisa, Pisa - Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlo","family":"Sartiani","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Pisa, Pisa - Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,3,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841920_8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"M. A.\n      Bender\n     and \n      M.\n      Farach-Colton\n  . \n  The LCA problem revisited\n  . In G. H. Gonnet D. Panario and A. Viola editors LATIN volume \n  1776\n   of \n  Lecture Notes in Computer Science pages \n  88\n  --\n  94\n  . \n  Springer 2000\n  .   M. A. Bender and M. Farach-Colton. The LCA problem revisited. In G. H. Gonnet D. Panario and A. Viola editors LATIN volume 1776 of Lecture Notes in Computer Science pages 88--94. Springer 2000.","DOI":"10.1007\/10719839_9"},{"key":"e_1_3_2_1_3_1","first-page":"115","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases","author":"Bex G. J.","year":"2006","unstructured":"G. J. Bex , F. Neven , T. Schwentick , and K. Tuyls . Inference of concise dtds from xml data. In U. Dayal, K.-Y. Whang, D. B. Lomet, G. Alonso, G. M. Lohman, M. L. Kersten, S. K. Cha, and Y.-K. Kim, editors , Proceedings of the 32nd International Conference on Very Large Data Bases , Seoul, Korea, September 12--15 , 2006 , pages 115 -- 126 . ACM, 2006. G. J. Bex, F. Neven, T. Schwentick, and K. Tuyls. Inference of concise dtds from xml data. In U. Dayal, K.-Y. Whang, D. B. Lomet, G. Alonso, G. M. Lohman, M. L. Kersten, S. K. Cha, and Y.-K. Kim, editors, Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, September 12--15, 2006, pages 115--126. ACM, 2006."},{"key":"e_1_3_2_1_4_1","first-page":"43","volume-title":"WebDB","author":"Choi B.","year":"2002","unstructured":"B. Choi . What are real DTDs like ? In WebDB , pages 43 -- 48 , 2002 . B. Choi. What are real DTDs like? In WebDB, pages 43--48, 2002."},{"key":"e_1_3_2_1_5_1","volume-title":"Information Systems","author":"Colazzo D.","year":"2008","unstructured":"D. Colazzo , G. Ghelli , and C. Sartiani . Efficient inclusion for a class of xml types with interleaving and counting . Information Systems , 2008 . To Appear. D. Colazzo, G. Ghelli, and C. Sartiani. Efficient inclusion for a class of xml types with interleaving and counting. Information Systems, 2008. To Appear."},{"key":"e_1_3_2_1_6_1","volume-title":"Dipartimento di Informatica - Universit\u00e0 di Pisa","author":"Colazzo D.","year":"2007","unstructured":"D. Colazzo and C. Sartiani . Efficient subtyping for unordered XML types. Technical report , Dipartimento di Informatica - Universit\u00e0 di Pisa , 2007 . D. Colazzo and C. Sartiani. Efficient subtyping for unordered XML types. Technical report, Dipartimento di Informatica - Universit\u00e0 di Pisa, 2007."},{"key":"e_1_3_2_1_7_1","volume-title":"Workshop on Programming Language Technologies for XML (PLAN-X), informal proceedings","author":"Foster J. N.","year":"2007","unstructured":"J. N. Foster , B. C. Pierce , and A. Schmitt . A logic your typechecker can count on: Unordered tree types in practice . In Workshop on Programming Language Technologies for XML (PLAN-X), informal proceedings , Jan. 2007 . J. N. Foster, B. C. Pierce, and A. Schmitt. A logic your typechecker can count on: Unordered tree types in practice. In Workshop on Programming Language Technologies for XML (PLAN-X), informal proceedings, Jan. 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11965893_19"},{"key":"e_1_3_2_1_9_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/978-3-540-75987-4_16","volume-title":"Proceedings of the 11th International Symposium on Database Programming Languages, DBPL","author":"Ghelli G.","year":"2007","unstructured":"G. Ghelli , D. Colazzo , and C. Sartiani . Efficient inclusion for a class of XML types with interleaving and counting . In M. Arenas and M. I. Schwartzbach, editors, Proceedings of the 11th International Symposium on Database Programming Languages, DBPL 2007 , Vienna, Austria, September 23--24, 2007, Revised Selected Papers, volume 4797 of Lecture Notes in Computer Science , pages 231 -- 245 . Springer , 2007. G. Ghelli, D. Colazzo, and C. Sartiani. Efficient inclusion for a class of XML types with interleaving and counting. In M. Arenas and M. I. Schwartzbach, editors, Proceedings of the 11th International Symposium on Database Programming Languages, DBPL 2007, Vienna, Austria, September 23--24, 2007, Revised Selected Papers, volume 4797 of Lecture Notes in Computer Science, pages 231--245. Springer, 2007."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458135"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1166074.1166076"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1098"}],"event":{"name":"EDBT\/ICDT '09: EDBT\/ICDT '09 joint conference","acronym":"EDBT\/ICDT '09","location":"St. Petersburg Russia"},"container-title":["Proceedings of the 12th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1514894.1514916","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1514894.1514916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:43Z","timestamp":1750253923000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1514894.1514916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,23]]},"references-count":12,"alternative-id":["10.1145\/1514894.1514916","10.1145\/1514894"],"URL":"https:\/\/doi.org\/10.1145\/1514894.1514916","relation":{},"subject":[],"published":{"date-parts":[[2009,3,23]]},"assertion":[{"value":"2009-03-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}