On the statistical dependencies of coalesced hashing and their implications for both full and limited independence

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper gives the first optimal bounds for coalesced hashing schemes in the case of limited randomness, and thereby establishes the analytic performance of these schemes in a model that supports formal randomized computation. As a byproduct of this work, we attain a much simpler analysis of coalesced hashing schemes, which provides more information about the statistics of the underlying processes. We present the generating functions that govern the chain distribution and probe performance for coalesced hashing schemes, including asymptotic formulations when cellars are used.

Original languageEnglish (US)
Title of host publicationProceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
PublisherAssociation for Computing Machinery
Pages10-19
Number of pages10
VolumePart F129524
ISBN (Electronic)0898713498
StatePublished - Jan 22 1995
Event6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 - San Francisco, United States
Duration: Jan 22 1995Jan 24 1995

Other

Other6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
CountryUnited States
CitySan Francisco
Period1/22/951/24/95

Fingerprint

Hashing
Byproducts
Statistics
Optimal Bound
Randomness
Generating Function
Probe
Independence
Formulation
Model

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Siegel, A. (1995). On the statistical dependencies of coalesced hashing and their implications for both full and limited independence. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 (Vol. Part F129524, pp. 10-19). Association for Computing Machinery.

On the statistical dependencies of coalesced hashing and their implications for both full and limited independence. / Siegel, Alan.

Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Vol. Part F129524 Association for Computing Machinery, 1995. p. 10-19.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Siegel, A 1995, On the statistical dependencies of coalesced hashing and their implications for both full and limited independence. in Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. vol. Part F129524, Association for Computing Machinery, pp. 10-19, 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, San Francisco, United States, 1/22/95.
Siegel A. On the statistical dependencies of coalesced hashing and their implications for both full and limited independence. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Vol. Part F129524. Association for Computing Machinery. 1995. p. 10-19
Siegel, Alan. / On the statistical dependencies of coalesced hashing and their implications for both full and limited independence. Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Vol. Part F129524 Association for Computing Machinery, 1995. pp. 10-19
@inproceedings{30392c6917f14d4482b39b8949e6f7a6,
title = "On the statistical dependencies of coalesced hashing and their implications for both full and limited independence",
abstract = "This paper gives the first optimal bounds for coalesced hashing schemes in the case of limited randomness, and thereby establishes the analytic performance of these schemes in a model that supports formal randomized computation. As a byproduct of this work, we attain a much simpler analysis of coalesced hashing schemes, which provides more information about the statistics of the underlying processes. We present the generating functions that govern the chain distribution and probe performance for coalesced hashing schemes, including asymptotic formulations when cellars are used.",
author = "Alan Siegel",
year = "1995",
month = "1",
day = "22",
language = "English (US)",
volume = "Part F129524",
pages = "10--19",
booktitle = "Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - On the statistical dependencies of coalesced hashing and their implications for both full and limited independence

AU - Siegel, Alan

PY - 1995/1/22

Y1 - 1995/1/22

N2 - This paper gives the first optimal bounds for coalesced hashing schemes in the case of limited randomness, and thereby establishes the analytic performance of these schemes in a model that supports formal randomized computation. As a byproduct of this work, we attain a much simpler analysis of coalesced hashing schemes, which provides more information about the statistics of the underlying processes. We present the generating functions that govern the chain distribution and probe performance for coalesced hashing schemes, including asymptotic formulations when cellars are used.

AB - This paper gives the first optimal bounds for coalesced hashing schemes in the case of limited randomness, and thereby establishes the analytic performance of these schemes in a model that supports formal randomized computation. As a byproduct of this work, we attain a much simpler analysis of coalesced hashing schemes, which provides more information about the statistics of the underlying processes. We present the generating functions that govern the chain distribution and probe performance for coalesced hashing schemes, including asymptotic formulations when cellars are used.

UR - http://www.scopus.com/inward/record.url?scp=85039799045&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85039799045&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85039799045

VL - Part F129524

SP - 10

EP - 19

BT - Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995

PB - Association for Computing Machinery

ER -