Database Paper Browser

Back to papers

Independence-reducible Database Schemes

Summary: Introduces independence-reducible cover-embedding schemes, proves they are bounded and algebraic-maintainable, and shows they properly subsume all previously known bounded/constant-time-maintainable cover-embedding BCNF classes. Provides an exact efficient recognition algorithm and an efficiently testable characterization for the contained constant-time-maintainable subclass, assuming a cover of the functional dependencies is embedded as key dependencies. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
826
Venue
PODS
Year
1988
Pagerank
4.613363e-05
Overall Rank
7,979 | 44.50%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
7,980 A Characterization of Constant-time-maintainability for BCNF Database Schemes 1988 SIGMOD 4.613363e-05
12,939 Can Constant-time Maintainability Be More Practical? 1989 PODS 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.

Previous Page 1 / 1 Next

Semantically Similar Papers