A MONTE CARLO STUDY OF CICHELLI HASH-FUNCTION SOLVABILITY.
Saved in:
| Title: | A MONTE CARLO STUDY OF CICHELLI HASH-FUNCTION SOLVABILITY. |
|---|---|
| Authors: | Bell, R. Charles1, Floyd, Bryan2, Horowitz, Ellis |
| Source: | Communications of the ACM. Nov83, Vol. 26 Issue 11, p924-925. 2p. 5 Charts. |
| Subjects: | Hashing, Electronic file management, Monte Carlo method, Games of chance, Mathematical models, Numerical analysis |
| Abstract: | Cichelli hash functions were investigated statistically by a Monte Carlo procedure to examine the Iikelihood of their existence with token sets of various sizes, chosen with natural-language probabilities. It was found that the solvability of the Cichelli scheme became increasingly unlikely as the token set increased in size, even when the minimality condition was relaxed. With 30 tokens, the probability of a quick solution was about 50 percent. This is a seven limitation when applied to dynamic systems of tokens. However, it is anticipated that some similar technique may be developed, based on perfect but nonminimal hashing, which will effectively allow perfect minimal hashing (through a contraction table) in most cases of practical value. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 5221795 AccessLevel: 6 PubType: Periodical PubTypeId: serialPeriodical PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A MONTE CARLO STUDY OF CICHELLI HASH-FUNCTION SOLVABILITY. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Bell%2C+R%2E+Charles%22">Bell, R. Charles</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Floyd%2C+Bryan%22">Floyd, Bryan</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Horowitz%2C+Ellis%22">Horowitz, Ellis</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Nov83, Vol. 26 Issue 11, p924-925. 2p. 5 Charts. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Hashing%22">Hashing</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+file+management%22">Electronic file management</searchLink><br /><searchLink fieldCode="DE" term="%22Monte+Carlo+method%22">Monte Carlo method</searchLink><br /><searchLink fieldCode="DE" term="%22Games+of+chance%22">Games of chance</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+models%22">Mathematical models</searchLink><br /><searchLink fieldCode="DE" term="%22Numerical+analysis%22">Numerical analysis</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Cichelli hash functions were investigated statistically by a Monte Carlo procedure to examine the Iikelihood of their existence with token sets of various sizes, chosen with natural-language probabilities. It was found that the solvability of the Cichelli scheme became increasingly unlikely as the token set increased in size, even when the minimality condition was relaxed. With 30 tokens, the probability of a quick solution was about 50 percent. This is a seven limitation when applied to dynamic systems of tokens. However, it is anticipated that some similar technique may be developed, based on perfect but nonminimal hashing, which will effectively allow perfect minimal hashing (through a contraction table) in most cases of practical value. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5221795 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1145/182.358446 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 2 StartPage: 924 Subjects: – SubjectFull: Hashing Type: general – SubjectFull: Electronic file management Type: general – SubjectFull: Monte Carlo method Type: general – SubjectFull: Games of chance Type: general – SubjectFull: Mathematical models Type: general – SubjectFull: Numerical analysis Type: general Titles: – TitleFull: A MONTE CARLO STUDY OF CICHELLI HASH-FUNCTION SOLVABILITY. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Bell, R. Charles – PersonEntity: Name: NameFull: Floyd, Bryan – PersonEntity: Name: NameFull: Horowitz, Ellis IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 11 Text: Nov83 Type: published Y: 1983 Identifiers: – Type: issn-print Value: 00010782 Numbering: – Type: volume Value: 26 – Type: issue Value: 11 Titles: – TitleFull: Communications of the ACM Type: main |
| ResultId | 1 |
