Using XML structure to reduce candidate nodes participated in query processing

Authors:
Zhenying He;Jianzhong Li;Chaokun Wang;Pengcheng Ge;Haikun Chen
Affiliations:
Department of Computer Science and Engineering, Harbin Institute of Technology, China;Department of Computer Science and Engineering, Harbin Institute of Technology, China;Department of Computer Science and Engineering, Harbin Institute of Technology, China;Department of Computer Science and Engineering, Harbin Institute of Technology, China;Department of Computer Science and Engineering, Harbin Institute of Technology, China
Venue:
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Year:
2005

Citing 8
Cited 0

On supporting containment queries in relational database management systems

SIGMOD '01 Proceedings of the 2001 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
Indexing and Querying XML Data for Regular Path Expressions

Proceedings of the 27th International Conference on Very Large Data Bases
Structural Joins: A Primitive for Efficient XML Query Pattern Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Efficient processing of XML twig queries with OR-predicates

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach

Proceedings of the thirteenth 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several algorithms have focused on processing path expression queries. Following those algorithms, all the nodes, matched with path expressions, are participated in computing. In this paper, we propose a novel filter strategy to reduce the number of candidate nodes based on the structure of XML data. All nodes are clustered based on their labels, and path information of each node is kept in bit vectors. Our filter technology mainly depends on high performance of bit operations. The experimental results show that these filter algorithms are effective, scalable and efficient.