Stack-based Algorithms for Pattern Matching on DAGs
Summary: Stack-based algorithms evaluate path, twig, and DAG pattern queries directly on DAGs, avoiding transitive-closure and path-index materialization. They provide sound, complete, and experimentally validated processing with runtime quadratic in the average query-binding size. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Li Chen (University of California San Diego)
- 2. Amarnath Gupta (University of California San Diego)
- 3. M. Erdem Kurul (University of California San Diego)
BibTeX Citation
@article{chen_vldb05,
title = {{Stack-based Algorithms for Pattern Matching on DAGs}},
author = {Chen, Li and Gupta, Amarnath and Kurul, M. Erdem},
journal = {PVLDB},
series = {{VLDB} '05},
volume = {31},
pages = {493--504},
year = {2005}
}
Incoming Citations (Sorted by Pagerank)
Showing 27 of 27 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 163 | On Supporting Containment Queries in Relational Database Management Systems | 2001 | SIGMOD | 0.00027839792 |
| 175 | Holistic Twig Joins: Optimal XML Pattern Matching | 2002 | SIGMOD | 0.00027226333 |
| 187 | Algorithmics and Applications of Tree and Graph Searching | 2002 | PODS | 0.00026138589 |
| 282 | Efficient Management of Transitive Relationships in Large Data and Knowledge Bases | 1989 | SIGMOD | 0.0002242162 |
| 341 | Indexing and Querying XML Data for Regular Path Expressions | 2001 | VLDB | 0.00020704572 |
| 470 | Query Optimization for XML | 1999 | VLDB | 0.00017965707 |
| 718 | Covering Indexes for Branching Path Queries | 2002 | SIGMOD | 0.00014642961 |
| 1,658 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB | 0.00010092304 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,490 | Computing Label-Constraint Reachability in Graph Databases | 2010 | SIGMOD |
| 2 | 4,360 | Efficient External-Memory Bisimulation on DAGs | 2012 | SIGMOD |
| 3 | 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 4 | 4,113 | On Boosting Holism in XML Twig Pattern Matching Using Structural Indexing Techniques | 2005 | SIGMOD |
| 5 | 4,703 | Finding Patterns in a Knowledge Base using Keywords to Compose Table Answers | 2014 | VLDB |
| 6 | 4,986 | Querying Graph Patterns | 2011 | PODS |
| 7 | 4,066 | Twig2Stack: Bottom-up Processing of Generalized-Tree-Pattern Queries over XML Documents | 2006 | VLDB |
| 8 | 175 | Holistic Twig Joins: Optimal XML Pattern Matching | 2002 | SIGMOD |
| 9 | 4,221 | Efficient Algorithms for Exact Ranked Twig-Pattern Matching over Graphs | 2008 | SIGMOD |
| 10 | 12,352 | Comments on "Stack-based Algorithms for Pattern Matching on DAGs" | 2012 | VLDB |