Revision as of 03:02, 1 January 2006 edit MegaHasher (talk \| contribs) 769 edits wikified the content ← Previous edit		Revision as of 00:17, 4 January 2006 edit undo MegaHasher (talk \| contribs) 769 edits supplemental info; add reference and external link Next edit →
Line 28: One obvious choice is one expansion operation per insertion request. Another choice is to control the expansion with a programmer defined load factor. The hash table array for linear hashing is usually implemented with a [[dynamic array]] algorithm. ==References== W. Litwin, ''Linear hashing: A new tool for file and table addressing'', Proc. 6th Conference on Very Large Databases, pages 212–223, [[1980]]. Per-Åke Larson, ''Dynamic Hash Tables'', Communications of the ACM, pages 446–457, April 1988, Volume 31, Number 4. ==External Links== [http://www.concentric.net/~Ttwang/tech/sorthash.htm Sorted Linear Hash Table]

Linear hashing: Difference between revisions