2010
DOI: 10.1016/j.ipm.2009.08.004
|View full text |Cite
|
Sign up to set email alerts
|

New methods for compression of MP double array by compact management of suffixes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 23 publications
0
5
0
Order By: Relevance
“…In other words, the third technique cannot be used because the empty spaces are not directly identified. Previous results show that the method presents problems related to time requirements for large datasets. If the third technique is excluded, the problem becomes much more critical.…”
Section: Practical Rearrangement Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…In other words, the third technique cannot be used because the empty spaces are not directly identified. Previous results show that the method presents problems related to time requirements for large datasets. If the third technique is excluded, the problem becomes much more critical.…”
Section: Practical Rearrangement Methodsmentioning
confidence: 99%
“…tail . Dorji et al proposed 2 methods to improve the load factor β. The first method embeds short suffixes into leaf base elements rather than storing them in tail .…”
Section: Da Trie Dictionariesmentioning
confidence: 99%
See 1 more Smart Citation
“…Another approach to compress the double‐array is to employ compact trie forms. The minimal‐prefix (MP) trie 40,41 is an often‐used form, 4,7,16 and various methods to efficiently implement the MP‐trie using the double‐array have been proposed 17,42‐44 . However, the MP‐trie is specialized for dictionary lookups, which are done by traversing a trie from the root to a leaf.…”
Section: Related Workmentioning
confidence: 99%
“…The minimal-prefix (MP) trie 40,41 is an often-used form, 4,7,16 and various methods to efficiently implement the MP-trie using the double-array have been proposed. 17,[42][43][44] However, the MP-trie is specialized for dictionary lookups, which are done by traversing a trie from the root to a leaf. Other compact forms such as double-tries 45 and directed acyclic word graphs 20 cannot be applied to AC automata in principle.…”
Section: Application Example: Japanese Tokenizationmentioning
confidence: 99%