{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:05:28Z","timestamp":1725753928846},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642416590"},{"type":"electronic","value":"9783642416606"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41660-6_15","type":"book-chapter","created":{"date-parts":[[2013,10,28]],"date-time":"2013-10-28T10:59:31Z","timestamp":1382957971000},"page":"273-290","source":"Crossref","is-referenced-by-count":0,"title":["Static Analysis and Query Answering for Incomplete Data Trees with Constraints"],"prefix":"10.1007","author":[{"given":"Am\u00e9lie","family":"Gheerbrant","sequence":"first","affiliation":[]},{"given":"Leonid","family":"Libkin","sequence":"additional","affiliation":[]},{"given":"Juan","family":"Reutter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1137\/050646895","volume":"38","author":"M. Arenas","year":"2008","unstructured":"Arenas, M., Fan, W., Libkin, L.: On the complexity of verifying consistency of XML specifications. SIAM J. Comput.\u00a038, 841\u2013880 (2008)","journal-title":"SIAM J. Comput."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1346330.1346332","volume":"55","author":"M. Arenas","year":"2008","unstructured":"Arenas, M., Libkin, L.: XML data exchange: consistency and query answering. Journal of the ACM\u00a055, 2 (2008)","journal-title":"Journal of the ACM"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1870103.1870107","volume":"58","author":"P. Barcel\u00f3","year":"2010","unstructured":"Barcel\u00f3, P., Libkin, L., Poggi, A., Sirangelo, C.: XML with incomplete information. Journal of the ACM\u00a058, 1 (2010)","journal-title":"Journal of the ACM"},{"unstructured":"Barcel\u00f3, P., Libkin, L., Reutter, J.: On incomplete XML documents with integrity constraints. In: AMW 2010 (2010)","key":"15_CR4"},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/j.jcss.2010.04.005","volume":"77","author":"H. Bj\u00f6rklund","year":"2011","unstructured":"Bj\u00f6rklund, H., Martens, W., Schwentick, T.: Conjunctive query containment over trees. J. Comput. Syst. Sci.\u00a077(3), 450\u2013472 (2011)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Bojanczyk, M.: Automata for data words and data trees. In: RTA 2010, pp. 1\u20134 (2010)","key":"15_CR6","DOI":"10.4204\/EPTCS.25.1"},{"issue":"4","key":"15_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/1970398.1970403","volume":"12","author":"M. Bojanczyk","year":"2011","unstructured":"Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Log.\u00a012(4), 27 (2011)","journal-title":"ACM Trans. Comput. Log."},{"doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Lasota, S.: An extension of data automata that captures XPath. Logical Methods in Computer Science\u00a08(1) (2012)","key":"15_CR8","DOI":"10.2168\/LMCS-8(1:5)2012"},{"issue":"5","key":"15_CR9","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S1389-1286(02)00223-2","volume":"39","author":"P. Buneman","year":"2002","unstructured":"Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, W.-C.: Keys for XML. Computer Networks\u00a039(5), 473\u2013487 (2002)","journal-title":"Computer Networks"},{"doi-asserted-by":"crossref","unstructured":"Cal\u00ec, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: PODS 2003, pp. 260\u2013271 (2003)","key":"15_CR10","DOI":"10.1145\/773153.773179"},{"unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y.: Regular XPath: constraints, query containment and view-based answering for XML documents. In: LID (2008)","key":"15_CR11"},{"issue":"3","key":"15_CR12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/2338626.2338632","volume":"37","author":"C. David","year":"2012","unstructured":"David, C., Libkin, L., Tan, T.: Efficient reasoning about data trees via integer linear programming. ACM TODS\u00a037(3), 19 (2012)","journal-title":"ACM TODS"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1145\/567112.567117","volume":"49","author":"W. Fan","year":"2002","unstructured":"Fan, W., Libkin, L.: On XML integrity constraints in the presence of DTDs. Journal of the ACM\u00a049, 368\u2013406 (2002)","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Figueira, D.: Forward-XPath and extended register automata on data-trees. In: ICDT 2010, pp. 231\u2013241 (2010)","key":"15_CR14","DOI":"10.1145\/1804669.1804699"},{"unstructured":"Figueira, D.: Bottom-up automata on data trees and vertical XPath. In: STACS 2011, pp. 93\u2013104 (2011)","key":"15_CR15"},{"doi-asserted-by":"crossref","unstructured":"Gheerbrant, A., Libkin, L., Tan, T.: On the complexity of query answering over incomplete XML documents. In: ICDT 2012, pp. 169\u2013181 (2012)","key":"15_CR16","DOI":"10.1145\/2274576.2274595"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/1131342.1131345","volume":"53","author":"G. Gottlob","year":"2006","unstructured":"Gottlob, G., Koch, C., Schulz, K.: Conjunctive queries over trees. Journal of the ACM\u00a053(2), 238\u2013272 (2006)","journal-title":"Journal of the ACM"},{"issue":"4","key":"15_CR18","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/1634.1886","volume":"31","author":"T. Imieli\u0144ski","year":"1984","unstructured":"Imieli\u0144ski, T., Lipski, W.: Incomplete information in relational databases. Journal of the ACM\u00a031(4), 761\u2013791 (1984)","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Jan Bex, G., Neven, F., Van den Bussche, J.: DTD versus XML Schema: A Practical Study. In: WEBDB 2004, pp. 79\u201384 (2004)","key":"15_CR19","DOI":"10.1145\/1017074.1017095"},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1558334.1558338","volume":"38","author":"A. Laender","year":"2009","unstructured":"Laender, A., Moro, M., Nascimento, C., Martins, P.: An X-Ray on Web-Available XML Schemas. SIGMOD Record\u00a038(1), 37\u201342 (2009)","journal-title":"SIGMOD Record"},{"issue":"2","key":"15_CR21","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.jal.2009.09.005","volume":"8","author":"L. Libkin","year":"2010","unstructured":"Libkin, L., Sirangelo, C.: Reasoning about XML with temporal logics and automata. J. Applied Logic\u00a08(2), 210\u2013232 (2010)","journal-title":"J. Applied Logic"},{"issue":"3","key":"15_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/1324185.1324188","volume":"36","author":"W. Martens","year":"2007","unstructured":"Martens, W., Neven, F., Schwentick, T.: Simple off the shelf abstractions for XML schema. SIGMOD Record\u00a036(3), 15\u201322 (2007)","journal-title":"SIGMOD Record"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L. Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 41\u201357. Springer, Heidelberg (2006)"},{"issue":"1","key":"15_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1276301.1276308","volume":"36","author":"L. Segoufin","year":"2007","unstructured":"Segoufin, L.: Static analysis of XML processing with data values. SIGMOD Record\u00a036(1), 31\u201338 (2007)","journal-title":"SIGMOD Record"},{"doi-asserted-by":"crossref","unstructured":"Tan, T.: An automata model for trees with ordered data values. In: LICS 2012 (2012)","key":"15_CR25","DOI":"10.1109\/LICS.2012.69"},{"key":"15_CR26","first-page":"317","volume":"1","author":"J.W. Thatcher","year":"1967","unstructured":"Thatcher, J.W.: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. JCSS\u00a01, 317\u2013322 (1967)","journal-title":"JCSS"}],"container-title":["Lecture Notes in Computer Science","In Search of Elegance in the Theory and Practice of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41660-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T01:12:28Z","timestamp":1558660348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41660-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642416590","9783642416606"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41660-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}