mpetri / recursive_graph_bisectionLinks
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
Alternatives and similar repositories for recursive_graph_bisection
Users that are interested in recursive_graph_bisection are comparing it to the libraries listed below
Sorting:
- ☆12Updated 7 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- A NUMA-aware Graph-structured Analytics Framework☆44Updated 7 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Parallel Balanced Binary Tree Structures☆117Updated 5 months ago
- GBBS: Graph Based Benchmark Suite☆212Updated 3 weeks ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A library of inverted index data structures☆150Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 6 months ago
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆10Updated 5 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 6 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- ☆38Updated 5 years ago
- A simple implementation of the packed memory array☆20Updated 12 years ago
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆24Updated 9 months ago
- A read-optimized learned index for unsorted data☆31Updated 2 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆59Updated 4 years ago
- ☆25Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated 11 months ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 6 years ago
- ☆11Updated last year
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆33Updated 4 months ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 7 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆112Updated 8 months ago
- ☆30Updated 6 years ago