Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 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
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Hash-base subgraph query processing method for graph-structured XML documents
Proceedings of the VLDB Endowment
Reducing graph matching to tree matching for XML queries with ID references
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Graph Pattern Matching: A Join/Semijoin Approach
IEEE Transactions on Knowledge and Data Engineering
Adding logical operators to tree pattern queries on graph-structured data
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
The paper "Stack-based Algorithms for Pattern Matching on DAGs" generalizes the classical holistic twig join algorithms and proposes PathStackD, TwigStackD and DagStackD to respectively evaluate path, twig and DAG pattern queries on directed acyclic graphs. In this paper, we investigate the major results of that paper, pointing out several discrepancies and proposing solutions to resolving them. We show that the original algorithms do not find particular types of query solutions that are common in practice. We also analyze the effect of an underlying assumption on the correctness of the algorithms and discuss the pre-filtering process that the original work proposes to prune redundant nodes. Our experimental study on both real and synthetic data substantiates our conclusions.