Using hashing to solve the dictionary problem

MaRDI QIDQ5743421zbMATH OpenFDO

Authors John Iacono, Mihai Patrascu

Publication date 10 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=2095164

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Optimal hashing in external memory
• Constructing Efficient Dictionaries in Close to Sorting Time
• scientific article; zbMATH DE number 2079384
• scientific article; zbMATH DE number 4062630
• Optimality in external memory hashing

Cites work

• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 2079384 (Why is no real title available?)
• scientific article; zbMATH DE number 6297800 (Why is no real title available?)
• On dynamic bit-probe complexity
• On the cell probe complexity of dynamic membership
• The buffer tree: A technique for designing batched external data structures
• The limits of buffering: a tight lower bound for dynamic membership in the external memory model

Cited in

(10)

• Maintaining External Memory Efficient Hash Tables
• Large-Scale Data Dictionaries Based on Hash Tables
• scientific article; zbMATH DE number 176153 (Why is no real title available?)
• scientific article; zbMATH DE number 2079384 (Why is no real title available?)
• Optimal hashing in external memory
• External memory priority queues with decrease-key and applications to graph algorithms
• Lower bounds for external memory integer sorting via network coding
• Practical batch-updatable external hashing with sorting
• I/O-efficient data structures for colored range and prefix reporting
• Iceberg hashing: optimizing many hash-table criteria at once

This page was built for publication: Using hashing to solve the dictionary problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743421)