Enforce constraints in archival databases

In an archival database, there are insertions but almost no deletions, or deletions take place in a batch mode. Such an environment allows the authors to identify many databases in which constraint enforcement can be done very fast, i.e., in constant time. They describe an example which illustrates that unbounded database schemes are still useful in some applications, such as in the archival environment