nilehmann / libk2tree
k2tree implementation
☆10Updated 8 years ago
Related projects ⓘ
Alternatives and complementary repositories for libk2tree
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- LLAMA Graph Analytics Engine☆41Updated 7 years ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- Persistent Memory Graph Database☆43Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- [deprecated] Reference Implementation of OpenSHMEM on GASNet (specification <= 1.3)☆43Updated 7 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆9Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- A C++ library for the analysis of structural dynamic graphs☆26Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 5 months ago
- Extension of the rdf3x engine and the translatesparql tool.☆46Updated 11 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 4 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 8 years ago
- C++ implementation of Concise and WAH compressed bitsets☆21Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆53Updated 10 months ago
- Master's thesis project involving label-constrained reachability (LCR)☆0Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- ☆79Updated 7 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆37Updated 4 years ago
- Succinct data structures in C/C++☆82Updated last month
- High-speed Bloom filters and taffy filters for C, C++, and Java☆32Updated last year
- GraphMat graph analytics framework☆101Updated last year
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆85Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- Template Vector Library☆18Updated 3 years ago
- A NUMA-aware Graph-structured Analytics Framework☆42Updated 6 years ago