Compressed double-array tries for static string dictionaries
☆11May 9, 2019Updated 6 years ago
Alternatives and similar repositories for cda-tries
Users that are interested in cda-tries are comparing it to the libraries listed below
Sorting:
- C++ Library implementing Compressed String Dictionaries☆46Apr 25, 2022Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 3 months ago
- Fast compressed trie dictionary library☆71Sep 20, 2024Updated last year
- Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem☆28Mar 30, 2025Updated 11 months ago
- similarity join and search algorithms for edit distance and jaccard☆19Dec 17, 2017Updated 8 years ago
- Learned Monotone Minimal Perfect Hashing☆31Apr 1, 2025Updated 11 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- For details, see the blog post:☆35Dec 14, 2023Updated 2 years ago
- Winforms app to convert Mapbox GL JSON styles to Mapzen YAML styles