The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Analysis of index-sequential files with overflow chaining
ACM Transactions on Database Systems (TODS)
Optimal file designs and reorganization points
ACM Transactions on Database Systems (TODS)
Mathematical models of database degradation
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Comparison of synonym handling and bucket organization methods
Communications of the ACM
Database Design
Self-assessment procedure XV: a self-assessment procedure dealing with file processing
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
Performance Analysis of Database Systems
Performance Evaluation: Origins and Directions
| Hi-index | 0.02 |
It is common for file structures to be divided into equal-length partitions, called buckets, into which records arrive for insertion and from which records are physically deleted. We give a simple algorithm which permits calculation of the average time until overflow for a bucket of capacity n records, assuming that record insertions and deletions can be modeled as a stochastic process in the usual manner of queueing theory. We present some numerical examples, from which we make some general observations about the relationships among insertion and deletion rates, bucket capacity, initial fill, and average time until overflow. In particular, we observe that it makes sense to define the stable point as the product of the arrival rate and the average residence time of the records; then a bucket tends to fill up to its stable point quickly, in an amount of time almost independent of the stable point, but the average time until overflow increases rapidly with the difference between the bucket capacity and the stable point.