Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
☆59Jan 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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Compressed double-array tries for static string dictionaries☆12May 9, 2019Updated 7 years ago
- A collection of succinct data structures☆216Jan 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 2 years ago
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 4 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- A library of inverted index data structures☆150Dec 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 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 8 years ago
- ☆27Mar 23, 2017Updated 9 years ago
- Experiments with array layouts for comparison-based searching☆88Jan 5, 2024Updated 2 years ago
- Space efficient (graph) algorithms☆18Sep 10, 2020Updated 5 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- similarity join and search algorithms for edit distance and jaccard☆19Dec 17, 2017Updated 8 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Careful implementation of Jaro and Jaro-Winkler text difference algorithms☆17Jan 23, 2017Updated 9 years ago
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 4 years ago
- Fully procedural GLSL eyeball shader☆11Sep 14, 2015Updated 10 years ago
- Crit-bit tree (trie) library☆32Jun 8, 2014Updated 12 years ago
- Bitmap Compression Library in Go☆52Nov 19, 2013Updated 12 years ago
- Succinct Data Structure Library☆110Sep 26, 2013Updated 12 years ago
- Collection of succinct data structures in Rust☆105Jul 24, 2026Updated 2 weeks ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem☆28Mar 30, 2025Updated last year
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Jan 31, 2015Updated 11 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- It's an experiment based on 09 KDD paper, Beyond Blacklists: Learning to Detect Malicious Web Sites from Suspicious URLs☆10Jan 8, 2019Updated 7 years ago
- Lock-free multithreaded memory allocation☆111Dec 14, 2016Updated 9 years ago
- Companion source code for GTC 2014 talk☆11Mar 25, 2014Updated 12 years ago
- finding set bits in large bitmaps☆15Nov 30, 2015Updated 10 years ago
- Regular Expression Research☆12Jul 6, 2022Updated 4 years ago
- a light weight, high performance coroutine implementation☆39Oct 16, 2012Updated 13 years ago
- github.com/cznic/fileutil has moved to modernc.org/fileutil☆16Nov 22, 2018Updated 7 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Efficient and effective query auto-completion in C++.☆56Sep 24, 2023Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆37Jun 8, 2016Updated 10 years ago
- A simple example showing how to implement a DDA based screen-space ray marcher in Unity☆13Apr 18, 2017Updated 9 years ago
- Experimentations with distributed tasks for a game engine☆12Jul 20, 2012Updated 14 years ago
- Marching cube on the GPU☆11Oct 1, 2012Updated 13 years ago
- An experimental lexer and parser generator☆10Jul 31, 2018Updated 8 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago