Rewrite rules for search database systems
Ronald Fagin, Benny Kimelfeld, et al.
SIGMOD/PODS 2011
Extendible hashing is a new access technique, in which the user is guaranteed no more than two page faults to locate the data associated with a given unique identifier, or key. Unlike conventional hashing, extendible hashing has a dynamic structure that grows and shrinks gracefully as the database grows and shrinks. This approach simultaneously solves the problem of making hash tables that are extendible and of making radix search trees that are balanced. We study, by analysis and simulation, the performance of extendible hashing. The results indicate that extendible hashing provides an attractive alternative to other access methods, such as balanced trees. © 1979, ACM. All rights reserved.
Ronald Fagin, Benny Kimelfeld, et al.
SIGMOD/PODS 2011
Miklos Ajtai, Randal Burns, et al.
Journal of the ACM
Ronald Fagin, Phokion G. Kolaitis, et al.
SEBD 2024
Moses Charikar, Ronald Fagin, et al.
Journal of Computer and System Sciences