ACM Transactions on Database Systems · 1976 · 302 citations · 9 references
ComputingComputer ScienceComputer SystemsData ManagementDatabasesStorage SystemsData DeduplicationData RecoveryData Storage SystemsDatabase ManagementData CompactionData Redundancy ReductionDatabase ArchivingReference Point ManagementStorageStorage OptimizationVolatile Memory
The representation of a collection of data in terms of its differences from some preestablished point of reference is a basic storage compaction technique which finds wide applicability. This paper describes a differential database representation which is shown to be an efficient method for storing large and volatile databases. The technique confines database modifications to a relatively small area of physical storage and as a result offers two significant operational advantages. First, because the “reference point” for the database is inherently static, it can be simply and efficiently stored. Second, since all modifications to the database are physically localized, the process of backup and the process of recovery are relatively fast and inexpensive.
9
Space/time trade-offs in hash coding with allowable errors
Burton H. Bloom · Communications of the ACM · 1970 · 7.5K citations · Full text
File organization and addressing
Werner Buchholz · IBM Systems Journal · 1963 · 60 citations
An improved hash code for scatter storage
Ward Douglas Maurer · Communications of the ACM · 1983 · 52 citations · Full text