An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
A Dynamic Hash File for Random and Sequential Accessing
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Self-organizing scheme for file storage
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
| Hi-index | 0.00 |
B-trees are very popular dynamic file structures proposed by Bayer and McCreight. Several variants of the B-tree have been introduced with the goal of improving performance. In this paper, we introduce a sensitivity problem that occurs when a B-tree technique (or a similar data structure, such as a B*-tree) is used. Due to this sensitivity problem, the performance of a B-tree may be significantly degraded when many insertions/deletions happen. We propose a method to avoid such a sensitivity problem. Our method has a further advantage that the three parameters used can be accordingly adjusted to accommodate a highly dynamic file.