Papers › Storing a Trie with Compact and Predictable Space
Storing a Trie with Compact and Predictable Space
Yuxuan Dong
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper proposed a storing approach for trie structures, called coordinate hash trie. The basic idea is using a global hash table with a special hash function to store all edges of a trie. For a trie with n nodes and an alphabet with size m, the execution time of finding, inserting and deleting a child node, is O(1) for the average case, O(m) for the worst case. The space used by this approach is O(n), unrelated to m. The constant of space consumption is predictable, with no need for reallocation or resizing. In addition, this approach is very easy to implement.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections