Practical rearrangement methods for dynamic double-array dictionaries
Practical rearrangement methods for dynamic double-array dictionaries
复制标题
动态双数组字典的实用重排方法
DOI：
10.1002/spe.2516
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Masao Fuketa
中科院分区：
文献类型：
--
作者：
Shunsuke Kanda;Yuma Fujita;Kazuhiro Morita;Masao Fuketa
双数组结构已广泛用于实现带有字符串键的字典。尽管动态双数组字典的空间效率往往会随着键的更新而降低，但我们仍然可以使用现有方法保持高效率。然而，这些方法存在时间和功能上的实际问题。本文提出了几种有效的重排方法来解决这些问题。通过使用真实数据集的实验，我们证明了所提出的重排方法比现有方法更加实用。
Double‐array structures have been widely used to implement dictionaries with string keys. Although the space efficiency of dynamic double‐array dictionaries tends to decrease with key updates, we can still maintain high efficiency using existing methods. However, these methods have practical problems of time and functionality. This paper presents several efficient rearrangement methods to solve these problems. Through experiments using real‐world datasets, we demonstrate that the proposed rearrangement methods are much more practical than existing methods.