Database Paper Browser

Back to papers

Local Transformations and Conjunctive-Query Equivalence

Summary: Define local transformations wrt conjunctive‑query (CQ) equivalence and prove the GLAV chase (and SO‑tgd chase) is local: it preserves bounded CQ‑indistinguishability with polynomial bounds, but locality breaks with target constraints. Decompose GLAV into LAV/GAV cases to characterize when compositions are GLAV or CQ‑equivalent, and show CQ‑equivalence between an SO‑tgd and a GLAV is decidable (logical equivalence undecidable). (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1576
Venue
PODS
Year
2012
Pagerank
4.3556432e-05
Overall Rank
9,334 | 35.07%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
9,422 Nested Dependencies: Structure and Reasoning 2014 PODS 4.3441378e-05
10,343 Circuit Bounds for Conjunctive Queries with Self-joins 2025 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