mpetri / recursive_graph_bisection
This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergey Pupyrev, Alon Shalita: Compressing Graphs and Indexes with Recursive Graph Bisection. KDD 2016: 1535-1544
☆10Updated 6 years ago
Related projects: ⓘ
- Hash table with separate chaining layout☆9Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆40Updated 2 weeks ago
- Compact Tree Representation☆16Updated 7 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆48Updated 5 years ago
- Learned Monotone Minimal Perfect Hashing☆20Updated 2 weeks ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 2 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- Clustered Elias-Fano inverted indexes.☆14Updated 6 years ago
- testbed for different SIMD implementations for set intersection and set union☆38Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 3 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 6 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆30Updated last year
- An encoder/decoder collection for a sequence of integers☆31Updated 11 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- Dynamic succinct/compressed data structures☆111Updated 4 months ago
- C++ Library implementing Compressed String Dictionaries☆45Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆36Updated last week
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆46Updated 2 years ago
- Wavelet tree based on a fixed block boosting technique☆14Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆26Updated 3 years ago
- C++ Implementation of Zip Trees☆13Updated last year
- Master's thesis project involving label-constrained reachability (LCR)☆0Updated 3 years ago
- Succinct C++☆24Updated 4 years ago
- ☆36Updated 4 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆56Updated 4 months ago
- String map implementation through Fast Succinct Trie☆19Updated 3 years ago
- Succinct Data Structure Library 3.0☆83Updated last week
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆31Updated 9 months ago
- Compact Data Structures Library☆97Updated 2 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 4 years ago