Practicably Boosting the Processing Performance of BFS-like Algorithms on Semi-External Graph System via I-O-Efficient Graph Ordering

This course aims to enhance the processing performance of BFS-like algorithms on semi-external graph systems through I/O-Efficient Graph Ordering. The learning outcomes include understanding the challenges faced by BFS-like algorithms on external graph systems, learning about the IOE-Order technique for improving I/O efficiency, and evaluating the effectiveness of this approach. The course teaches skills such as Breadth-First Degree-Second (BFDS) Ordering and Out-Degree Binning for optimizing graph data processing. The teaching method involves presenting research findings and techniques for improving the performance of BFS-like algorithms on external graph systems. The intended audience for this course includes researchers, practitioners, and students interested in graph processing, algorithm optimization, and I/O efficiency in large-scale graph systems.