Reachability queries in very large graphs

A fast refined online search approach

Renê R. Veloso, Loïc Cerf, Wagner Meira, Mohammed J. Zaki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

24 Citations (Scopus)

Abstract

A key problem in many graph-based applications is the need to know, given a directed graph G and two vertices u, v ∈ G, whether there is a path between u and v, i. e., if u reaches v. This problem is particularly challenging in the case of very large real-world graphs. A common approach is the preprocessing of the graphs, in order to produce an efficient index structure, which allows fast access to the reachability information of the vertices. However, the majority of existing methods can not handle very large graphs. We propose, in this paper, a novel indexing method called FELINE (Fast rEfined onLINE search), which is inspired by Dominance Graph Drawing. FELINE creates an index from the graph representation in a two-dimensional plane, which provides reachability information in constant time for a significant portion of queries. Experiments demonstrate the efficiency of FELINE compared to state-of-the-art approaches.

Original languageEnglish
Title of host publicationAdvances in Database Technology - EDBT 2014: 17th International Conference on Extending Database Technology, Proceedings
PublisherOpenProceedings.org, University of Konstanz, University Library
Pages511-522
Number of pages12
ISBN (Electronic)9783893180653
DOIs
Publication statusPublished - 2014
Event17th International Conference on Extending Database Technology, EDBT 2014 - Athens, Greece
Duration: 24 Mar 201428 Mar 2014

Other

Other17th International Conference on Extending Database Technology, EDBT 2014
CountryGreece
CityAthens
Period24/3/1428/3/14

Fingerprint

Directed graphs
Experiments

Keywords

  • Graph indexing
  • Online search
  • Reachability queries

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Software

Cite this

Veloso, R. R., Cerf, L., Meira, W., & Zaki, M. J. (2014). Reachability queries in very large graphs: A fast refined online search approach. In Advances in Database Technology - EDBT 2014: 17th International Conference on Extending Database Technology, Proceedings (pp. 511-522). OpenProceedings.org, University of Konstanz, University Library. https://doi.org/10.5441/002/edbt.2014.46

Reachability queries in very large graphs : A fast refined online search approach. / Veloso, Renê R.; Cerf, Loïc; Meira, Wagner; Zaki, Mohammed J.

Advances in Database Technology - EDBT 2014: 17th International Conference on Extending Database Technology, Proceedings. OpenProceedings.org, University of Konstanz, University Library, 2014. p. 511-522.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Veloso, RR, Cerf, L, Meira, W & Zaki, MJ 2014, Reachability queries in very large graphs: A fast refined online search approach. in Advances in Database Technology - EDBT 2014: 17th International Conference on Extending Database Technology, Proceedings. OpenProceedings.org, University of Konstanz, University Library, pp. 511-522, 17th International Conference on Extending Database Technology, EDBT 2014, Athens, Greece, 24/3/14. https://doi.org/10.5441/002/edbt.2014.46
Veloso RR, Cerf L, Meira W, Zaki MJ. Reachability queries in very large graphs: A fast refined online search approach. In Advances in Database Technology - EDBT 2014: 17th International Conference on Extending Database Technology, Proceedings. OpenProceedings.org, University of Konstanz, University Library. 2014. p. 511-522 https://doi.org/10.5441/002/edbt.2014.46
Veloso, Renê R. ; Cerf, Loïc ; Meira, Wagner ; Zaki, Mohammed J. / Reachability queries in very large graphs : A fast refined online search approach. Advances in Database Technology - EDBT 2014: 17th International Conference on Extending Database Technology, Proceedings. OpenProceedings.org, University of Konstanz, University Library, 2014. pp. 511-522
@inproceedings{754b09c7d56b44fa91b704bfaae477af,
title = "Reachability queries in very large graphs: A fast refined online search approach",
abstract = "A key problem in many graph-based applications is the need to know, given a directed graph G and two vertices u, v ∈ G, whether there is a path between u and v, i. e., if u reaches v. This problem is particularly challenging in the case of very large real-world graphs. A common approach is the preprocessing of the graphs, in order to produce an efficient index structure, which allows fast access to the reachability information of the vertices. However, the majority of existing methods can not handle very large graphs. We propose, in this paper, a novel indexing method called FELINE (Fast rEfined onLINE search), which is inspired by Dominance Graph Drawing. FELINE creates an index from the graph representation in a two-dimensional plane, which provides reachability information in constant time for a significant portion of queries. Experiments demonstrate the efficiency of FELINE compared to state-of-the-art approaches.",
keywords = "Graph indexing, Online search, Reachability queries",
author = "Veloso, {Ren{\^e} R.} and Lo{\"i}c Cerf and Wagner Meira and Zaki, {Mohammed J.}",
year = "2014",
doi = "10.5441/002/edbt.2014.46",
language = "English",
pages = "511--522",
booktitle = "Advances in Database Technology - EDBT 2014: 17th International Conference on Extending Database Technology, Proceedings",
publisher = "OpenProceedings.org, University of Konstanz, University Library",

}

TY - GEN

T1 - Reachability queries in very large graphs

T2 - A fast refined online search approach

AU - Veloso, Renê R.

AU - Cerf, Loïc

AU - Meira, Wagner

AU - Zaki, Mohammed J.

PY - 2014

Y1 - 2014

N2 - A key problem in many graph-based applications is the need to know, given a directed graph G and two vertices u, v ∈ G, whether there is a path between u and v, i. e., if u reaches v. This problem is particularly challenging in the case of very large real-world graphs. A common approach is the preprocessing of the graphs, in order to produce an efficient index structure, which allows fast access to the reachability information of the vertices. However, the majority of existing methods can not handle very large graphs. We propose, in this paper, a novel indexing method called FELINE (Fast rEfined onLINE search), which is inspired by Dominance Graph Drawing. FELINE creates an index from the graph representation in a two-dimensional plane, which provides reachability information in constant time for a significant portion of queries. Experiments demonstrate the efficiency of FELINE compared to state-of-the-art approaches.

AB - A key problem in many graph-based applications is the need to know, given a directed graph G and two vertices u, v ∈ G, whether there is a path between u and v, i. e., if u reaches v. This problem is particularly challenging in the case of very large real-world graphs. A common approach is the preprocessing of the graphs, in order to produce an efficient index structure, which allows fast access to the reachability information of the vertices. However, the majority of existing methods can not handle very large graphs. We propose, in this paper, a novel indexing method called FELINE (Fast rEfined onLINE search), which is inspired by Dominance Graph Drawing. FELINE creates an index from the graph representation in a two-dimensional plane, which provides reachability information in constant time for a significant portion of queries. Experiments demonstrate the efficiency of FELINE compared to state-of-the-art approaches.

KW - Graph indexing

KW - Online search

KW - Reachability queries

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

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

U2 - 10.5441/002/edbt.2014.46

DO - 10.5441/002/edbt.2014.46

M3 - Conference contribution

SP - 511

EP - 522

BT - Advances in Database Technology - EDBT 2014: 17th International Conference on Extending Database Technology, Proceedings

PB - OpenProceedings.org, University of Konstanz, University Library

ER -