An efficient deletion method for a minimal prefix double array

Oono, Masaki; Morita, Ken; Fuketa, Masao; Aoe, Jun-ichi

doi:10.1002/spe.778

Cited by 9 publications

(10 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, general implementations use the empty-link method (ELM). 15,26 Empty-link method builds a doubly circular linked list of empty elements called an empty list.…”

Section: Figurementioning

confidence: 99%

“…The original DA performs this search by scanning base and check elements linearly in O ( N ) time; however, this time turns into a critical problem for a large dictionary. Therefore, general implementations use the empty‐link method (ELM) . Empty‐link method builds a doubly circular linked list of empty elements called an empty list .…”

Section: Da Trie Dictionariesmentioning

confidence: 99%

“…This method can maintain a high load factor α in a normal trie that includes many single nodes; however, it does not work efficiently in an MP‐trie, as the many single nodes in a normal trie are replaced into strings. Therefore, Yata et al presented an adaptive method that uses elements with fewer siblings than the rearmost element as well as empty and single elements. Available literature shows that this adaptive method can maintain α≃1.0 in MP‐tries from experiments using English and Japanese datasets.…”

Section: Da Trie Dictionariesmentioning

confidence: 99%

“…A DA structure can include empty elements. Although its space efficiency depends on the load factor (ie, the proportion of nonempty elements to the total elements), as in a hash table, 22 existing methods [23][24][25][26] can maintain a high load factor.…”

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

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

“…Therefore, general implementations use the empty-link method (ELM). 15,26 Empty-link method builds a doubly circular linked list of empty elements called an empty list.…”

Section: Figurementioning

confidence: 99%

Section: Da Trie Dictionariesmentioning

confidence: 99%

Section: Da Trie Dictionariesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 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

“…The double-array presented by Aoe [3,4], Yata et al [26] is an efficient data structure that represents the trie with two one-dimensional arrays called BASE and CHECK. The double-array provides fast traversal at time complexity of O (1).…”

Section: Introductionmentioning

confidence: 99%

A compression method of double-array structures using linear functions

et al. 2015

Self Cite

View full text Add to dashboard Cite

A trie is one of the data structures for keyword search algorithms and is utilized in natural language processing, reserved words search for compilers and so on. The doublearray and LOUDS are efficient representation methods for the trie. The double-array provides fast traversal at time complexity of O(1), but the space usage of the double-array is larger than that of LOUDS. LOUDS is a succinct data structure with bit-string, and its space usage is extremely compact. However, its traversal speed is not so fast. This paper presents a new compression method of the double-array with keeping the retrieval speed. Our new method compresses the double-array by dividing the double-array into blocks and by using linear functions. Experimental results for varied keywords show that our new method reduced space usage of the double-array up to about 44 %, and the retrieval speed of the new method was 9-14 times faster than that of LOUDS. Moreover, the results show that the construction speed of the new method was faster than that of the conventional method for a large keyword set.

show abstract

Engineering faster double‐array Aho–Corasick automata

Kanda¹,

Akabe²,

Oda

2023

Softw Pract Exp

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

An efficient deletion method for a minimal prefix double array

Cited by 9 publications

References 4 publications

Practical rearrangement methods for dynamic double‐array dictionaries

Practical rearrangement methods for dynamic double‐array dictionaries

A compression method of double-array structures using linear functions

Engineering faster double‐array Aho–Corasick automata

Contact Info

Product

Resources

About