A hierarchical approach to reachability query answering in very large graph databases

The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in massive graphs such as biological interaction networks, or pathways. Contemporary solutions mainly take two distinct approaches - precompute reachability in the form of transitive closure (trade space for time) or use state space search (trade time for space). A middle ground among the two approaches has recently gained popularity. It precomputes part of the reachability information as a complex index so that most queries can be answered within a reasonable time. In this approach, the main cost now is creation of the index, and response generation using the index, and the space needed to materialize the index. Most contemporary solutions favor a combination of these costs to be efficient for a class of applications. In this paper, we propose a hierarchical index based on graph segmentation to reduce index size wi...

• Type: Journal
• Year: 2010
• Where: CIKM
• Authors: Saikat K. Dey, Hasan M. Jamil
• Keywords: CIKM 2010, Information Technology, Reachability Query Computation, Space, Transitive Closure