Brief announcement: large-scale multimaps

Authors:
Michael T. Goodrich;Michael Mitzenmacher
Affiliations:
Univ. of California, Irvine, Irvine, CA, USA;Harvard University, Cambridge, MA, USA
Venue:
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Year:
2011

Citing 7
Cited 0

The input/output complexity of sorting and related problems

Communications of the ACM
A bridging model for parallel computation

Communications of the ACM
Cuckoo hashing

Journal of Algorithms
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
Balanced allocation and dictionaries with tightly packed constant size bins

Theoretical Computer Science
Efficient online index construction for text databases

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Many data structures support dictionaries, also known as maps or associative arrays, which store and manage a set of key-value pairs. A multimap is generalization that allows multiple values to be associated with the same key. We study how multimaps can be implemented efficiently online in external memory frameworks, with constant expected I/O. The key technique used to achieve our results is a combination of cuckoo hashing using buckets that hold multiple items with a multiqueue implementation to cope with varying numbers of values per key.