Expressive Languages for Path Queries over Graph-Structured Data
Summary: Introduces ECRPQs: extend CRPQs with path variables in heads and regular relations over tuples of paths, enabling path outputs and expressive relations among paths for tasks like semantic associations and pattern/sequence alignment. Presents automata-based representations, analyzes data/combined complexity and containment, and identifies syntactic restrictions plus FO and arithmetic extensions (length/count constraints) to trade expressiveness for lower complexity. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Pablo Barceló (University of Chile)
- 2. Carlos Hurtado (Adolfo Ibáñez University)
- 3. Leonid Libkin (University of Edinburgh)
- 4. Peter Wood (Birkbeck, University of London)
BibTeX Citation
@inproceedings{barcelo_pods10,
address = {New York, NY, USA},
series = {{PODS} '10},
title = {{Expressive Languages for Path Queries over Graph-Structured Data}},
url = {https://dl.acm.org/doi/10.1145/1807085.1807089},
doi = {10.1145/1807085.1807089},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Barceló, Pablo and Hurtado, Carlos and Libkin, Leonid and Wood, Peter},
year = {2010}
}
Incoming Citations (Sorted by Pagerank)
Showing 27 of 27 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 297 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00021840374 |
| 699 | Query Containment for Conjunctive Queries With Regular Expressions | 1998 | PODS | 0.00014686953 |
| 2,148 | Flexible Queries over Semistructured Data | 2001 | PODS | 8.955397e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,363 | Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries | 2026 | PODS |
| 2 | 5,109 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS |
| 3 | 7,437 | Conjunctive Regular Path Queries with String Variables | 2020 | PODS |
| 4 | 11,561 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |
| 5 | 3,474 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS |
| 6 | 8,362 | Conjunctive Regular Path Queries under Injective Semantics | 2023 | PODS |
| 7 | 5,096 | Querying Graph Patterns | 2011 | PODS |
| 8 | 1,597 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB |
| 9 | 11,834 | Data Path Queries over Embedded Graph Databases | 2022 | PODS |
| 10 | 719 | Querying Graph Databases | 2013 | PODS |