Talk:Linear hash
From Wikipedia, the free encyclopedia
[edit] "This is discussed later in this chapter."
Definitely a book (or chaptered-website) rip. It's certainly not something Google knows about. Should prob. be deleted unless it's from a PD/GFDL source—such text as "This is discussed later in this chapter" (right at the end of the article) scares me. --AnOddName 19:06, 29 October 2005 (UTC)
- I agree. - Bevo 15:48, 23 December 2005 (UTC)
Not only that, but the material is very strange. Superficially it is correct, but at the detail level it does not correspond to the linear hashing algorithm that I know about. There is no discussion about the incremental table expansion feature, nor the bucket selection algorithm. These are what in my mind an entry should contain about linear hashing. --MegaHasher
Replaced the ripped material with new content. Litwin's original article is on the net, but I just put in the paper reference for simplicity. Do I need to mention the assumption that hash array slot indexing start at 0? All modern programming languages already do that. Pascal is the only exception... --06:04, 2 January 2006 (UTC)
