Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
From region encoding to extended dewey: on efficient processing of XML twig pattern matching
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Optimizing cursor movement in holistic twig joins
Proceedings of the 14th ACM international conference on Information and knowledge management
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Holistic twig joins on indexed XML documents
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Hi-index | 0.00 |
XML queries are based on path expressions which are equal to a combination of some elements connected to each other in a tree pattern structure, called Tree Pattern Query (TPQ). Therefore, the main operation in XML query processing is to find the nodes that match the given QTP in the document. A number of methods are offered for QTP matching, but the majority of these methods for accessing to all QTPs in the document, process all of the query nodes, So that they are very time-consuming. A few methods, such as TJFast, process only nodes which satisfy the leaves of QTP, so these methods need too less node access. But these methods also have to access too many useless nodes. Useless nodes are those that either do not participate in final result or produce repetitive result if they are processed. In this paper, by presenting Level-Based Index (LBI), we propose a method to index query leaves. By use of this structure, we could jump over useless nodes.