aplf / sdk2treeLinks
Code used in the paper "On dynamic succinct graph representations".
☆11Updated 4 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☆24Updated 5 years ago
- Your worst case is our best case.☆143Updated 8 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 4 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆10Updated 6 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- A Spark Based Scalable Framework for Efficient Hypergraph Processing☆23Updated 10 years ago
- Simple baselines for "Learned Indexes"☆159Updated 8 years ago
- S-Store Transactional Streaming Data Management System☆22Updated 5 years ago
- ☆39Updated 5 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Updated 7 months ago
- ☆20Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 3 years ago
- Extension of the rdf3x engine and the translatesparql tool.☆44Updated 12 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆33Updated 4 years ago
- Stream processing engine☆13Updated 4 years ago
- Quickstep Project☆27Updated 6 years ago
- ☆53Updated last year
- Succinct data structures in C/C++☆92Updated last year
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆11Updated 9 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Sux4J is an effort to bring succinct data structures to Java.☆171Updated 6 months ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- A scalable distributed graph partitioner. Ongoing research.☆14Updated 8 years ago
- A C++ library to benchmark inverted indexes.☆21Updated 5 years ago
- Scalable Graph Mining☆63Updated 3 years ago
- Fast Approximate Membership Filters (C++)☆23Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆89Updated 5 years ago
- Generic driver for LDBC Graphalytics implementation☆86Updated last year