Output-Sensitive Evaluation of Regular Path Queries
Summary: Introduces OSPG, an output-sensitive refinement of the Product Graph for evaluating regular path queries on edge-labeled graphs. Data complexity: O(|E|^{3/2} + min(OUT·√|E|, |V|·|E|)) with OUT the output size; excels when outputs are small or graphs are sparse, and for non-Kleene-star queries tightens to O(|E| + |E|√OUT). (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mahmoud Abo Khamis (RelationalAI)
- 2. Ahmet Kara (Ostbayerische Technische Hochschule Regensburg)
- 3. Dan Olteanu (University of Zurich)
- 4. Dan Suciu (University of Washington)
BibTeX Citation
@inproceedings{khamis_pods25,
address = {New York, NY, USA},
series = {{PODS} '25},
title = {{Output-Sensitive Evaluation of Regular Path Queries}},
url = {https://dl.acm.org/doi/10.1145/3725242},
doi = {10.1145/3725242},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Khamis, Mahmoud Abo and Kara, Ahmet and Olteanu, Dan and Suciu, Dan},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,135 | I Can't Believe It's Not Yannakakis: Pragmatic Bitmap Filters in Microsoft SQL Server | 2026 | CIDR | 5.093636e-05 |
| 10,146 | Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries | 2026 | PODS | 5.093636e-05 |
| 10,215 | cuRPQ: A High-Performance GPU-Based Framework for Processing Regular and Conjunctive Regular Path Queries | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 25 of 25 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 747 | Querying Graph Databases | 2013 | PODS |
| 2 | 3,452 | The Complexity of Evaluating Path Expressions in SPARQL | 2012 | PODS |
| 3 | 2,209 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD |
| 4 | 1,575 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |
| 5 | 10,146 | Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries | 2026 | PODS |
| 6 | 11,133 | Distinct Shortest Walk Enumeration for RPQs | 2024 | PODS |
| 7 | 1,658 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB |
| 8 | 4,986 | Querying Graph Patterns | 2011 | PODS |
| 9 | 4,981 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS |
| 10 | 11,225 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |