Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Exact distribution of individual displacements in linear probing hashing

Exact distribution of individual displacements in linear probing hashing This paper studies the distribution of individual displacements for the standard and the Robin Hood linear probing hashing algorithms. When the a table of size m has n elements, the distribution of the search cost of a random element is studied for both algorithms. Specifically, exact distributions for fixed m and n are found as well as when the table is α-full, and α strictly smaller than 1. Moreover, for full tables, limit laws for both algorithms are derived. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Algorithms (TALG) Association for Computing Machinery

Exact distribution of individual displacements in linear probing hashing

Viola, Alfredo
ACM Transactions on Algorithms (TALG) , Volume 1 (2) – Oct 1, 2005
Download PDF
29 pages

Loading next page...
 
/lp/association-for-computing-machinery/exact-distribution-of-individual-displacements-in-linear-probing-7RlWrRKLP9
Publisher
Association for Computing Machinery
Copyright
Copyright © 2005 by ACM Inc.
ISSN
1549-6325
DOI
10.1145/1103963.1103965
Publisher site
See Article on Publisher Site

Abstract

This paper studies the distribution of individual displacements for the standard and the Robin Hood linear probing hashing algorithms. When the a table of size m has n elements, the distribution of the search cost of a random element is studied for both algorithms. Specifically, exact distributions for fixed m and n are found as well as when the table is α-full, and α strictly smaller than 1. Moreover, for full tables, limit laws for both algorithms are derived.

Journal

ACM Transactions on Algorithms (TALG) – Association for Computing Machinery

Published: Oct 1, 2005

There are no references for this article.