Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
☆58Jan 27, 2023Updated 3 years ago
Alternatives and similar repositories for path_decomposed_tries
Users that are interested in path_decomposed_tries are comparing it to the libraries listed below
Sorting:
- Compressed double-array tries for static string dictionaries☆11May 9, 2019Updated 6 years ago
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆58Dec 7, 2012Updated 13 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66May 29, 2024Updated last year
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 3 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆26Apr 26, 2022Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- Morally-correct string and stream interpolation for Go.☆24Apr 23, 2016Updated 9 years ago
- Experiments with array layouts for comparison-based searching☆87Jan 5, 2024Updated 2 years ago
- ☆27Mar 23, 2017Updated 8 years ago
- Lock-free multithreaded memory allocation☆111Dec 14, 2016Updated 9 years ago
- Bitmap Compression Library in Go☆52Nov 19, 2013Updated 12 years ago
- Intermediate Compute Language with OpenCL/CUDA Backends☆20Oct 11, 2014Updated 11 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Jan 31, 2015Updated 11 years ago
- Space efficient (graph) algorithms☆18Sep 10, 2020Updated 5 years ago
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 4 years ago
- Go implementation of skiplist, with search fingers☆33Oct 26, 2015Updated 10 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Careful implementation of Jaro and Jaro-Winkler text difference algorithms☆17Jan 23, 2017Updated 9 years ago
- Fully procedural GLSL eyeball shader☆11Sep 14, 2015Updated 10 years ago
- Crit-bit tree (trie) library☆32Jun 8, 2014Updated 11 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- Collection of succinct data structures in Rust☆104Mar 4, 2026Updated 2 weeks ago
- A sparse and compressed bitmap library.☆13Aug 28, 2014Updated 11 years ago
- Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem☆28Mar 30, 2025Updated 11 months ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Jun 8, 2016Updated 9 years ago
- Implements a Min-Heap / Priority Queue in C using an indirection table for memory efficiency.☆29Aug 26, 2014Updated 11 years ago
- Easy handling of memory-mapped files☆22Mar 28, 2014Updated 11 years ago
- A []byte pool for Go.☆44Jun 30, 2022Updated 3 years ago
- Durable dead simple queue that allows zero copy semantics. Durable under failure!☆18Dec 2, 2015Updated 10 years ago
- 🦞 Rust library of natural language dictionaries using character-wise double-array tries.☆37Jan 13, 2025Updated last year
- Companion source code for GTC 2014 talk☆11Mar 25, 2014Updated 11 years ago
- Simple foliage renderer☆14Sep 3, 2015Updated 10 years ago
- Regular Expression Research☆12Jul 6, 2022Updated 3 years ago
- github.com/cznic/fileutil has moved to modernc.org/fileutil☆15Nov 22, 2018Updated 7 years ago
- Efficient and effective query auto-completion in C++.☆56Sep 24, 2023Updated 2 years ago