Database Paper Browser

Back to papers

On the Containment and Equivalence of Database Queries with Linear Constraints* (Extended Abstract)

Summary: Introduces counter‑machine techniques to decide containment/equivalence of queries with linear arithmetic constraints over Z, N, Q, R. Shows 2-EXPTIME decidability (EXPTIME lower bound) for CQs over Z/N, 2-EXPTIME for constant‑free CQs over Q/R, 2-EXPSPACE for general Q/R via FO‑reals, and decidability for connected FO queries on bounded‑degree databases. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1100
Venue
PODS
Year
1997
Pagerank
5.3602702e-05
Overall Rank
5,709 | 60.29%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
2,475 Querying Aggregate Data 1999 PODS 8.7017602e-05
4,379 Safe Constraint Queries 1998 PODS 6.2397591e-05
12,432 Index-Based Multidimensional Array Queries: Safety and Equivalence 2007 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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