Problems complete for deterministic logarithmic space
Journal of Algorithms
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Efficient Filtering of XML Documents for Selective Dissemination of Information
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Stream processing of XPath queries with predicates
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient Filtering of XML Documents with XPath Expressions
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
Processing XML streams with deterministic automata and stream indexes
ACM Transactions on Database Systems (TODS)
On the memory requirements of XPath evaluation over XML streams
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Buffering in query evaluation over XML streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Tree pattern aggregation for scalable XML data dissemination
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient algorithms for the tree homeomorphism problem
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Tight lower bounds for query processing on streaming and external memory data
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ACM Transactions on Database Systems (TODS)
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Materialized view selection for XQuery workloads
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Journal of Discrete Algorithms
Efficient processing of containment queries on nested sets
Proceedings of the 16th International Conference on Extending Database Technology
| Hi-index | 0.00 |
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we develop efficient algorithms for the tree homeomorphism problem, i.e., the problem of matching a tree pattern with exclusively transitive (descendant) edges. We first prove that deciding whether there is a tree homeomorphism is LOGSPACE-complete, improving on the current LOGCFL upper bound. Furthermore, we develop a practical algorithm for the tree homeomorphism decision problem that is both space- and time-efficient. The algorithm is in LOGDCFL and space consumption is strongly bounded, while the running time is linear in the size of the data tree. This algorithm immediately generalizes to the problem of matching the tree pattern against all subtrees of the data tree, preserving the mentioned efficiency properties.