Abstract
Twig based optimisation is one of the current approaches to improving XML query performance. It uses structural joins to find all pairs of elements in the XML documents satisfying the primitive structural relationships specified in the XML queries. They focus on parent-child and ancestor-descendant relationships. Efficient location of all joins is one of the core operations in XML query processing. In this paper, we propose a pattern matching algorithm called OTwig, which extends existing research on twig pattern matching. It demonstrates an improvement over existing pattern matching algorithms while also optimising memory usage.
Funded by Enterprise Ireland Grant No. CFTD/07/201.
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
Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On Supporting Containment Queries In Relational Database Management Systems. SIGMOD Rec., 425–436 (2001)
Al-khalifa, S., Patel, J.M.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: Proceedings of the 18th International Conference on Data Engineering. IEEE Computer Society, Los Alamitos (2002)
Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML Pattern Matching. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data. ACM, New York (2002)
Chen, S., Li, H.G., Tatemura, J., Hsiung, W.P., Agrawal, D., Candan, K.S.: Twig 2 Stack: Bottom-up Processing Of Generalized Tree Pattern Queries over XML Documents. In: Proceedings of the 32nd International Conference on Very Large Data Bases. ACM, New York (2006)
Lu, J., Chen, T., Ling, T.W.: Efficient Processing Of XML Twig Patterns With Parent Child Edges: A Look-Ahead Approach. In: Proceedings of the Thirteenth ACM International Conference on Information and Knowledge Management, pp. 533–542. ACM, New York (2004)
Lu, J., Chen, T., Ling, T.W.: TJFast: Effective Processing Of XML Twig Pattern Matching. In: WWW (Special Interest Tracks and Posters), pp. 1118–1119. ACM, New York (2005)
Qin, L., Yu, J.X., Ding, B.: Twiglist: Make Twig Pattern Matching Fast. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 850–862. Springer, Heidelberg (2007)
Marks, G., Roantree, M.: Pattern Based Processing of xpath Queries. In: IDEAS 2008: Proceedings of the 2008 International Symposium on Database Engineering Applications, pp. 179–188. ACM, New York (2008)
Gou, G., Chirkova, R.: Efficiently Querying Large XML Data Repositories: A Survey. IEEE Trans. on Knowl. and Data Eng., 1381–1403 (2007)
Wu, X., Lee, M.L., Hsu, W.: A Prime Number Labeling Scheme for Dynamic Ordered XML Trees. In: ICDE 2004: Proceedings of the 20th International Conference on Data Engineering, pp. 66–78. IEEE Computer Society, Los Alamitos (2004)
Wang, H., Park, S., Fan, W., Yu, P.S.: Vist: a Dynamic Index Method for Querying XML Data by Tree Structures. In: SIGMOD, pp. 110–121. ACM, New York (2003)
Rao, P., Moon, B.: Prix: Indexing and Querying XML Using Prufer Sequences. In: ICDE, pp. 288–300. IEEE Computer Society, Los Alamitos (2004)
Wang, H., Meng, X.: On the Sequencing of Tree Structures for XML Indexing. In: ICDE 2005, pp. 372–383. IEEE Computer Society, Los Alamitos (2005)
Liu, J.: Using OTwig to Boost XML Query Performance. TechReport, Dublin City University (November 2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, J., Roantree, M. (2010). OTwig: An Optimised Twig Pattern Matching Approach for XML Databases. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-11266-9_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11265-2
Online ISBN: 978-3-642-11266-9
eBook Packages: Computer ScienceComputer Science (R0)