Premium
Practical rearrangement methods for dynamic double‐array dictionaries
Author(s) -
Kanda Shunsuke,
Fujita Yuma,
Morita Kazuhiro,
Fuketa Masao
Publication year - 2018
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.2516
Subject(s) - computer science , string (physics) , key (lock) , space (punctuation) , algorithm , theoretical computer science , data mining , mathematics , computer security , mathematical physics , operating system
Summary 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.