EFFICIENT STORAGE STRUCTURE OF A DICTIONARY WITH STRING KEYS AND ASSOCIATED VALUES |
| 5 | |
| 2012 |
| scientific article | 004.051 | ||
| 301-308 |
| The article describes an implementation of a dictionary based on minimal finite-state automata in which a key is associated with a set of values. The advantages of the dictionary as compared to other available implementations such as DMBS or C++ standard class library are illustrated. The acceleration of the search process ranges from 20–40 times up to several orders of magnitude, while the memory volume required is considerably reduced. |
 |