nilehmann / libk2tree
k2tree implementation
☆10Updated 8 years ago
Alternatives and similar repositories for libk2tree:
Users that are interested in libk2tree are comparing it to the libraries listed below
- Compact Data Structures Library☆98Updated 2 years ago
- Extension of the rdf3x engine and the translatesparql tool.☆46Updated 11 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 7 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 4 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Persistent Memory Graph Database☆44Updated 2 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆9Updated 5 years ago
- A C++ library for the analysis of structural dynamic graphs☆26Updated 2 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 4 months ago
- LLAMA Graph Analytics Engine☆41Updated 7 years ago
- A C++ library for summarizing data streams☆24Updated 5 years ago
- Persistent memory allocator for data-centric analytics☆54Updated this week
- ☆25Updated 2 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆40Updated 8 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Compact Tree Representation☆16Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Count-Min sketch-based approximate counting library☆45Updated 6 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 8 years ago
- A distributed in-memory graph store.☆31Updated 8 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- Hash table with separate chaining layout☆9Updated 3 years ago
- C++17 implementation of memory-efficient dynamic tries☆57Updated 2 years ago