Practical rearrangement methods for dynamic double-array dictionaries
| Autor: | Yuma Fujita, Kazuhiro Morita, Masao Fuketa, Shunsuke Kanda |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Theoretical computer science
Double array Computer science String (computer science) 0202 electrical engineering electronic engineering information engineering 020207 software engineering 020201 artificial intelligence & image processing 02 engineering and technology Space (commercial competition) Software |
| Zdroj: | Software: Practice and Experience. 48:65-83 |
| ISSN: | 0038-0644 |
| DOI: | 10.1002/spe.2516 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text