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,037 | Querying Graph Databases | 2013 | PODS | 0.00014502493 |
| 2,551 | NeMa: Fast Graph Search with Label Similarity | 2013 | VLDB | 8.5572574e-05 |
| 3,320 | Schemaless and Structureless Graph Querying | 2014 | VLDB | 7.2249102e-05 |
| 5,424 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 5.5126983e-05 |
| 9,580 | ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs | 2020 | VLDB | 4.3234342e-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 |
|---|---|---|---|---|
| 48 | Data Integration: A Theoretical Perspective | 2002 | PODS | 0.00069720859 |
| 144 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.00041462501 |
| 256 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00030259041 |
| 363 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00025715157 |
| 1,414 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00012118275 |
| 1,663 | Conjunctive Queries over Trees | 2004 | PODS | 0.00010977096 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010467069 |
| 2,938 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB | 7.8524059e-05 |
| 3,282 | Foundations of Semantic Web Databases | 2004 | PODS | 7.2808673e-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.4411907e-05 |
| 11,899 | Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? | 2015 | PODS | 4.1945683e-05 |
| 5,424 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS | 5.5126983e-05 |
| 4,211 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.3563454e-05 |
| 11,385 | Answering Regular Path Queries through Exemplars | 2022 | VLDB | 4.1945683e-05 |
| 461 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD | 0.00022499343 |
| 1,444 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB | 0.00011946075 |
| 11,014 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1945683e-05 |
| 1,812 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS | 0.00010467069 |
| 1,037 | Querying Graph Databases | 2013 | PODS | 0.00014502493 |