{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T23:40:02Z","timestamp":1740008402350,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,4,13]],"date-time":"2010-04-13T00:00:00Z","timestamp":1271116800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s11280-010-0089-x","type":"journal-article","created":{"date-parts":[[2010,4,12]],"date-time":"2010-04-12T13:40:19Z","timestamp":1271079619000},"page":"343-371","source":"Crossref","is-referenced-by-count":5,"title":["XMin: Minimizing Tree Pattern Queries with Minimality Guarantee"],"prefix":"10.1007","volume":"13","author":[{"given":"Ki-Hoon","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyu-Young","family":"Whang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wook-Shin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,13]]},"reference":[{"key":"89_CR1","doi-asserted-by":"crossref","unstructured":"Al-Khalifa, S., Jagadish, H.V., Patel, J.M., Wu, Y., Koudas, N., Srivastava, D.: Structural joins: a primitive for efficient XML query pattern matching. In: Proc. the 20th IEEE Int\u2019l Conf. on Data Engineering (ICDE), pp. 141\u2013152 (2002)","DOI":"10.1109\/ICDE.2002.994704"},{"issue":"4","key":"89_CR2","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":"89_CR3","doi-asserted-by":"crossref","first-page":"44","DOI":"10.5626\/JCSE.2008.2.1.044","volume":"2","author":"Y An","year":"2008","unstructured":"An, Y., Borgida, A., Mylopoulos, J.: Discovering and maintaining semantic mappings between XML schemas and ontologies. J. Computing Sci. Eng. 2(1), 44\u201373 (2008)","journal-title":"J. Computing Sci. Eng."},{"key":"89_CR4","unstructured":"Arion, A., Benzaken, V., Manolescu, I., Papakonstantinou, Y.: Structured materialized views for XML queries. In: Proc. the 33rd Int\u2019l Conf. on Very Large Data Bases (VLDB), pp. 87\u201398 (2007)"},{"issue":"1","key":"89_CR5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s11280-007-0036-7","volume":"11","author":"A Arion","year":"2008","unstructured":"Arion, A., Bonifati, A., Manolescu, I., Pugliese, A.: Path summaries and path partitioning in modern XML databases. World Wide Web J. 11(1), 117\u2013151 (2008)","journal-title":"World Wide Web J."},{"key":"89_CR6","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proc. the 9th Annual ACM Symposium on Theory of Computing (STOC), pp. 77\u201390 (1977)","DOI":"10.1145\/800105.803397"},{"issue":"3","key":"89_CR7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1108\/17440080710834265","volume":"3","author":"D Che","year":"2007","unstructured":"Che, D.: An efficient algorithm for tree pattern query minimization under broad integrity constraints. Int. J. Web Inf. Syst. 3(3), 231\u2013256 (2007)","journal-title":"Int. J. Web Inf. Syst."},{"key":"89_CR8","doi-asserted-by":"crossref","unstructured":"Chen, D., Chan, C.: Minimization of tree pattern queries with constraints. In: Proc. Int\u2019l Conf. on Management of Data, ACM SIGMOD, pp. 609\u2013622 (2008)","DOI":"10.1145\/1376616.1376678"},{"key":"89_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Z., Jagadish, H.V., Lakshmanan, L.V.S., Paparizos, S.: From tree patterns to generalized tree patterns: on efficient evaluation of XQuery. In: Proc. the 29th Int\u2019l Conf. on Very Large Data Bases (VLDB), pp. 237\u2013248 (2003)","DOI":"10.1016\/B978-012722442-8\/50029-X"},{"issue":"1","key":"89_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1326554.1326556","volume":"55","author":"S Flesca","year":"2008","unstructured":"Flesca, S., Furfaro, F., Masciari, E.: On the minimization of XPath queries. J. ACM 55(1), 1\u201346 (2008)","journal-title":"J. ACM"},{"issue":"4","key":"89_CR11","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1145\/1185877.1185882","volume":"24","author":"P Geneves","year":"2006","unstructured":"Geneves, P., Layaida, N.: A system for the static analysis of XPath. ACM Trans. Inf. Sys. 24(4), 475\u2013502 (2006)","journal-title":"ACM Trans. Inf. Sys."},{"key":"89_CR12","unstructured":"Goldman,\u00a0R., Widom,\u00a0J.: DataGuides: enabling query formulation and optimization in semistructured databases. In: Proc. the 23rd Int\u2019l Conf. on Very Large Data Bases (VLDB), pp.\u00a0436\u2013445 (1997)"},{"issue":"2","key":"89_CR13","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/1071610.1071614","volume":"30","author":"G Gottlob","year":"2005","unstructured":"Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. ACM Trans. Database Syst. 30(2), 444\u2013491 (2005)","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"89_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.5381\/jot.2003.2.3.a2","volume":"2","author":"W-S Han","year":"2003","unstructured":"Han, W.-S., Lee, K.-H., Lee, B.-S.: An XML storage system for Object-Oriented\/Object-Relational DBMSs. J. Object Technol. 2(3), 113\u2013126 (2003)","journal-title":"J. Object Technol."},{"key":"89_CR15","doi-asserted-by":"crossref","unstructured":"Kimelfeld, B., Sagiv, Y.: Revisiting redundancy and minimization in an XPath fragment. In: Proc. the 11th Int\u2019l Conf. on Extending Database Technology (EDBT), pp. 61\u201372 (2008)","DOI":"10.1145\/1353343.1353355"},{"key":"89_CR16","doi-asserted-by":"crossref","unstructured":"Krishnamurthy, R., Kaushik, R., Naughton, J.F.: XML-to-SQL query translation literature: the state of the art and open problems. In: Proc. the 1st Int\u2019l XML Database Symposium, pp. 1\u201318 (2003)","DOI":"10.1007\/978-3-540-39429-7_1"},{"key":"89_CR17","doi-asserted-by":"crossref","unstructured":"Lee, K.-H., Kim, S.-Y., Whang, E., Lee, J.-G.: A practitioner\u2019s approach to normalizing XQuery expressions. In: Proc. 11th Int\u2019l Conf. on Database Systems for Advanced Applications (DASFAA), LNCS 3882, pp. 437\u2013453, Singapore (2006)","DOI":"10.1007\/11733836_31"},{"key":"89_CR18","doi-asserted-by":"crossref","unstructured":"Lee, K.-H., Whang, K.-Y., Han, W.-S., Kim, M.-S.: Structural consistency: enabling XML keyword search to eliminate spurious results consistently. VLDB J. (2009, in press)","DOI":"10.1007\/s00778-009-0177-7"},{"key":"89_CR19","doi-asserted-by":"crossref","unstructured":"Luo, C., Jiang, Z., Hou, W.-C., Yu, F., Zhu, Q.: A sampling approach for XML query selectivity estimation. In: Proc. the 12th Int\u2019l Conf. on Extending Database Technology (EDBT), pp. 335\u2013344 (2009)","DOI":"10.1145\/1516360.1516400"},{"key":"89_CR20","unstructured":"Miklau, G.: The XML Data Repository. http:\/\/www.cs.washington.edu\/research\/xmldatasets (2004)"},{"key":"89_CR21","doi-asserted-by":"crossref","unstructured":"Milo,\u00a0T., Suciu,\u00a0D.: Index structures for path expressions. In: Proc. the 7th Int\u2019l Conf. on Database Theory (ICDT), pp. 277\u2013295 (1999)","DOI":"10.1007\/3-540-49257-7_18"},{"key":"89_CR22","doi-asserted-by":"crossref","unstructured":"Moro, M.M., Vagena, Z., Tsotras, V.J.: Evaluating structural summaries as access methods for XML. In: Proc. the 15th Int\u2019l Conf. on World Wide Web (WWW), pp. 1079\u20131080 (2006)","DOI":"10.1145\/1135777.1136024"},{"issue":"3","key":"89_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-2(3:1)2006","volume":"2","author":"F Neven","year":"2006","unstructured":"Neven, F., Schwentick, T.: On the complexity of XPath containment in the presence of Disjunction, DTDs, and Variables. Logical Methods Comput. Sci. 2(3), 1\u201330 (2006)","journal-title":"Logical Methods Comput. Sci."},{"issue":"2","key":"89_CR24","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s11280-007-0037-6","volume":"11","author":"W Ng","year":"2008","unstructured":"Ng, W., Lau, H.L., Zhou, A.: Divide, compress and conquer: querying XML via partitioned path-based compressed data blocks. World Wide Web J. 11(2), 169\u2013197 (2008)","journal-title":"World Wide Web J."},{"key":"89_CR25","doi-asserted-by":"crossref","unstructured":"Park,\u00a0Y., Whang,\u00a0K., Lee,\u00a0B., Han,\u00a0W.: Efficient evaluation of partial match queries for XML documents using information retrieval techniques. In: Proc. the 10th Int\u2019l Conf. on Database Systems for Advanced Applications (DASFAA), pp.\u00a095\u2013112 (2005)","DOI":"10.1007\/11408079_11"},{"key":"89_CR26","doi-asserted-by":"crossref","unstructured":"Ramanan, P.: Efficient algorithms for minimizing tree pattern queries. In: Proc. Int\u2019l Conf. on Management of Data, ACM SIGMOD, pp. 299\u2013309 (2002)","DOI":"10.1145\/564691.564726"},{"key":"89_CR27","doi-asserted-by":"crossref","unstructured":"Ramanan, P.: Covering indexes for XML queries: bisimulation \u2212 simulation = negation. In: Proc. the 29th Int\u2019l Conf. on Very Large Data Bases (VLDB), pp. 165\u2013176 (2003)","DOI":"10.1016\/B978-012722442-8\/50023-9"},{"issue":"1","key":"89_CR28","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/1132863.1132871","volume":"31","author":"P Rao","year":"2006","unstructured":"Rao, P., Moon, B.: Sequencing XML data and query twigs for fast pattern matching. ACM Trans. Database Syst. 31(1), 299\u2013345 (2006)","journal-title":"ACM Trans. Database Syst."},{"key":"89_CR29","unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences. http:\/\/www.research.att.com\/~njas (2005)"},{"key":"89_CR30","doi-asserted-by":"crossref","unstructured":"Tian, F., Reinwald, B., Pirahesh,\u00a0H., Mayr,\u00a0T., Myllymaki,\u00a0J.: Implementing a scalable XML publish\/subscribe system using a relational database system. In: Proc. Int\u2019l Conf. on Management of Data, ACM SIGMOD, pp.\u00a0479\u2013490 (2004)","DOI":"10.1145\/1007568.1007623"},{"key":"89_CR31","doi-asserted-by":"crossref","unstructured":"Wang, H., Lin, Z.: A novel algorithm for counting all common subsequences. In: Proc. IEEE Int\u2019l Conf. on Granular Computing, pp. 502\u2013505 (2007)","DOI":"10.1109\/GrC.2007.112"},{"issue":"1","key":"89_CR32","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s11280-007-0029-6","volume":"11","author":"H Wang","year":"2008","unstructured":"Wang, H., Li, J., Wang, H.: Clustered chain path index for XML document: efficiently processing branch queries. World Wide Web 11(1), 153\u2013168 (2008)","journal-title":"World Wide Web"},{"key":"89_CR33","unstructured":"Whang,\u00a0K., Lee,\u00a0M., Lee,\u00a0J., Kim,\u00a0M., Han,\u00a0W.: Odysseus: a High-Performance ORDBMS Tightly-Coupled with IR Features. In: Proc. 21st IEEE Int\u2019l Conf. on Data Engineering (ICDE), pp.\u00a01004\u20131005 (2005). This paper received the Best Demonstration Award"},{"issue":"3","key":"89_CR34","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s11280-006-8557-z","volume":"9","author":"K-F Wong","year":"2006","unstructured":"Wong, K.-F., Yu, J.X., Tang, N.: Answering XML queries using path-based indexes: a survey. World Wide Web 9(3), 277\u2013299 (2006)","journal-title":"World Wide Web"},{"key":"89_CR35","unstructured":"Wood, P.T.: Minimising simple XPath expressions. In: Proc. the Fourth Int\u2019l Workshop on the Web and Databases (WebDB), pp. 13\u201318 (2001)"},{"key":"89_CR36","doi-asserted-by":"crossref","unstructured":"Wood, P.T.: Containment for XPath fragments under DTD constraints. In: Proc. the 9th Int\u2019l Conf. on Database Theory (ICDT), pp. 297\u2013311 (2003)","DOI":"10.1007\/3-540-36285-1_20"},{"key":"89_CR37","unstructured":"XMark\u2014An XML Benchmark Project. http:\/\/monetdb.cwi.nl\/xml"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-010-0089-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-010-0089-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-010-0089-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T23:12:43Z","timestamp":1740006763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-010-0089-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,13]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["89"],"URL":"https:\/\/doi.org\/10.1007\/s11280-010-0089-x","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2010,4,13]]}}}