2019
DOI: 10.2306/scienceasia1513-1874.2019.45.065
|View full text |Cite
|
Sign up to set email alerts
|

A new heuristic for full trie minimization

Abstract: Trie is a data structure with many applications. High space usage is the major drawback of the trie. The order-containing trie optimizes the space usage of the trie by rearranging symbols of strings. We present a new heuristic for building order-containing tries with small space. The heuristic is based on the following observation. For a given string set P, by moving the symbols on a position to the first position of strings in P, the trie of the resulting pattern set may have fewer nodes than that of the trie… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 12 publications
(17 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?