Database Paper Browser

Back to papers

A Characterization of Constant-time-maintainability for BCNF Database Schemes

Summary: Characterization of constant-time-maintainability for BCNF schemes under key dependencies; efficient tester and maintenance algorithm with state-size-independent runtime. Shows boundedness of CTM BCNF schemes; total projections computable as unions of extension-join projections. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2396
Venue
SIGMOD
Year
1988
Pagerank
4.613363e-05
Overall Rank
7,980 | 44.49%
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
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 8 of 8 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