ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
ACM Transactions on Information Systems (TOIS)
A signature access method for the Starburst database system
VLDB '89 Proceedings of the 15th international conference on Very large data bases
On query languages for the P-string data model
Information modelling and knowledge bases
Information retrieval
Evaluation of signature files as set access facilities in OODBs
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
More efficient algorithm for ordered tree inclusion
Journal of Algorithms
Tree pattern matching and subset matching in deterministic O(n log3 n)-time
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Atlas: A Nested Relational Database System for Text Applications
IEEE Transactions on Knowledge and Data Engineering
Applying Signatures for Forward Traversal Query Processing in Object-Oriented Databases
Proceedings of the Tenth International Conference on Data Engineering
Using Signature Files for Querying Time-Series Data
PKDD '97 Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery
A New Algorithm for the Ordered Tree Inclusion Problem
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
On the Signature Trees and Balanced Signature Trees
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
On Chen and Chen's new tree inclusion algorithm
Information Processing Letters
| Hi-index | 0.89 |
We consider the following tree-matching problem: Given labeled, ordered trees P and T, can P be obtained from T by deleting nodes? Deleting a node v entails removing all edges incident to v and, if v has a parent u, replacing the edges from u to v by edges from u to the children of v. The existing algorithm for this problem needs O(|T||leaves(P)|) time and O(|leaves(P)|min{DT, |leaves(T)|}) space, where leaves(P) (leaves(T)) stands for the number of the leaves of P(T), and DT for the height of T. In this paper, we present a new algorithm that requires O(|T|min{DP, |leaves(P)|}) time and no extra space, where Dp represents the height of P.