Database Paper Browser

Back to papers

Languages for Relational Databases over Interpreted Structures

Summary: Reworks relational theory for domains with interpreted operations, classifying which equivalences and expressive-characterizations hold unchanged, which require well-behaved structures, and which phenomena are specific to the interpreted setting. Provides algorithms to eliminate unbounded quantifiers (collapsing natural to active-domain semantics in many cases), normal forms for mixed higher-order logics, and an elementary proof that parity is undefinable in the relational calculus with polynomial inequality constraints. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1106
Venue
PODS
Year
1997
Pagerank
6.2725564e-05
Overall Rank
4,346 | 69.77%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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