DBScholar

Back to papers

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)

Paper ID
1648
Venue
PODS
Year
2015
Pagerank
5.093636e-05
Overall Rank
12,098 | 17.00%
DOI
10.1145/2745754.2745764

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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