Database Paper Browser

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
1649
Venue
PODS
Year
2015
Pagerank
4.1945683e-05
Overall Rank
11,899 | 17.23%
DOI
10.1145/2745754.2745764

Incoming Non-self Citations Over Time

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

Authors

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
1,037 Querying Graph Databases 2013 PODS 0.00014502493
1,095 The Lixto Data Extraction Project - Back and Forth between Theory and Practice 2004 PODS 0.00014126427
2,124 Characterizing Schema Mappings via Data Examples 2010 PODS 9.4912951e-05
3,866 Designing and Refining Schema Mappings via Data Examples 2011 SIGMOD 6.6837e-05
6,858 When is Naive Evaluation Possible? 2013 PODS 4.9060157e-05
Previous Page 1 / 1 Next

Semantically Similar Papers