Computer Science – Data Structures and Algorithms
Scientific paper
2011-04-29
Computer Science
Data Structures and Algorithms
Accepted to ISAAC 2011. 22 pages, 6 figures
Scientific paper
Many data structures support dictionaries, also known as maps or associative arrays, which store and manage a set of key-value pairs. A \emph{multimap} is generalization that allows multiple values to be associated with the same key. For example, the inverted file data structure that is used prevalently in the infrastructure supporting search engines is a type of multimap, where words are used as keys and document pointers are used as values. We study the multimap abstract data type and how it can be implemented efficiently online in external memory frameworks, with constant expected I/O performance. 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. Our external-memory results are for the standard two-level memory model.
Angelino Elaine
Goodrich Michael T.
Mitzenmacher Michael
Thaler Justin
No associations
LandOfFree
External-Memory Multimaps does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with External-Memory Multimaps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and External-Memory Multimaps will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-17068