Efficient Semi-External Breadth-First Search
Xiaolong Wan, Xixian Han

TL;DR
This paper introduces EP-BFS, an efficient semi-external memory algorithm for large-scale graph BFS, significantly reducing memory usage and achieving up to 10 times faster performance on billion-scale graphs.
Contribution
It proposes a novel semi-external BFS algorithm, EP-BFS, optimized for minimal memory use and high efficiency on large-scale graphs.
Findings
EP-BFS achieves up to 10x speedup over baseline methods.
EP-BFS requires less memory than traditional semi-external BFS algorithms.
Experimental validation on billion-scale graphs demonstrates scalability and efficiency.
Abstract
Breadth-first search (BFS) is known as a basic search strategy for learning graph properties. As the scales of graph databases have increased tremendously in recent years, large-scale graphs G are often disk-resident. Obtaining the BFS results of G in semi-external memory model is inevitable, because the in-memory BFS algorithm has to maintain the entire G in the main memory, and external BFS algorithms consume high computational costs. As a good trade-off between the internal and external memory models, semi-external memory model assumes that the main memory can at least reside a spanning tree of G. Nevertheless, the semi-external BFS problem is still an open issue due to its difficulty. Therefore, this paper presents a comprehensive study for processing BFS in semi-external memory model. After discussing the naive solutions based on the basic framework of semi-external graph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Advanced Database Systems and Queries · Algorithms and Data Compression
