RapidStore reports up to 3.46x faster graph analytics and 56.34% memory savings versus existing dynamic graph systems by using subgraph-level versioning and a compressed radix tree.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries
RapidStore reports up to 3.46x faster graph analytics and 56.34% memory savings versus existing dynamic graph systems by using subgraph-level versioning and a compressed radix tree.