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
Sorting:
- Code used in the paper "On dynamic succinct graph representations".☆11Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆10Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- High-performance (C++) implementation of the leapfrog-triejoin algorithm by Todd Veldhuizen (http://arxiv.org/abs/1210.0481)☆21Updated 9 years ago
- LLAMA Graph Analytics Engine☆41Updated 7 years ago
- Persistent Memory Graph Database☆43Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Experimental search engine in C/C++17 - still in early development.☆27Updated 7 months ago
- ☆38Updated 4 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Succinct C++☆24Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 11 months ago
- Extension of the rdf3x engine and the translatesparql tool.☆45Updated 11 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- GPU-Accelerated Faster Decoding of Integer Lists☆13Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- ☆82Updated 7 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated last month
- ☆28Updated this week
- A C++ library for the analysis of structural dynamic graphs☆27Updated 2 years ago
- Fast decoder for VByte-compressed integers☆122Updated 11 months ago
- Succinct data structures in C/C++☆87Updated 7 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Stream processing engine☆12Updated 4 years ago