Querying Graph Patterns
Summary: Classifies graph patterns by features (node/label variables, regex edges) and gives tight data/combined complexity for standard graph queries, pinpointing features driving intractability and syntactic restrictions for tractability. Introduces a novel two-mode automata model (node-accepting vs path-accepting) for answering pattern queries, analyzes its algorithmic properties, and shows many hard cases can be cast as CSPs. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Pablo Barcelo
- 2. Leonid Libkin
- 3. Juan Reutter
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,040 | Querying Graph Databases | 2013 | PODS | 0.00014483577 |
| 2,557 | NeMa: Fast Graph Search with Label Similarity | 2013 | VLDB | 8.5484449e-05 |
| 3,330 | Schemaless and Structureless Graph Querying | 2014 | VLDB | 7.2116683e-05 |
| 5,435 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 5.5074113e-05 |
| 9,523 | ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs | 2020 | VLDB | 4.3273374e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 47 | Data Integration: A Theoretical Perspective | 2002 | PODS | 0.00069691761 |
| 142 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.00041780711 |
| 256 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00030241337 |
| 364 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00025657601 |
| 1,419 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00012072488 |
| 1,662 | Conjunctive Queries over Trees | 2004 | PODS | 0.00010966423 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010458164 |
| 2,943 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB | 7.8463193e-05 |
| 3,285 | Foundations of Semantic Web Databases | 2004 | PODS | 7.2738104e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,827 | The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs | 2022 | PODS | 4.4369334e-05 |
| 11,907 | Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? | 2015 | PODS | 4.1905499e-05 |
| 5,435 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 5.5074113e-05 |
| 4,207 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.3519481e-05 |
| 11,387 | Answering Regular Path Queries through Exemplars | 2022 | VLDB | 4.1905499e-05 |
| 460 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD | 0.00022679846 |
| 1,445 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB | 0.00011937596 |
| 11,017 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1905499e-05 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010458164 |
| 1,040 | Querying Graph Databases | 2013 | PODS | 0.00014483577 |