Revision as of 00:46, 6 October 2007 edit Zawersh (talk \| contribs) Extended confirmed users 930 edits m removing cat Category:Data structures -- article already in one of its children Category:Hashing) ← Previous edit		Revision as of 21:01, 6 December 2007 edit undo 123.176.40.194 (talk) No edit summary Next edit →
Line 1: '''Linear Hashing''' is a dynamic [[hash table]] ~~algorithm~~tool invented by Witold Litwin (1980) <ref> {{Citation \| first1=Witold \| last1=Litwin \| title=Linear hashing: A new tool for file and table addressing \| journal=Proc. 6th Conference on Very Large Databases \| pages=pp. 212-223 \| year=1980 \| url=http://www.cs.cmu.edu/afs/cs.cmu.edu/user/christos/www/courses/826-resources/PAPERS+BOOK/linear-hashing.PDF}}</ref>, and later popularized by [[Paul Larson]]. Linear hashing allows for the expansion of the hash table one slot at a time. The frequent single slot expansion can very effectively control the length of the collision chain. The cost of hash table expansion is spread out across each

Linear hashing: Difference between revisions