DBScholar

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
1099
Venue
PODS
Year
1997
Pagerank
6.1050534e-05
Overall Rank
5,736 | 60.65%
DOI
10.1145/263661.263666

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ibarra_pods97,
        address = {New York, NY, USA},
        series = {{PODS} '97},
        title = {{On the Containment and Equivalence of Database Queries with Linear Constraints* (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/263661.263666},
        doi = {10.1145/263661.263666},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ibarra, Oscar H. and Su, Jianwen},
        year = {1997}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
2,305 Querying Aggregate Data 1999 PODS 8.7766218e-05
4,226 Safe Constraint Queries 1998 PODS 6.8211482e-05
12,626 Index-Based Multidimensional Array Queries: Safety and Equivalence 2007 PODS 5.093636e-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