{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:04:58Z","timestamp":1754157898214,"version":"3.41.2"},"reference-count":17,"publisher":"Emerald","issue":"3","license":[{"start":{"date-parts":[[2009,8,28]],"date-time":"2009-08-28T00:00:00Z","timestamp":1251417600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,8,28]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>The purpose of this paper is to provide an efficient algorithm for Extensible Markup Language (XML) twig query evaluation.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>A single\u2010phase holistic twig pattern matching method based on the TwigStack algorithm is proposed. The method applies a novel stack structure to preserve the holisticity of the twig matches. Twig matches rooted at elements that are currently in the root stack are output directly.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>Without generating individual path matches as intermediate results, the method is able to avoid the storage and output\/input of the individual path matches, and totally eliminate the potentially time\u2010consuming merging operation. Experimental results demonstrate the applicability and advantages of our approach.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The paper proposes an efficient XML twig query evaluation algorithm, which by both theoretical analyses and empirical studies demonstrates its advantages over the current state\u2010of\u2010the\u2010art algorithm TwigStack.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17440080910983565","type":"journal-article","created":{"date-parts":[[2009,10,5]],"date-time":"2009-10-05T10:55:05Z","timestamp":1254740105000},"page":"305-326","source":"Crossref","is-referenced-by-count":0,"title":["Efficient XML tree pattern query evaluation using a novel one\u2010phase holistic twig join scheme"],"prefix":"10.1108","volume":"5","author":[{"given":"Zhewei","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen\u2010Chi","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dunren","family":"Che","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2022031220021487200_b1","unstructured":"Al\u2010Khalifa, S., Jagadish, H.V., Koudas, N., Patel, J.M., Srivastava, D. and Wu, Y. (2002), \u201cStructural joins: a primitive for efficient XML query pattern matching\u201d, Proceedings of the 18th International Conference on. Data Engineering (ICDE), Computer Society, Los Alamitos, CA, pp. 141\u201052."},{"key":"key2022031220021487200_b2","doi-asserted-by":"crossref","unstructured":"Bruno, N., Koudas, N. and Srivastava, D. (2002), \u201cHolistic twig joins: optimal XML pattern matching\u201d, Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, ACM Press, New York, NY, pp. 310\u201021.","DOI":"10.1145\/564691.564727"},{"key":"key2022031220021487200_b16","unstructured":"Busse, R., Carey, M., Florescu, D., Kersten, M., Manolescu, I., Schmidt, A. and Waas, F. (2003), \u201cXMark \u2013 an XML Benchmark Project\u201d, available at: http:\/\/monetdb.cwi.nl\/xml\/index.html."},{"key":"key2022031220021487200_b3","doi-asserted-by":"crossref","unstructured":"Che, D. and Hou, W\u2010C. (2008), \u201cDetermined: a system with novel techniques for XML query optimization and evaluation\u201d, International Journal of Web Information Systems, Vol. 4 No. 1, pp. 48\u201077.","DOI":"10.1108\/17440080810865620"},{"key":"key2022031220021487200_b4","doi-asserted-by":"crossref","unstructured":"Chen, T., Lu, J. and Ling, T.W. (2005), \u201cOn boosting holism in XML twig pattern matching using structural indexing techniques\u201d, Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 455\u201066.","DOI":"10.1145\/1066157.1066209"},{"key":"key2022031220021487200_b5","unstructured":"Florescu, D. and Kossmann, D. (1999), \u201cStoring and querying XML data using an RDBMS\u201d, Bulletin of the Technical Committee on Data Engineering, Vol. 22 No. 3 pp. 27\u201034."},{"key":"key2022031220021487200_b6","unstructured":"Goldman, R. and Widom, J. (1997), \u201cDataGuides: enabling query formulation and optimization in semistructured\u201d, Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB), Athens, August 25\u201029, Morgan Kaufmann, San Francisco, CA, pp. 436\u201045."},{"key":"key2022031220021487200_b7","doi-asserted-by":"crossref","unstructured":"Jiang, H., Wang, W., Lu, H. and Yu, J.X. (2003), \u201cHolistic twig joins on indexed XML Documents\u201d, Proceedings of the 29th International Conference on Very Large Data Bases, Morgan\u2010Kaufmann, Berlin, pp. 310\u201021.","DOI":"10.1016\/B978-012722442-8\/50032-X"},{"key":"key2022031220021487200_b8","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Bohannon, P., Naughton, J.F. and Korth, H.F. (2002), \u201cCovering indexes for branching path queries\u201d, Proceedings of the 2002 ACM SIGMOD Conference International Conference on Management of Data, ACM Press, New York, NY, pp. 133\u201044.","DOI":"10.1145\/564691.564707"},{"key":"key2022031220021487200_b9","doi-asserted-by":"crossref","unstructured":"Krishnamurthy, R., Kaushik, R. and Naughton, J. (2003), \u201cXML\u2010to\u2010SQL query translation literature: the state of the art and open problems\u201d, Proceedings of the 1st International XML Database Symposium (XSym), Berlin, Germany, pp. 1\u201018.","DOI":"10.1007\/978-3-540-39429-7_1"},{"key":"key2022031220021487200_b10","doi-asserted-by":"crossref","unstructured":"Lu, J., Chen, T. and Ling, T.W. (2004), \u201cEfficient processing of XML twig patterns with parent child edges: a look\u2010ahead approach\u201d, Proceedings of the 21st ACM SIGMOD International Conference on Information and Knowledge Management (CIKM), ACM Press, New. York, NY, pp. 533\u201042.","DOI":"10.1145\/1031171.1031272"},{"key":"key2022031220021487200_b11","unstructured":"Lu, J., Ling, T.W., Chan, C.\u2010Y. and Chen, T. (2005), \u201cFrom region encoding to extended dewey: on efficient processing of XML twig pattern\u201d, Proceedings of the 31st VLDB Conference, Trondheim, Norway, pp. 193\u2010204."},{"key":"key2022031220021487200_b12","doi-asserted-by":"crossref","unstructured":"Milo, T. and Suciu, D. (1999), \u201cIndex structures for path expressions\u201d, Proceedings of the 7th International Conference on Database Theory, January 10\u201012, pp. 277\u201095.","DOI":"10.1007\/3-540-49257-7_18"},{"key":"key2022031220021487200_b13","unstructured":"Polyzotis, N., Garofalakis, M. and Ioannidis, Y. (2004), \u201cSelectivity estimation for XML twigs\u201d, Proceedings of IEEE ICDE Conference, pp. 264\u201075."},{"key":"key2022031220021487200_b14","unstructured":"Shanmugasundaram, J., Tufte, K., He, G., Zhang, C., DeWitt, D. and Naughton, J.F. (1999), \u201cRelational databases for querying XML documents: limitations and opportunities\u201d, Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, pp. 302\u201014."},{"key":"key2022031220021487200_b17","unstructured":"University of Washington (n.d), XML Repository, University of Washington, available at: www.cs.washington.edu\/research\/xmldatasets\/."},{"key":"key2022031220021487200_b15","doi-asserted-by":"crossref","unstructured":"Zhang, C., Naughton, J., DeWitt, D., Luo, Q. and Lohman, G. (2001), \u201cOn supporting containment queries in relational database management systems\u201d, Proceedings of ACM SIGMOD Conference, pp. 425\u201036.","DOI":"10.1145\/376284.375722"}],"container-title":["International Journal of Web Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17440080910983565","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17440080910983565\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17440080910983565\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:24:59Z","timestamp":1753403099000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijwis\/article\/5\/3\/305-326\/164835"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,28]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,8,28]]}},"alternative-id":["10.1108\/17440080910983565"],"URL":"https:\/\/doi.org\/10.1108\/17440080910983565","relation":{},"ISSN":["1744-0084"],"issn-type":[{"type":"print","value":"1744-0084"}],"subject":[],"published":{"date-parts":[[2009,8,28]]}}}