Database Paper Browser

Back to papers

Updating Databases in the Weak Instance Model

Summary: Presents a lattice-based framework for the weak-instance model, ordering database states by information content and characterizing all possible insertion and deletion outcomes (potential results). Defines insertion determinism when the GLB of potential results is attainable, gives effective case characterizations, and shows deletions have fewer cases since potential results always exist. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
855
Venue
PODS
Year
1989
Pagerank
4.1945683e-05
Overall Rank
12,937 | 10.00%
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 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,926 Efficient Updates to Independent Schemes in the Weak Instance Model 1990 SIGMOD 4.1945683e-05
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.

Rank Cited Paper Year Venue Pagerank
38 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00075110004
556 On the Semantics of Updates in Databases 1983 PODS 0.00020249905
751 Partition Semantics for Relations 1985 PODS 0.0001721247
2,318 Efficient Query Answering in the Representative Instance Approach 1985 PODS 9.0400919e-05
4,939 Updating a Relational Database through a Universal Schema Interface 1985 PODS 5.8183127e-05
7,981 Implementing Queries and Updates on Universal Scheme Interfaces 1988 VLDB 4.613363e-05
12,975 A New Basis for the Weak Instance Model 1987 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers