• Cite Icon21
  • https://doi.org/10.1145/2463676.2463703Copy DOI Icon

I/O efficient

  • Jun 22, 2013
  • Zhiwei Zhang +4 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

A strongly connected component (SCC) is a maximal subgraph of a directed graph G in which every pair of nodes are reachable from each other in the SCC. With such a property, a general directed graph can be represented by a directed acyclic graph DAG by contracting an SCC of G to a node in DAG. In many real applications that need graph pattern matching, topological sorting, or reachability query processing, the best way to deal with a general directed graph is to deal with its DAG representation. Therefore, finding all SCCs in a directed graph G is a critical operation. The existing in-memory algorithms based on depth first search (DFS) can find all SCCs in linear time w.r.t. the size of a graph. However, when a graph cannot resident entirely in the main memory, the existing external or semi-external algorithms to find all SCCs have limitation to achieve high I/O efficiency. In this paper, we study new I/O efficient semi-external algorithms to find all SCCs for a massive directed graph G that cannot reside in main memory entirely. To overcome the deficiency of the existing DFS based semi-external algorithm that heavily relies on a total order, we explore a weak order based on which we investigate new algorithms. We propose a new two phase algorithm, namely, tree construction and tree search. In the tree construction phase, a spanning tree of G can be constructed in bounded sequential scans of G. In the tree search phase, it needs to sequentially scan the graph once to find all SCCs. In addition, we propose a new single phase algorithm, which combines the tree construction and tree search phases into a single phase, with three new optimization techniques. They are early acceptance, early rejection, and batch processing. By the single phase algorithm with the new optimization techniques, we can significantly reduce the number of I/Os and CPU cost. We conduct extensive experimental studies using 4 real datasets including a massive real dataset, and several synthetic datasets to confirm the I/O efficiency of our approaches.

Similar Papers
  • Research Article
  • Citations22

Efficient Disk-Based Directed Graph Processing: A Strongly Connected Component Approach

  • Apr 01, 2018
  • IEEE Transactions on Parallel and Distributed Systems
  • Yu Zhang +4
  • Research Article
  • Citations5

A simple detection and generation algorithm for simple circuits in directed graph based on depth-first traversal

  • May 09, 2020
  • Evolutionary Intelligence
  • Xiaoyan Gongye +4
  • Peer Review Report

Editor's evaluation: Single spikes drive sequential propagation and routing of activity in a cortical network

  • Aug 06, 2022
  • Peter Latham
  • Research Article
  • Citations1112

Designing Fully Distributed Consensus Protocols for Linear Multi-Agent Systems With Directed Graphs

  • Aug 20, 2014
  • IEEE Transactions on Automatic Control
  • Zhongkui Li +3
  • Research Article
  • Citations15

Event‐triggered finite‐time practical consensus of multiagent systems with general directed communication graphs

  • Sep 02, 2020
  • International Journal of Robust and Nonlinear Control
  • Junjie Fu +2
  • Conference Article

Fully distributed containment control for second-order nolinear multi-agent systems under a directed graph

  • Jul 01, 2017
  • Yingjing Wu +1
  • Research Article
  • Citations103

Aggregation convergecast scheduling in wireless sensor networks

  • Sep 19, 2010
  • Wireless Networks
  • Baljeet Malhotra +2
  • PDF
  • Research Article
  • Citations13

Fast rule-based graph programs

  • Feb 01, 2022
  • Science of Computer Programming
  • Graham Campbell +2
  • Conference Article
  • Citations1

Output feedback consensus tracking for second-order nonlinear multi-agent systems with directed communication graphs

  • May 01, 2017
  • Junjie Fu +2
  • Conference Article
  • Citations13

I/O-efficient strong connectivity and depth-first search for directed planar graphs

  • Oct 11, 2003
  • L Arge +1
  • Conference Article

Heterogeneous 2-Phase Method for Strongly Connected Components Detection and Classification of Graphs

  • Dec 01, 2019
  • Sara Rehmat +2
  • Research Article
  • Citations15

Suffix trees for inputs larger than main memory

  • Nov 18, 2010
  • Information Systems
  • Marina Barsky +2
  • Research Article

Optimal & near-optimal space efficient decision diagram algorithms

  • Feb 21, 1989
  • Sami Khuri
  • Research Article
  • Citations38

Processing and optimizing main memory spatial-keyword queries

  • Nov 01, 2015
  • Proceedings of the VLDB Endowment
  • Taesung Lee +5
  • Research Article
  • Citations30

Designing Event-Triggered Observers for Distributed Tracking Consensus of Higher-Order Multiagent Systems.

  • Aug 12, 2020
  • IEEE Transactions on Cybernetics
  • He Wang +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.