WWW '99 Proceedings of the eighth international conference on World Wide Web
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
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient Relational Storage and Retrieval of XML Documents
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
Quilt: An XML Query Language for Heterogeneous Data Sources
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
Tree pattern query minimization
The VLDB Journal — The International Journal on Very Large Data Bases
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
On the minimization of Xpath queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
From tree patterns to generalized tree patterns: on efficient evaluation of XQuery
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Holistic twig joins on indexed XML documents
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
PageTailor: reusable end-user customization for the mobile web
Proceedings of the 5th international conference on Mobile systems, applications and services
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Exploiting the structure of update fragments for efficient XML index maintenance
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
GQLX: a new graphical query language for XML data
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
A powerful visual formalism for XML data
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
Approximate common structures in XML schema matching
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
| Hi-index | 0.01 |
Finding all distinct matchings of the query tree pattern is the core operation of XML query evaluation. The existing methods for tree pattern matching are decomposition-matching-merging processes, which may produce large useless intermediate result or require repeated matching of some sub-patterns. We propose a fast tree pattern matching algorithm called TreeMatch to directly 拢nd all distinct matchings of a query tree pattern. The only requirement for the data source is that the matching elements of the non-leaf pattern nodes do not contain sub-elements with the same tag. The TreeMatch does not produce any intermediate results and the 拢nal results are compactly encoded in stacks, from which the explicit representation can be produced ef拢ciently.