GRAIL

Scalable reachability index for large graphs

Hilmi Yildirim, Vineet Chaoji, Mohammed J. Zaki

Research output: Chapter in Book/Report/Conference proceedingChapter

83 Citations (Scopus)

Abstract

Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing time and space versus query time performance. However, the biggest limitation of existing methods is that they simply do not scale to very large real-world graphs. We present a very simple, but scalable reachability index, called GRAIL, that is based on the idea of randomized interval labeling, and that can effectively handle very large graphs. Based on an extensive set of experiments, we show that while more sophisticated methods work better on small graphs, GRAIL is the only index that can scale to millions of nodes and edges. GRAIL has linear indexing time and space, and the query time ranges from constant time to being linear in the graph order and size.

Original languageEnglish
Title of host publicationProceedings of the VLDB Endowment
Pages276-284
Number of pages9
Volume3
Edition1
Publication statusPublished - Sep 2010
Externally publishedYes

Fingerprint

Directed graphs
Labeling
Experiments

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Science(all)

Cite this

Yildirim, H., Chaoji, V., & Zaki, M. J. (2010). GRAIL: Scalable reachability index for large graphs. In Proceedings of the VLDB Endowment (1 ed., Vol. 3, pp. 276-284)

GRAIL : Scalable reachability index for large graphs. / Yildirim, Hilmi; Chaoji, Vineet; Zaki, Mohammed J.

Proceedings of the VLDB Endowment. Vol. 3 1. ed. 2010. p. 276-284.

Research output: Chapter in Book/Report/Conference proceedingChapter

Yildirim, H, Chaoji, V & Zaki, MJ 2010, GRAIL: Scalable reachability index for large graphs. in Proceedings of the VLDB Endowment. 1 edn, vol. 3, pp. 276-284.
Yildirim H, Chaoji V, Zaki MJ. GRAIL: Scalable reachability index for large graphs. In Proceedings of the VLDB Endowment. 1 ed. Vol. 3. 2010. p. 276-284
Yildirim, Hilmi ; Chaoji, Vineet ; Zaki, Mohammed J. / GRAIL : Scalable reachability index for large graphs. Proceedings of the VLDB Endowment. Vol. 3 1. ed. 2010. pp. 276-284
@inbook{06ef0025d2ac4f83b98347f73a9bacd7,
title = "GRAIL: Scalable reachability index for large graphs",
abstract = "Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing time and space versus query time performance. However, the biggest limitation of existing methods is that they simply do not scale to very large real-world graphs. We present a very simple, but scalable reachability index, called GRAIL, that is based on the idea of randomized interval labeling, and that can effectively handle very large graphs. Based on an extensive set of experiments, we show that while more sophisticated methods work better on small graphs, GRAIL is the only index that can scale to millions of nodes and edges. GRAIL has linear indexing time and space, and the query time ranges from constant time to being linear in the graph order and size.",
author = "Hilmi Yildirim and Vineet Chaoji and Zaki, {Mohammed J.}",
year = "2010",
month = "9",
language = "English",
volume = "3",
pages = "276--284",
booktitle = "Proceedings of the VLDB Endowment",
edition = "1",

}

TY - CHAP

T1 - GRAIL

T2 - Scalable reachability index for large graphs

AU - Yildirim, Hilmi

AU - Chaoji, Vineet

AU - Zaki, Mohammed J.

PY - 2010/9

Y1 - 2010/9

N2 - Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing time and space versus query time performance. However, the biggest limitation of existing methods is that they simply do not scale to very large real-world graphs. We present a very simple, but scalable reachability index, called GRAIL, that is based on the idea of randomized interval labeling, and that can effectively handle very large graphs. Based on an extensive set of experiments, we show that while more sophisticated methods work better on small graphs, GRAIL is the only index that can scale to millions of nodes and edges. GRAIL has linear indexing time and space, and the query time ranges from constant time to being linear in the graph order and size.

AB - Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing time and space versus query time performance. However, the biggest limitation of existing methods is that they simply do not scale to very large real-world graphs. We present a very simple, but scalable reachability index, called GRAIL, that is based on the idea of randomized interval labeling, and that can effectively handle very large graphs. Based on an extensive set of experiments, we show that while more sophisticated methods work better on small graphs, GRAIL is the only index that can scale to millions of nodes and edges. GRAIL has linear indexing time and space, and the query time ranges from constant time to being linear in the graph order and size.

UR - http://www.scopus.com/inward/record.url?scp=79953233672&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79953233672&partnerID=8YFLogxK

M3 - Chapter

VL - 3

SP - 276

EP - 284

BT - Proceedings of the VLDB Endowment

ER -