The DOI matches its Crossref record.
PrismX: A Single-Machine System for Querying Big Graphs
Abstract
We demonstrate PrismX (PRAM with SSDs as Memory eXtension), a single-machine system for graph analytics. PrismX allows users to make practical use of existing PRAM algorithms without any change. To cope with the limited DRAM capacity, it employs NVMe SSDs as memory extension. Leveraging graph preprocessing, PrismX implements a series of system optimization strategies, which automatically and transparently adapt to the runtime workload, no matter whether the computation is CPU-bound or I/O-bound. We demonstrate PrismX for its (1) ease of programming by reusing PRAM algorithms, (2) efficiency by comparing with the state-of-the-art graph systems, single-machine or multi-machine, in-memory or out-of-core; (3) parallel scalability of in-memory PRAM algorithms, reducing runtime when more CPU cores are available; and (4) applications in credit risk assessment.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“However, for large-scale graphs, the exponential growth in the number of nodes, edges, and paths significantly complicates the retrieval [23, 53, 54, 67].”
From LEGO-GraphRAG: Modularizing Graph-Based Retrieval-Augmented Generation for Design Space Exploration (2025) · cites this paper as [67]
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 15
- Roshan Dathathri, Gurbinder Gill, Loc Hoang, Hoang-Vu Dang, Alex Brooks, Nikoli Dryden, Marc Snir, and Keshav Pingali. 2018. Gluon: A Communication-Optimizing Substrate for Distributed Heterogeneous Graph Analytics. In PLDI.
- 10.14778/3476311.3476369 · DOI
- 10.1145/3282488 · DOI
- Joseph E. Gonzalez Yucheng Low Haijie Gu Danny Bickson and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. In OSDI.
- J. Kim and S. Swanson. 2022. Blaze: Fast graph processing on fast SSDs. In SC.
- 10.1016/0304-3975(90)90192-K · DOI
- 10.1145/1807167.1807184 · DOI
- Robin Milner. 1989. Communication and Concurrency. Prentice Hall.
- Donald Nguyen Andrew Lenharth and Keshav Pingali. 2013. A lightweight infrastructure for graph analytics. In SOSP. ACM 456--471. · DOI
- 10.1016/0196-6774(82)90013-X · DOI
- Stergios Stergiou Dipen Rughwani and Kostas Tsioutsiouliklis. 2018. Shortcutting label propagation for distributed connected components. In WSDM. · DOI
- Leslie G. Valiant. 1990. General Purpose Parallel Architectures. In Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity. 943--972.
- Xiangyu Zhi, Xiao Yan, Bo Tang, Ziyao Yin, Yanchao Zhu, and Minqi Zhou. 2023. CoroGraph: Bridging Cache Efficiency and Work Efficiency for Graph Algorithm Execution. PVLDB 17, 4 (2023).
- Xiaowei Zhu Wentao Han and Wenguang Chen. 2015. GridGraph: Large-Scale Graph Processing on a Single Machine Using 2-Level Hierarchical Partitioning. In USENIX ATC. 375--386.
- 10.14778/3598581.3598590 · DOI
Cited by
Sorted by citations
LEGO-GraphRAG: Modularizing Graph-Based Retrieval-Augmented Generation for Design Space Exploration
Cao, Y., Gao, Z., Li, Z., Xie, X., Zhou, S. K., & Xu, J. (2025) · Proceedings of the VLDB Endowment · doi:10.14778/3748191.3748194 · Cited by 11
Metadata
- Authors
- Liu, S., Liu, Y., & Fan, W.
- Affiliations
- Shenzhen Institute of Computing Sciences, China
- Beihang University (CN)
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2024-08
- Volume
- 17
- Issue
- 12
- Pages
- 4485-4488
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W4404181167
- Cited by
- 2
- References
- 0
- Citations by year
- 2026: 1 · 2025: 1
- FWCI
- 0.28
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Proceedings of the VLDB Endowment (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
- Keywords
- graph analysis, PRAM algorithms, NVMe SSD, memory extension, large-scale graphs, graph preprocessing, parallel scalability, credit risk assessment
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
