Database Paper Browser

Back to papers

Constant Time Maintenance or The Triumph of the fd.

Summary: In weak instance theory the paper proves any sublinear-time maintenance algorithm must be constant-time and characterizes constraint classes admitting constant-time maintenance as those axiomatizable by embedded functional dependencies (typed → binary EGDs). Also provides recognition and maintenance algorithms for FDs plus one join dependency and connects the results to prior work on modified foreign-key constraints. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
772
Venue
PODS
Year
1986
Pagerank
5.3039672e-05
Overall Rank
5,841 | 59.37%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

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