Extendible Hashing - A Fast Access Method for Dynamic Files

@article{Fagin1979ExtendibleH,
  title={Extendible Hashing - A Fast Access Method for Dynamic Files},
  author={Ronald Fagin and J{\"u}rg Nievergelt and Nicholas Pippenger and H. Raymond Strong},
  journal={ACM Trans. Database Syst.},
  year={1979},
  volume={4},
  pages={315-344}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 289 extracted citations

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Similar Papers

Loading similar papers…