nilehmann / libk2tree
k2tree implementation
☆10Updated 8 years ago
Related projects ⓘ
Alternatives and complementary repositories for libk2tree
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- C++ Library implementing Compressed String Dictionaries☆45Updated 2 years ago
- LLAMA Graph Analytics Engine☆41Updated 7 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- ☆79Updated 7 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- A C++ library for the analysis of structural dynamic graphs☆26Updated 2 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- CP 2015 subgraph isomorphism experiments, data and paper☆13Updated 9 years ago
- GraphMat graph analytics framework☆101Updated last year
- Learned Monotone Minimal Perfect Hashing☆23Updated 2 months ago
- A NUMA-aware Graph-structured Analytics Framework☆42Updated 6 years ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆30Updated 3 months ago
- RDF Graph Database (http://grid.hust.edu.cn/triplebit/)☆11Updated 10 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- Persistent Memory Graph Database☆43Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- A C++ library for summarizing data streams☆24Updated 5 years ago
- WebGraph framework with extensions☆22Updated 9 years ago
- Master's thesis project involving label-constrained reachability (LCR)☆0Updated 3 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆9Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆106Updated 7 months ago
- Edge-centric Graph Processing System using Streaming Partitions☆80Updated 6 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆85Updated 5 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆32Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- ☆15Updated 10 years ago
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆52Updated 8 years ago
- Succinct data structures in C/C++☆82Updated last month