aplf / sdk2treeLinks
Code used in the paper "On dynamic succinct graph representations".
☆11Updated 3 years ago
Alternatives and similar repositories for sdk2tree
Users that are interested in sdk2tree are comparing it to the libraries listed below
Sorting:
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- k2tree implementation☆10Updated 8 years ago
- ☆19Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆10Updated 5 years ago
- ☆38Updated 5 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆45Updated last week
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 months ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 4 months ago
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- FOundation of stXXl and thriLL☆14Updated last year
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆31Updated 10 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Stream processing engine☆12Updated 4 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Layered Multiple Functional Aggregate Optimization☆18Updated 4 years ago
- Fast Approximate Membership Filters (C++)☆22Updated 4 years ago
- Implementation of the G-CORE graph query language on Spark☆15Updated 3 years ago
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- simd enabled column imprints☆11Updated 7 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- Generic driver for LDBC Graphalytics implementation☆83Updated 6 months ago