Weighted Increment Linear Search for Scatter Tables.
Saved in:
| Title: | Weighted Increment Linear Search for Scatter Tables. |
|---|---|
| Authors: | Luccio, Fabrizio1, Baxendale, P. |
| Source: | Communications of the ACM. Dec1972, Vol. 15 Issue 12, p1045-1047. 3p. 1 Chart. |
| Subjects: | Database searching, COMSKEE (Computer program language), Computers, Electronic equipment, Electronic data processing, High technology industries |
| Abstract: | A new linear search for hash tables whose increment step is a function of the key being addressed is presented. Comparisons with known methods are given, in terms of efficiency and computation complexity. In particular, the new method applies to tables of size n = 2R. It allows full table searching, and practically eliminates primary clustering at a very tow cost. [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 |
Be the first to leave a comment!
