Stack-based Algorithms for Pattern Matching on DAGs

  title={Stack-based Algorithms for Pattern Matching on DAGs},
  author={Li Chen and Amarnath Gupta and M. Erdem Kurul},
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based algorithms to handle path, twig, and dag pattern queries for directed acyclic graphs (DAGs) in particular. Our algorithms do not precompute the transitive closure nor path indexes for a given graph, however they achieve an optimal runtime complexity quadratic in the average size of the query variable bindings. We prove… CONTINUE READING
Highly Influential
This paper has highly influenced 30 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 161 citations. REVIEW CITATIONS
106 Citations
23 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 106 extracted citations

162 Citations

Citations per Year
Semantic Scholar estimates that this publication has 162 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.

Similar Papers

Loading similar papers…