arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1107.4378cs.DS
收藏

完全反摊销的Cuckoo Hashing用于缓存不经意字典和多重映射

Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps

Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler

摘要:

字典(或映射)是一种要求所有键都是唯一的键值存储,而多映射是一种允许多个值与同一个键相关联的键值存储。我们为字典和多重映射设计基于哈希的索引方案,以实现最坏情况下的查找和更新的最佳性能,数据结构需要哈希操作的概率很小或可以忽略不计,这取决于我们是否在外部存储器(I/O)模型或随机存取机(RAM)模型的一个众所周知的版本中工作。我们的构造的主要特征之一是它们是\emph{fully de-amortized},这意味着它们的性能边界保持不变,而无需使用某些性能参数来调整它们的构造,例如故障概率指数中的常数因子,或者在外部存储器模型的情况下,块或高速缓存行的大小以及内部存储器的大小(即,我们的外部存储器算法是高速缓存不经意的)。我们的解决方案是基于一个完全de-amortized实现布谷鸟散列,这可能是独立的利益。该哈希方案使用两个布谷鸟哈希表,一个“嵌套”在另一个内部,其中一个作为主要结构,另一个作为辅助支持队列/存储结构,其相对于传统辅助结构是超大的,但仍然向我们的方案增加了可忽略不计的存储。这种辅助结构使得cuckoo hashing的成功概率非常高,这在加密或数据密集型应用中非常有用。

英文摘要:

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 a small or negligible probability the data structure will require a rehash operation, depending on whether we are working in the the external-memory (I/O) model or one of the well-known versions of the Random Access Machine (RAM) model. One of the main features of our constructions is that they are \emph{fully de-amortized}, meaning that their performance bounds hold without one having to tune their constructions with certain performance parameters, such as the constant factors in the exponents of failure probabilities or, in the case of the external-memory model, the size of blocks or cache lines and the size of internal memory (i.e., our external-memory algorithms are cache oblivious). Our solutions are based on a fully de-amortized implementation of cuckoo hashing, which may be of independent interest. This hashing scheme uses two cuckoo hash tables, one "nested" inside the other, with one serving as a primary structure and the other serving as an auxiliary supporting queue/stash structure that is super-sized with respect to traditional auxiliary structures but nevertheless adds negligible storage to our scheme. This auxiliary structure allows the success probability for cuckoo hashing to be very high, which is useful in cryptographic or data-intensive applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑