Cache-Oblivious dictionaries and multimaps with negligible failure probability

Authors:
Michael T. Goodrich;Daniel S. Hirschberg;Michael Mitzenmacher;Justin Thaler
Affiliations:
Dept. of Computer Science, University of California, Irvine;Dept. of Computer Science, University of California, Irvine;School of Engineering and Applied Sciences, Harvard University;School of Engineering and Applied Sciences, Harvard University
Venue:
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Year:
2012

Citing 29
Cited 0

Optimization for dynamic inverted index maintenance

SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
Surpassing the information theoretic bound with fusion trees

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Fusion trees can be implemented with AC0 instructions only

Theoretical Computer Science
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree

SIAM Journal on Computing
Introduction to algorithms

Introduction to algorithms
Cache oblivious search trees via binary trees of small height

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On AC0 implementations of fusion trees and atomic heaps

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
De-amortization of Algorithms

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Cache-oblivious B-trees

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Static Dictionaries on RAMs: Query Time is Necessary and Sufficient

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On Universal Classes of Extremely Random Constant-Time Hash Functions

SIAM Journal on Computing
Cuckoo hashing

Journal of Algorithms
Fast allocation and deallocation with an improved buddy system

Acta Informatica
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Indexing time vs. query time: trade-offs in dynamic information retrieval systems

Proceedings of the 14th ACM international conference on Information and knowledge management
Inverted files for text search engines

ACM Computing Surveys (CSUR)
Efficient online index maintenance for contiguous inverted lists

Information Processing and Management: an International Journal
Hybrid index maintenance for growing text collections

SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Engineering a cache-oblivious sorting algorithm

Journal of Experimental Algorithmics (JEA)
Efficient in-memory extensible inverted file

Information Systems
Efficient on-line index maintenance for dynamic text collections by using dynamic balancing tree

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Efficient online index construction for text databases

ACM Transactions on Database Systems (TODS)
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Cache-oblivious hashing

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
More Robust Hashing: Cuckoo Hashing with a Stash

SIAM Journal on Computing
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Privacy-preserving access of outsourced data via oblivious RAM simulation

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
External-memory multimaps

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A dictionary (or map) is a key-value store that requires all keys be unique, and a multimap is a key-value store that allows for multiple values to be associated with the same key. We design hashing-based indexing schemes for dictionaries and multimaps that achieve worst-case optimal performance for lookups and updates, with minimal space overhead and sub-polynomial probability that the data structure will require a rehash operation. Our dictionary structure is designed for the Random Access Machine (RAM) model, while our multimap implementation is designed for the cache-oblivious external memory (I/O) model. The failure probabilities for our structures are sub-polynomial, which can be useful in cryptographic or data-intensive applications.