Department of Computer Science
Incremental maintenance of the minimum bisimulation of cyclic graphs
There have been numerous recent applications of graph databases (e.g., the Semantic Web, ontology representation, social networks, XML, chemical databases, and biological databases). A fundamental structural index for data graphs, namely minimum bisimulation, has been reported useful for efficient path query processing and optimization including selectivity estimation, among many others. Data graphs are subject to change and their indexes are updated accordingly. This paper studies the incremental maintenance problem of the minimum bisimulation of a possibly cyclic data graph. While cyclic graphs are ubiquitous among the data on the web, previous work on the maintenance problem has mostly focused on acyclic graphs. To study the problem with cyclic graphs, we first show that the two existing classes of minimization algorithms—merging algorithm and partition refinement—have their strengths and weaknesses. Second, we propose a novel hybrid algorithm and its analytical model. This algorithm supports an edge insertion or deletion and two forms of batch insertions or deletions. To the best of our knowledge, this is the first maintenance algorithm that guarantees minimum bisimulation of cyclic graphs. Third, we propose to partially reuse the minimum bisimulation before an update in order to optimize maintenance performance. We present an experimental study on both synthetic and real-data graphs that verified the efficiency and effectiveness of our algorithms. © 2013 IEEE.
Cyclic graphs, evolving graphs and graph algorithms, graph indexing, incremental maintenance, minimum bisimulation
Source Publication Title
IEEE Transactions on Knowledge and Data Engineering
Institute of Electrical and Electronics Engineers
Deng, Jintian, Byron Choi, Jianliang Xu, Haibo Hu, and Sourav S. Bhowmick. "Incremental maintenance of the minimum bisimulation of cyclic graphs." IEEE Transactions on Knowledge and Data Engineering 25.11 (2013): 2536-2550.