Abstract
Label stream partition is a useful technique to reduce the input I/O cost of holistic twig join by pruning useless streams beforehand. The Prefix Path Stream (PPS) partition scheme is effective for non-recursive XML documents, but inefficient for deep recursive XML documents due to the high CPU cost of pruning and merging too many streams for some twig pattern queries involving recursive tags. In this paper, we propose a general stream partition scheme called Recursive Path Stream (RPS), to control the total number of streams while providing pruning power. In particular, each recursive path in RPS represents a set of prefix paths which can be recursively expanded from the recursive path. We present the algorithms to build RPS scheme and prune RPS streams for queries. We also discuss the adaptability of RPS and provide a framework for performance tuning with general RPS based on different application requirements.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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. of ICDE Conference, pp. 141–152 (2002)
Bruno, N., Srivastava, D., Koudas, N.: Holistic twig joins: optimal XML pattern matching. In: Proc. of SIGMOD Conference, pp. 310–321 (2002)
Chen, T., Lu, J., Ling, T.W.: On boosting holism in XML twig pattern matching using structural indexing techniques. In: Proc. of SIGMOD Conference (2005)
Choi, B., Mahoui, M., Wood, D.: On the optimality of the holistic twig join algorithms. In: Proc. of DEXA, pp. 28–37 (2003)
Jiang, H., Lu, H., Wang, W.: Efficient processing of XML twig queries with or-predicates. In: Proc. of SIGMOD Conference (2004)
Jiang, H., Wang, W., Lu, H., Yu, J.: Holistic twig joins on indexed XML documents. In: Proc. of VLDB Conference, pp. 273–284 (2003)
Li, C., Ling, T.W., Hu, M.: Efficient processing of updates in dynamic XML data. In: Proc. of ICDE (2006)
Lu, J., Chen, T., Ling, T.W.: Efficient processing of XML twig patterns with parent child edges: a look-ahead approach. In: Proc. of CIKM, pp. 533–542 (2004)
Lu, J., Ling, T.W., Chan, C., Chen, T.: From region encoding to extended dewey: On efficient processing of XML twig pattern matching. In: Proc. of VLDB Conference, pp. 193–204 (2005)
Lu, J., Ling, T.-W., Yu, T., Li, C., Ni, W.: Efficient Processing of Ordered XML Twig Pattern. In: Andersen, K.V., Debenham, J., Wagner, R. (eds.) DEXA 2005. LNCS, vol. 3588, pp. 300–309. Springer, Heidelberg (2005)
Yu, T., Ling, T.-W., Lu, J.: TwigStackList ¬: A Holistic Twig Join Algorithm for Twig Query with Not-Predicates on XML Data. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 249–263. Springer, Heidelberg (2006)
Zhang, C., Naughton, J.F., DeWitt, D.J., Luo, Q., Lohman, G.M.: On supporting containment queries in relational database management systems. In: Proc. of SIGMOD Conference, pp. 425–436 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, B., Ling, T.W., Özsu, M.T., Zhu, Z. (2007). On Label Stream Partition for Efficient Holistic Twig Join. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_67
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)