Analysis of dynamic hashing with deferred splitting

Authors:
Eugene Veklerov
Affiliations:
Real Time Systems Group, Lawrence Berkeley Laboratory, University of California, Berkeley, CA
Venue:
ACM Transactions on Database Systems (TODS)
Year:
1985

Citing 3
Cited 5

New file organization based on dynamic hashing

ACM Transactions on Database Systems (TODS)
Bounded index exponential hashing

ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files

ACM Transactions on Database Systems (TODS)

A Physical Database Design Evaluation System for CODASYL Databases

IEEE Transactions on Software Engineering
A compendium of key search references

ACM SIGIR Forum
Dynamic hashing schemes

ACM Computing Surveys (CSUR)
Linear Spiral Hashing for Expansible Files

IEEE Transactions on Knowledge and Data Engineering
Performance Evaluation of Lazy Deletion Methods in R-trees

Geoinformatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamic hashing with deferred splitting is a file organization scheme which increases storage utilization, as compared to standard dynamic hashing. In this scheme, splitting of a bucket is deferred if the bucket is full but its brother can accommodate new records. The performance of the scheme is analyzed. In a typical case the expected storage utilization increases from 69 to 76 percent.