Twig query is a core operation in processing and optimizing XML structural queries. Recently, various algorithms have been proposed for finding twig patterns efficiently. Most of them are based on region labeling, pay little attention on nodes level information, and require additional caches such as stacks or lists to maintain the intermediate matching results, which cause the performance bottleneck of these algorithms. In contrast to previous work, we present a bottom-up algorithm for twig queries, which does not require additional caches and introduces idea of string searching to determine binary relationship between two nodes. Be- sides, this paper presents a node filtering mechanism–PathLevel, which can also be used in other algorithms for speeding up the query. Comprehensive experiments on several datasets demonstrate our method is an effective way for twig query.
[1]
Hua-Gang Li,et al.
Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents
,
2006,
VLDB.
[2]
Chun Zhang,et al.
Storing and querying ordered XML using a relational database system
,
2002,
SIGMOD '02.
[3]
Divesh Srivastava,et al.
Holistic twig joins: optimal XML pattern matching
,
2002,
SIGMOD '02.
[4]
Tok Wang Ling,et al.
From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching
,
2005,
VLDB.
[5]
David J. DeWitt,et al.
On supporting containment queries in relational database management systems
,
2001,
SIGMOD '01.