Matching subsequences in trees

Authors:
Philip Bille;Inge Li Gørtz
Affiliations:
IT University of Copenhagen;Technical University of Denmark
Venue:
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Year:
2006

Citing 10
Cited 0

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
Searching subsequences

Theoretical Computer Science
Ordered and Unordered Tree Inclusion

SIAM Journal on Computing
Multi-subsequence searching

Information Processing Letters
Querying and ranking XML documents

Journal of the American Society for Information Science and Technology - XML
Deterministic dictionaries

Journal of Algorithms
A linear-time algorithm for a special case of disjoint set union

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
TreeFinder: a First Step towards XML Data Mining

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Finding hot query patterns over an XQuery stream

The VLDB Journal — The International Journal on Very Large Data Bases
Efficient mining of XML query patterns for caching

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new algorithms improving the previously best known time and space bounds.