{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:11:44Z","timestamp":1725869504746},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_17","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T08:16:59Z","timestamp":1477815419000},"page":"230-240","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity of Extracting Subtree with Keeping Distinguishability"],"prefix":"10.1007","author":[{"given":"Xianmin","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zhipeng","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Dongjing","family":"Miao","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Neven, F., Schwentick, T.: Expressive, efficient pattern languages for tree-structured data. In: PODS (2000)","DOI":"10.1145\/335168.335217"},{"issue":"10","key":"17_CR2","doi-asserted-by":"crossref","first-page":"1381","DOI":"10.1109\/TKDE.2007.1060","volume":"19","author":"G Gou","year":"2007","unstructured":"Gou, G., Chirkova, R.: Efficiently querying large XML data repositories: a survey. IEEE Trans. Knowl. Data Eng. 19(10), 1381\u20131403 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0020-0190(02)00345-9","volume":"85","author":"J-K Min","year":"2003","unstructured":"Min, J.-K., Ahn, J.-Y., Chung, C.-W.: Efficient extraction of schemas for XML documents. Inf. Process. Lett. 85, 7\u201312 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"17_CR4","first-page":"11:1","volume":"35","author":"GJ Bex","year":"2010","unstructured":"Bex, G.J., Neven, F., Schwentick, T., Vansummeren, S.: Inference of concise regular expressions and DTDs. ACM Trans. Database Syst. (TODS) 35(2), 11:1\u201311:47 (2010)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"3","key":"17_CR5","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1561\/1900000003","volume":"1","author":"S Sarawagi","year":"2008","unstructured":"Sarawagi, S.: Information extraction. Found. Trends Databases 1(3), 261\u2013344 (2008)","journal-title":"Found. Trends Databases"},{"issue":"2\u20133","key":"17_CR6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10994-008-5049-7","volume":"71","author":"S Raeymaekers","year":"2008","unstructured":"Raeymaekers, S., Bruynooghe, M., Bussche, J.: Learning ( $$k, l$$ )-contextual tree languages for information extraction. Mach. Learn. 71(2\u20133), 155\u2013183 (2008)","journal-title":"Mach. Learn."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Staworko, S., Wieczorek, P.: Learning twig, path queries. In: ICDT (2012)","DOI":"10.1145\/2274576.2274592"},{"issue":"1","key":"17_CR8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10994-006-9613-8","volume":"66","author":"J Carme","year":"2007","unstructured":"Carme, J., Gilleron, R., Lemay, A., Niehren, J.: Interactive learning of node selecting tree transducer. Mach. Learn. 66(1), 33\u201367 (2007)","journal-title":"Mach. Learn."},{"issue":"4","key":"17_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1841909.1841911","volume":"4","author":"GJ Bex","year":"2010","unstructured":"Bex, G.J., Neven, F., Vansummeren, S.: Learning deterministic regular expressions for the inference of schemas from xml data. ACM Trans. Web 4(4), 1\u201332 (2010)","journal-title":"ACM Trans. Web"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Liu, L., Pu, C., Han, W.: XWRAP: an XML-enabled wrapper construction system for web information sources. In: ICDE, pp. 611\u2013621 (2000)","DOI":"10.1109\/ICDE.2000.839475"},{"issue":"1","key":"17_CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.tcs.2005.10.022","volume":"350","author":"Y Suzuki","year":"2006","unstructured":"Suzuki, Y., Shoudai, T., Uchida, T., Miyahara, T.: Ordered term tree languages which are polynomial time inductively inferable from positive data. Theoret. Comput. Sci. 350(1), 63\u201390 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"17_CR12","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s00778-002-0076-7","volume":"11","author":"S Amer-Yahia","year":"2002","unstructured":"Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Tree pattern query minimization. VLDB J. 11(4), 315\u2013331 (2002)","journal-title":"VLDB J."},{"issue":"1","key":"17_CR13","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/962446.962448","volume":"51","author":"G Miklau","year":"2004","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. J. ACM 51(1), 2\u201345 (2004)","journal-title":"J. ACM"},{"issue":"1","key":"17_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1456650.1456653","volume":"41","author":"M Benedikt","year":"2009","unstructured":"Benedikt, M., Koch, C.: XPath leashed. ACM Comput. Surv. (CSUR) 41(1), 1\u201354 (2009)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"17_CR15","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T04:40:41Z","timestamp":1568522441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}