Abstract
Since the extensible markup language XML emerged as a new standard for information representation and exchange on the Internet, the problem of storing, indexing, and querying XML documents has been among the major issues of database research. In this paper, we study the twig pattern matching and discuss a new algorithm for processing ordered twig pattern queries. The time complexity of the algorithmis bounded by O(|D|·|Q| + |T|·leaf Q ) and its space overhead is by O(leaf T ·leaf Q ), where T stands for a document tree, Q for a twig pattern and D is a largest data stream associated with a node q of Q, which contains the database nodes that match the node predicate at q. leaf T (leaf Q ) represents the number of the leaf nodes of T (resp. Q). In addition, the algorithm can be adapted to an indexing environment with XB-trees being used.
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
Catherine, B., Bird, S.: Towards a general model of Interlinear text. In: Proc. of EMELD Workshop, Lansing, MI (2003)
Müller, K.: Semi-automatic construction of a question tree bank. In: Proc. of the 4th Intl. Conf. on Language Resources and Evaluation, Lisbon, Portual (2004)
Rao, P., Moon, B.: Sequencing XML Data and Query Twigs for Fast Pat-tern Matching. ACM Transaction on Data base Systems 31(1), 299–345 (2006)
Wang, H., Meng, X.: On the Sequencing of Tree Structures for XML Indexing. In: Proc. Conf., Data Engineering, Tokyo, Japan, April 2005, pp. 372–385 (2005)
Zhang, C., Naughton, J., Dewitt, D., Luo, Q., Lohman, G.: on Supporting containment queries in relational database management systems. In: Proc. of ACM SIGMOD (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Y. (2009). Bottom-Up Evaluation of Twig Join Pattern Queries in XML Document Databases. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2009. Lecture Notes in Computer Science, vol 5690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03573-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-03573-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03572-2
Online ISBN: 978-3-642-03573-9
eBook Packages: Computer ScienceComputer Science (R0)