Database Paper Browser

Back to papers

Querying Weak Instances

Summary: Defines "weak instances": all universal relations that extend incomplete base relations and satisfy dependencies, with certain answers as the intersection across these instances (relaxing the pure universal assumption). Proposes building a finite representative by padding tuples with distinct nulls and chasing total dependencies to evaluate monotonic queries correctly, and analyzes chase inconsistency and limits of projection-based methods. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
708
Venue
PODS
Year
1984
Pagerank
4.4096041e-05
Overall Rank
9,012 | 37.31%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
6,168 Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions 1984 SIGMOD 5.1716335e-05
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.00075110004
58 Efficient Optimization of a Class of Relational Expressions 1978 SIGMOD 0.00064826446
135 Can We Use The Universal Instance Assumption Without Using Nulls? 1981 SIGMOD 0.00042421957
920 The U. R. Strikes Back 1982 PODS 0.00015338004
1,937 Windows On The World 1983 SIGMOD 0.00010029315
Previous Page 1 / 1 Next

Semantically Similar Papers