{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:20:49Z","timestamp":1725492049550},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540759867"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75987-4_16","type":"book-chapter","created":{"date-parts":[[2007,10,4]],"date-time":"2007-10-04T09:29:16Z","timestamp":1191490156000},"page":"231-245","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Inclusion for a Class of XML Types with Interleaving and Counting"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Ghelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Colazzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlo","family":"Sartiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Database Theory \u2013 ICDT 2007","author":"W. Gelade","year":"2006","unstructured":"Gelade, W., Martens, W., Neven, F.: Optimizing schema languages for XML: Numerical constraints and interleaving. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol.\u00a04353, Springer, Heidelberg (2006)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1006\/inco.1994.1098","volume":"115","author":"A.J. Mayer","year":"1994","unstructured":"Mayer, A.J., Stockmeyer, L.J.: Word problems-this time with interleaving. Inf. Comput.\u00a0115, 293\u2013311 (1994)","journal-title":"Inf. Comput."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bex, G.J., Neven, F., den Bussche, J.V.: DTDs versus XML schema: A practical study. In: Amer-Yahia, S., Gravano, L. (eds.) WebDB, pp. 79\u201384 (2004)","DOI":"10.1145\/1017074.1017095"},{"key":"16_CR4","first-page":"115","volume-title":"VLDB","author":"G.J. Bex","year":"2006","unstructured":"Bex, G.J., Neven, F., Schwentick, T., Tuyls, K.: Inference of concise DTDs from XML data. In: Dayal, U., Whang, K.Y., Lomet, D.B., Alonso, G., Lohman, G.M., Kersten, M.L., Cha, S.K., Kim, Y.K. (eds.) VLDB, pp. 115\u2013126. ACM Press, New York (2006)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Minimization of tree pattern queries. In: SIGMOD Conference, pp. 497\u2013508 (2001)","DOI":"10.1145\/375663.375730"},{"key":"16_CR6","unstructured":"Thompson, H.S., Beech, D., Maloney, M., Mendelsohn, N.: XML Schema Part 1: Structures Second Edition. Technical report, World Wide Web Consortium, W3C Recommendation (2004)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1007\/978-3-540-28629-5_70","volume-title":"Mathematical Foundations of Computer Science 2004","author":"W. Martens","year":"2004","unstructured":"Martens, W., Neven, F., Schwentick, T.: Complexity of decision problems for simple regular expressions. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 889\u2013900. Springer, Heidelberg (2004)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","first-page":"300","volume-title":"Database Theory - ICDT 2003","author":"P.T. Wood","year":"2002","unstructured":"Wood, P.T.: Containment for XPath fragments under DTD constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 300\u2013314. Springer, Heidelberg (2002)"},{"key":"16_CR9","unstructured":"Ghelli, G., Colazzo, D., Sartiani, C.: Efficient inclusion for a class of XML types with interleaving and counting. Technical report, Dipartimento di Informatica - Universit\u00e0 di Pisa (2007)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/320064.320066","volume":"4","author":"C. Beeri","year":"1979","unstructured":"Beeri, C., Bernstein, P.A.: Computational problems related to the design of normal form relational schemas. ACM Trans. Database Syst.\u00a04, 30\u201359 (1979)","journal-title":"ACM Trans. Database Syst."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"key":"16_CR12","unstructured":"Foster, J.N., Pierce, B.C., Schmitt, A.: A logic your typechecker can count on: Unordered tree types in practice. In: PLAN-X, informal proceedings (2007)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1109\/ICDE.2004.1320036","volume-title":"ICDE","author":"D. Barbosa","year":"2004","unstructured":"Barbosa, D., Mendelzon, A.O., Libkin, L., Mignet, L., Arenas, M.: Efficient incremental validation of XML documents. In: ICDE, pp. 671\u2013682. IEEE Computer Society Press, Los Alamitos (2004)"}],"container-title":["Lecture Notes in Computer Science","Database Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75987-4_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:38:42Z","timestamp":1619505522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75987-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540759867"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75987-4_16","relation":{},"subject":[]}}