trie
Generic prefix tree for golang (by s0rg)
chtrie
Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity (by dongyx)
| trie | chtrie | |
|---|---|---|
| 1 | 5 | |
| 12 | 18 | |
| - | - | |
| 5.1 | 4.9 | |
| about 2 months ago | about 1 year ago | |
| Go | C | |
| MIT License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
trie
Posts with mentions or reviews of trie.
We have used some of these posts to build our list of alternatives
and similar projects.
chtrie
Posts with mentions or reviews of chtrie.
We have used some of these posts to build our list of alternatives
and similar projects.
-
performance of a trie implementation
For comparison, I am using https://github.com/dongyx/chtrie a "coordinated hash trie" implementation by Yuxuan Dong, also described by this https://arxiv.org/abs/2302.03690 paper on arxiv.org. I picked it because it seemed most comparable and lightweight, as well as having a fairly small code size.
- Show HN: Trie implementation balancing between time, space and simplicity
- Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity
- Coordinate Hash Trie: Balancing Between Time, Space, and Simplicity
- The Implementation of the Coordinate Hash Trie
What are some alternatives?
When comparing trie and chtrie you can also consider the following projects:
trie - Missing Trie implementation for Go
Cadmium - Natural Language Processing (NLP) library for Crystal
art - Adaptive Radix Tree done right
goblin - A golang http router based on trie tree.
trie - A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.
data-structures - A collection of powerful data structures
data-structures - Go datastructures.
hash-array-mapped-trie - A hash array mapped trie implementation in c.
go-succinct-data-structure-trie - Succinct Data Structure of Trie, written in Go
ptrie - A prefix tree implementation in go
libaca - C Library of Aho-Corasick Algorithm based on Coordinate Hash Trie