Database Paper Browser

Back to papers

Inverting Relational Expressions - A Uniform And Natural Technique For Various Database Problems

Summary: Introduce inversion of relational expressions via tables to represent f^{-1}(Rep(q)) = { r | f(r) ⊇ q } for expressions with projection, join, and positive selection. Provides a uniform, simpler alternative to tableaux for view problems (dependencies, equivalence, state translation). (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
667
Venue
PODS
Year
1983
Pagerank
4.1905499e-05
Overall Rank
13,060 | 9.24%
DOI
-

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 2 of 2 citing papers.

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
38 Testing Implications Of Data Dependencies 1979 SIGMOD 0.0007528369
131 Can We Use The Universal Instance Assumption Without Using Nulls? 1981 SIGMOD 0.00043719033
3,023 On Equivalences of Database Schemes 1982 PODS 7.6919854e-05
4,842 Notions of Dependency Satisfaction 1982 PODS 5.8778608e-05
13,073 A Technique For Translating States Between Database Schemata 1982 SIGMOD 4.1905499e-05
Previous Page 1 / 1 Next

Semantically Similar Papers