Content deleted Content added
MegaHasher (talk | contribs) m reference |
MegaHasher (talk | contribs) adoptions |
||
Line 30:
The hash table array for linear hashing is usually implemented with a [[dynamic array]]
algorithm.
==Adoption in language systems==
Griswold and Townsend <ref> {{Citation | title=The Design and Implementation of Dynamic Hashing for Sets and Tables in Icon | first1=William G. | last1=Griswold | first2=Gregg M. | last2=Townsend | journal=Software Practice and Experience | volume=23 | issue=4 | date=April 1993 | pages=pp. 351-367 | url=http://www.cs.ubc.ca/local/reading/proceedings/spe91-95/spe/vol23/issue4/spe816.pdf}} </ref> discussed the adoption of linear hashing in the [[Icon language]]. They discussed the implementation alternatives of [[dynamic array]] algorithm used in linear hashing, and presented performance comparisons using a list of Icon benchmark applications.
==References==
|