A compression method of double-array structures using linear functions

Kanda, Shigenobu; Fuketa, Masao; Morita, Ken; Aoe, Jun-ichi

doi:10.1007/s10115-015-0873-0

Cited by 11 publications

(17 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The example dictionary embeds associated values in a fixed-length space on TAIL after the terminator, eg, TAIL [11] = 3. If a key is registered without TAIL, the associated value is embedded in the corresponding leaf BASE element, eg, BASE [4] = 0.…”

Section: Dictionary Implementationmentioning

confidence: 99%

“…In other words, the successor and predecessor of r i are obtained from BASE Figure 1, empty elements 3, 9, and 11 are scanned as BASE [3] = 9, BASE [9] = 11, and BASE [11] = 3. The ELM uses empty elements and thus does not have any disadvantages in terms of space efficiency.…”

Section: Figurementioning

confidence: 99%

“…The last element, or element 11, is given by CHECK[head]. When a new empty element 5 is added, it is inserted between the first and last elements as BASE [5] ← 3, CHECK [3] ← 5, BASE [11] ← 5, and CHECK [5] ← 11. Note that the resulting empty elements are scanned in the order of 3, 9, 11, and 5.…”

Section: Figurementioning

confidence: 99%

“…In other words, the order of r 1 , r 2 , … , r m does not correspond to the address order of BASE and CHECK. When the empty element 9 is removed from the DA, the previous element CHECK [9] = 3 and the next element BASE [9] = 11 are rechained as BASE [3] ← 11 and CHECK [11] ← 3. The updates are performed in constant time.…”

Section: Figurementioning

confidence: 99%

“…Most studies of static DA tries attempted to improve space efficiency and retrieval speed. [8][9][10][11][12] Static DA tries are typically used for dictionaries without frequent key updates (ie, insertions and deletions), such as Darts 13 and Darts-clone. 14 With respect to dynamic DA tries, there are 2 main objectives.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Practical rearrangement methods for dynamic double‐array dictionaries

et al. 2017

Self Cite

View full text Add to dashboard Cite

SummaryDouble-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.

show abstract

Section: Dictionary Implementationmentioning

confidence: 99%

Section: Figurementioning

confidence: 99%

Section: Figurementioning

confidence: 99%

Section: Figurementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Practical rearrangement methods for dynamic double‐array dictionaries

et al. 2017

Self Cite

View full text Add to dashboard Cite

show abstract

Engineering faster double‐array Aho–Corasick automata

Kanda¹,

Akabe²,

Oda

2023

Softw Pract Exp

Self Cite

View full text Add to dashboard Cite

Multiple pattern matching in strings is a fundamental problem in text processing applications such as regular expressions or tokenization. This article studies efficient implementations of double-array Aho-Corasick automata (DAACs), data structures for quickly performing the multiple pattern matching. The practical performance of DAACs is improved by carefully designing the data structure, and many implementation techniques have been proposed thus far. A problem in DAACs is that comprehensive descriptions and experimental analyses on their ideas are not provided. Engineers face difficulties in implementing an efficient DAAC. In this article, we review implementation techniques for DAACs and provide a comprehensive description of them. We also propose several new techniques for further improvement. We conduct exhaustive experiments through real-world datasets and reveal the best combination of techniques to achieve a higher performance in DAACs. The best combination is different from those used in the most popular libraries of DAACs, which demonstrates that their performance can be further enhanced. On the basis of our experimental analysis, we developed a new Rust library for fast multiple pattern matching using DAACs, named Daachorse, as open-source software at https://github. com/daac-tools/daachorse. Experiments demonstrate that Daachorse outperforms other AC-automaton implementations, indicating its suitability as a fast alternative for multiple pattern matching in many applications.

show abstract