libaca
C Library of Aho-Corasick Algorithm based on Coordinate Hash Trie (by dongyx)
chtrie
Coordinate Hash Trie: A Trie Variant Balancing between Time, Space, and Simplicity (by dongyx)
| libaca | chtrie | |
|---|---|---|
| 3 | 5 | |
| 7 | 18 | |
| - | - | |
| 2.3 | 4.9 | |
| about 1 year ago | about 1 year ago | |
| C | C | |
| BSD 3-clause "New" or "Revised" 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.
libaca
Posts with mentions or reviews of libaca.
We have used some of these posts to build our list of alternatives
and similar projects.
-
A Trie Variant Balancing between Time, Space, and Simplicity; And a C Implementation of the Aho-Corasick Algorithm Based on It
Repo of the A.-C algorithm implementation: https://github.com/dongyx/libaca
- LibACA: C Library Implementing `fgrep`, with Balance between Time, Space, and Simplicity, in 174 LOCs of C89
- LibACA: C Library of Aho-Corasick Algorithm, with Balance between Time, Space, and Simplicity
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 libaca and chtrie you can also consider the following projects:
multi_string_replace - A fast multiple string replace library for ruby. Uses a C implementation of the Aho–Corasick Algorithm based on https://github.com/morenice/ahocorasick while adding support for on the fly multiple string replacement. Faster alternative to String.gsub when dealing with non-regex (exact match) use cases
trie - Generic prefix tree for golang
Cadmium - Natural Language Processing (NLP) library for Crystal
goblin - A golang http router based on trie tree.
data-structures - A collection of powerful data structures
hash-array-mapped-trie - A hash array mapped trie implementation in c.
trie - Missing Trie implementation for Go