Talk:Hash table

Unfinished question

Problem 1: The Hash Table will be used for storage of student records. You may assume the maximum number of Items will not exceed 240. An item corresponds to a student record. A key is taken to be an ASCII character string of maximum length 32 containing name of the student. The data is taken to be 9-digit id and the name of the state of residence of the student in India. A list node contains an Item and a reference to the next node. You will need to implement the classes Item and the ListNode with construct and appropriate data access operations. 2. Write a main() program to test your class HashTable. 3. Input: The name of the input file, containing data items (student records) and data operations in the format given below, and the name of the output file, will be passed to your program on the command line or interactively. Data Items: student-id, student-name, state-of-residence Example. 200412018, Swati Mishra, Uttar Pradesh one per line. Data Operations: <operation> <item> The <operation> is s,i, or d for search, insert and delete, respectively. The item will have fields: student-name, student-id, and state-of-residence. The fields of an item will be separated by commas, and operation will be separated from the item by a colon ”:” and a space. Example. s: 200211001, Akash Gokhale, Maharashtra one per line. The data items will be separated from the data operations by a blank line. 4. Output: Your program is to read the input file and populate the Hash Table with student records by repeated Insert() operations. And then print to the output file, the size of the Hash Table, and the size of each linked list in the Hash Table. Then, it will continue to read each line and execute appropriate data operations. Following each Insert()/Delete() operation, it will output the size of the Hash Table and the size of each of the linked list, and for each Search operation, it will output

-- 220.225.53.35 09:18, 11 October 2006

Variable-sized data and chained hashing

Would this be a good citation for the better performance of variable-sized data in chaining hash tables? https://www.researchgate.net/profile/Haval_Ahmed2/post/Any_ideas_about_hash_table_implementation/attachment/59d6430bc49f478072eabc10/AS:273806436831232@1442291949107/download/In-memory+hash+tables+for+accumulating+text+vocabularies.pdf ?

First sentence of section "2.3. Hash tables" seems to be useful, but it is not backed up in the article itself.

Recent paper disproving Yao's conjecture; proves uniform probing is sub-optimal

I don't know enough to say how this would be added to this article, but it looks like a fundamental advance.

https://arxiv.org/pdf/2501.02305

Described here: https://www.quantamagazine.org/undergraduate-upends-a-40-year-old-data-science-conjecture-20250210/

> A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

> “It’s an important paper,” said Alex Conway of Cornell Tech in New York City. “Hash tables are among the oldest data structures we have. And they’re still one of the most efficient ways to store data.” Yet open questions remain about how they work, he said. “This paper answers a couple of them in surprising ways.”

ToolmakerSteve (talk) 23:51, 12 February 2025 (UTC)

Typo or bad translation

"the algorithm attempts to be an item into its neighbourhood" — I'm sure "be" is the wrong verb but lack the expertise to pick the right one. SamIAmNot (talk) 22:00, 19 March 2025 (UTC)

"such that the neighbourhood property of the algorithm is vowed" — 'vowed' is pretty sus also. SamIAmNot (talk) 22:03, 19 March 2025 (UTC)

Is "Consistent hashing" the same as "Stable hashing"?

Under "See Also", these are separate links, but they both go to the same place (Consistent hashing). Would it be better to have one link, perhaps called "Consistent (or Stable) hashing"? Usuallylogical (talk) 19:49, 28 July 2025 (UTC)