Dynamic data structure for sparse graphs.
☆31Apr 3, 2024Updated 2 years ago
Alternatives and similar repositories for Packed-Compressed-Sparse-Row
Users that are interested in Packed-Compressed-Sparse-Row are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆26Jan 21, 2026Updated 8 months ago
- NUMA-aware parallel packed CSR data structure for large-scale dynamic graph data☆13May 11, 2026Updated 4 months ago
- A simple implementation of the packed memory array☆20Sep 1, 2013Updated 13 years ago
- ☆11May 29, 2024Updated 2 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆89Jun 24, 2019Updated 7 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Official code of our work, VCSR: Mutable CSR Graph Format Using Vertex-Centric Packed Memory Array [CCGrid 2022].☆15Jun 30, 2022Updated 4 years ago
- A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…☆147Apr 4, 2023Updated 3 years ago
- ☆10Jan 31, 2024Updated 2 years ago
- C++ driver to evaluate updates in dynamic structural graphs☆19Jun 14, 2022Updated 4 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Mar 1, 2018Updated 8 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆60Jan 5, 2021Updated 5 years ago
- Out-of-GPU-Memory Graph Processing with Minimal Data Transfer☆59Nov 15, 2022Updated 3 years ago
- ☆10Jan 15, 2023Updated 3 years ago
- GBBS: Graph Based Benchmark Suite☆225Jun 2, 2026Updated 4 months ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s☆39May 11, 2022Updated 4 years ago
- This repository contains information about graph processing.☆31Aug 5, 2024Updated 2 years ago
- Sequential implementation of the Rewired Memory Array.☆20May 23, 2019Updated 7 years ago
- Pensieve is a skewness-aware multi-version graph processing system that exploits the time locality of graph version access and leverages …☆21Aug 14, 2021Updated 5 years ago
- ☆23Sep 14, 2026Updated 3 weeks ago
- ☆19Sep 17, 2021Updated 5 years ago
- The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS☆11May 29, 2019Updated 7 years ago
- Verilog AST☆19Dec 2, 2023Updated 2 years ago
- A platform to evaluate techniques used in multicore graph processing.☆37Oct 25, 2018Updated 7 years ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- ☆20Mar 28, 2025Updated last year
- Open-source library for Graph Streaming. Solves the connected components problem using sub-linear space. Published in SIGMOD'22.☆11Apr 6, 2026Updated 6 months ago
- This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"☆17Apr 23, 2021Updated 5 years ago
- ☆28Feb 14, 2026Updated 7 months ago
- A C++ library for the analysis of structural dynamic graphs☆28Jun 14, 2022Updated 4 years ago
- LiveGraph: a transactional graph storage system with purely sequential adjacency list scans☆58Apr 5, 2021Updated 5 years ago
- Python implementation of directed graph hashing, from the paper "Directed Graph Hashing"☆17Sep 29, 2026Updated last week
- ☆12Aug 17, 2022Updated 4 years ago
- Edge-centric Graph Processing System using Streaming Partitions☆82Jan 16, 2018Updated 8 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- In a adjacent list Graph, find the shortest path between two Nodes by Dijkstra's algorithm.☆12Dec 10, 2013Updated 12 years ago
- Adaptive stream-processing research system for workload-aware window joins and execution.☆16Jul 24, 2026Updated 2 months ago
- Blaze: Fast Graph Processing on Fast SSDs (SC'22)☆11Oct 12, 2022Updated 3 years ago
- PostgreSQL extension to log SQL statements for specific server processes.☆12Feb 17, 2024Updated 2 years ago
- Historical shortest-path distance querying index by pruned landmark labeling☆10May 24, 2014Updated 12 years ago
- Packed Memory Array☆17May 14, 2014Updated 12 years ago
- Parallel Weighted Random Sampling☆21Dec 9, 2020Updated 5 years ago