XML Query Processing Using Signature and DTD
EC-WEB '02 Proceedings of the Third International Conference on E-Commerce and Web Technologies
Efficient preprocessing of XML queries using structured signatures
Information Processing Letters
Incremental maintenance of XML structural indexes
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A partition index for XML and semi-structured data
Data & Knowledge Engineering
Tree inclusion algorithm, signatures and evaluation of path-oriented queries
Proceedings of the 2006 ACM symposium on Applied computing
Early evaluating XML trees in object repositories
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
| Hi-index | 0.00 |
Abstract: XML is represented as a tree and the query as a regular path expression. The query is evaluated by traversing each node of the tree. Several indexes are proposed for regular path expressions. In some cases these indexes may not cover all possible paths because of storage requirements. In this paper, we propose a signature-based query optimization technique to minimize the number of nodes retrieved from the database when the indexes cannot be used. The signature is a hint attached to each node, and is used to prune unnecessary sub-trees as early as possible when traversing nodes. For this goal, we propose a signature-based DOM (s-DOM) as a storage model and a signature-based query executor (s-NFA). Our experimental results show that the signature method outperforms the original.