Database Paper Browser

Back to papers

On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies

Summary: Presents a formal methodology using a novel "extensibility" technique to design database schemes that are bounded under the weak-instance model with respect to functional dependencies. Also provides constructions that yield constant-time maintainable schemes. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
777
Venue
PODS
Year
1987
Pagerank
4.1905499e-05
Overall Rank
12,984 | 9.77%
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
7,982 Independence-reducible Database Schemes 1988 PODS 4.6089395e-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