On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
On the Sequencing of Tree Structures for XML Indexing
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Sequencing XML data and query twigs for fast pattern matching
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
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.