Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions?
Summary: Analyze the definability problem on node-labeled graphs (node-partitions induced by value-equality) for extensions of regular path queries: REM and REE. Show REM definability EXPSPACE-complete, REE PSPACE-complete, and UCQ(REM/REE) coNP-complete. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. M. Praveen (Chennai Mathematical Institute)
- 2. B. Srivathsan (Chennai Mathematical Institute)
BibTeX Citation
@inproceedings{praveen_pods15,
address = {New York, NY, USA},
series = {{PODS} '15},
title = {{Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions?}},
url = {https://dl.acm.org/doi/10.1145/2745754.2745764},
doi = {10.1145/2745754.2745764},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Praveen, M. and Srivathsan, B.},
year = {2015}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 747 | Querying Graph Databases | 2013 | PODS | 0.00014400452 |
| 1,131 | The Lixto Data Extraction Project - Back and Forth between Theory and Practice | 2004 | PODS | 0.00012044716 |
| 2,215 | Characterizing Schema Mappings via Data Examples | 2010 | PODS | 8.93781e-05 |
| 3,341 | Designing and Refining Schema Mappings via Data Examples | 2011 | SIGMOD | 7.5028917e-05 |
| 6,852 | When is Naive Evaluation Possible? | 2013 | PODS | 5.7540317e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,205 | Containment of Graph Queries Modulo Schema | 2024 | PODS |
| 2 | 294 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD |
| 3 | 312 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD |
| 4 | 5,146 | Query Containment and Rewriting Using Views for Regular Path Queries Under Constraints | 2003 | PODS |
| 5 | 747 | Querying Graph Databases | 2013 | PODS |
| 6 | 1,575 | Expressive Languages for Path Queries over Graph-Structured Data | 2010 | PODS |
| 7 | 11,225 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB |
| 8 | 1,658 | Finding Regular Simple Paths in Graph Databases | 1989 | VLDB |
| 9 | 4,981 | A Trichotomy for Regular Simple Path Queries on Graphs | 2013 | PODS |
| 10 | 4,986 | Querying Graph Patterns | 2011 | PODS |