Database Paper Browser

Back to papers

On the Computation of Relational View Complements

Summary: Characterizes and algorithmically constructs small (and in special cases minimal) complements for monotonic relational views, enabling recovery of source-missing information. Construction runs in time polynomial in schema size and supports warehouse properties like independence and self-maintainability. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1259
Venue
PODS
Year
2002
Pagerank
5.5769585e-05
Overall Rank
5,306 | 63.09%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
1,078 Model Management 2.0: Manipulating Richer Mappings 2007 SIGMOD 0.00014245848
1,489 Supporting Executable Mappings in Model Management 2005 SIGMOD 0.00011699282
4,336 The Impact of the Constant Complement Approach Towards View Updating 2003 PODS 6.279016e-05
4,971 Maximizing Conjunctive Views in Deletion Propagation 2011 PODS 5.7938195e-05
11,632 Programmable View Update Strategies on Relations 2020 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers