External-Memory Multimaps

被引:0
|
作者
Elaine Angelino
Michael T. Goodrich
Michael Mitzenmacher
Justin Thaler
机构
[1] Harvard University,SEAS
[2] University of California,Department of Computer Science
来源
Algorithmica | 2013年 / 67卷
关键词
External memory algorithms; Cuckoo hashing; Dictionaries; Multimaps;
D O I
暂无
中图分类号
学科分类号
摘要
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. 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.
引用
收藏
页码:23 / 48
页数:25
相关论文
共 50 条
  • [21] An efficient external-memory implementation of region query with application to area routing
    Liao, S
    Shenoy, N
    Nicholls, W
    [J]. ICCD'2002: IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN: VLSI IN COMPUTERS AND PROCESSORS, PROCEEDINGS, 2002, : 36 - 41
  • [22] Worst-case efficient external-memory priority queues
    Brodal, GS
    Katajainen, J
    [J]. ALGORITHM THEORY - SWAT'98, 1998, 1432 : 107 - 118
  • [23] External-memory breadth-first search with sublinear I/O
    Mehlhorn, K
    Meyer, U
    [J]. ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 : 723 - 735
  • [24] Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash
    Pibiri, Giulio Ermanno
    Trani, Roberto
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (03) : 1249 - 1259
  • [25] External-memory algorithms for processing line segments in geographic information systems
    Arge, Lars
    Vengroff, Darren Erik
    Vitter, Jeffrey Scott
    [J]. ALGORITHMICA, 2007, 47 (01) : 1 - 25
  • [26] On external-memory MST, SSSP and multi-way planar graph separation
    Arge, L
    Brodal, GS
    Toma, L
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2004, 53 (02): : 186 - 206
  • [27] An external-memory depth-first search algorithm for general grid graphs
    Her, Jun-Ho
    Ramakrishna, R. S.
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 374 (1-3) : 170 - 180
  • [28] External-memory depth-first search algorithm for solid grid graphs
    Her, JH
    Ramakrishna, RS
    [J]. INFORMATION PROCESSING LETTERS, 2005, 93 (04) : 177 - 183
  • [29] Randomized external-memory algorithms for line segment intersection and other geometric problems
    Crauser, A
    Ferragina, P
    Mehlhorn, K
    Meyer, U
    Ramos, EA
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2001, 11 (03) : 305 - 337
  • [30] A parallel external-memory frontier breadth-first traversal algorithm for clusters of workstations
    Niewiadomski, Robert
    Amaral, Jose Nelson
    Holte, Robert C.
    [J]. 2006 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDINGS, 2006, : 531 - 538