Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An approximate analysis of the performance of extendible hashing with elastic buckets

From MaRDI portal
Publication:1313719
Jump to:navigation, search

DOI10.1016/0020-0190(93)90262-8zbMath0787.68048OpenAlexW2014839649MaRDI QIDQ1313719

Nabil I. Hachem

Publication date: 26 May 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90262-8


zbMATH Keywords

data structureshashingdata managementfile structureselastic buckets


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of data (68P99)




Cites Work

  • On the performance evaluation of extendible hashing and trie searching
  • A note on the analysis of extendible hashing
  • The Double Dixie Cup Problem
  • Computing the probability of hash table/urn overflow
  • Analysis of Extendible Hashing
  • More birthday surprises
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1313719&oldid=13429629"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 12:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki