Graph indexing for reachability queries

Hilmi Yildirim, Mohammed J. Zaki

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

3 Citations (Scopus)

Abstract

Reachability queries appear very frequently in many important applications that work with graph structured data. In some of them, testing reachability between two nodes corresponds to an important problem. For example, in protein-protein interaction networks one can use it to answer whether two proteins are related, whereas in ontological databases such queries might correspond to the question of whether a concept subsumes another one. Given the huge databases that are often tested with reachability queries, it is important problem to come up with a scalable indexing scheme that has almost constant query time. In this paper, we bring a new dimension to the well-known interval labeling approach. Our approach labels each node with multiple intervals instead of a single interval so that each labeling represents a hyper-rectangle. Our new approach BOX can index dags in linear time and space while retaining the querying time admissible. In experiments, we show that BOX is not vulnerable to increasing edge to node ratios which is a problem for the existing approaches.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
Pages321-324
Number of pages4
DOIs
Publication statusPublished - 28 May 2010
Externally publishedYes
Event2010 IEEE 26th International Conference on Data Engineering Workshops, ICDEW 2010 - Long Beach, CA, United States
Duration: 1 Mar 20106 Mar 2010

Other

Other2010 IEEE 26th International Conference on Data Engineering Workshops, ICDEW 2010
CountryUnited States
CityLong Beach, CA
Period1/3/106/3/10

Fingerprint

Proteins
Labeling
Labels
Testing
Experiments

ASJC Scopus subject areas

  • Information Systems
  • Signal Processing
  • Software

Cite this

Yildirim, H., & Zaki, M. J. (2010). Graph indexing for reachability queries. In Proceedings - International Conference on Data Engineering (pp. 321-324). [5452724] https://doi.org/10.1109/ICDEW.2010.5452724

Graph indexing for reachability queries. / Yildirim, Hilmi; Zaki, Mohammed J.

Proceedings - International Conference on Data Engineering. 2010. p. 321-324 5452724.

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

Yildirim, H & Zaki, MJ 2010, Graph indexing for reachability queries. in Proceedings - International Conference on Data Engineering., 5452724, pp. 321-324, 2010 IEEE 26th International Conference on Data Engineering Workshops, ICDEW 2010, Long Beach, CA, United States, 1/3/10. https://doi.org/10.1109/ICDEW.2010.5452724
Yildirim H, Zaki MJ. Graph indexing for reachability queries. In Proceedings - International Conference on Data Engineering. 2010. p. 321-324. 5452724 https://doi.org/10.1109/ICDEW.2010.5452724
Yildirim, Hilmi ; Zaki, Mohammed J. / Graph indexing for reachability queries. Proceedings - International Conference on Data Engineering. 2010. pp. 321-324
@inproceedings{0c5f62d83d8749c89e1dd6cf91170fb4,
title = "Graph indexing for reachability queries",
abstract = "Reachability queries appear very frequently in many important applications that work with graph structured data. In some of them, testing reachability between two nodes corresponds to an important problem. For example, in protein-protein interaction networks one can use it to answer whether two proteins are related, whereas in ontological databases such queries might correspond to the question of whether a concept subsumes another one. Given the huge databases that are often tested with reachability queries, it is important problem to come up with a scalable indexing scheme that has almost constant query time. In this paper, we bring a new dimension to the well-known interval labeling approach. Our approach labels each node with multiple intervals instead of a single interval so that each labeling represents a hyper-rectangle. Our new approach BOX can index dags in linear time and space while retaining the querying time admissible. In experiments, we show that BOX is not vulnerable to increasing edge to node ratios which is a problem for the existing approaches.",
author = "Hilmi Yildirim and Zaki, {Mohammed J.}",
year = "2010",
month = "5",
day = "28",
doi = "10.1109/ICDEW.2010.5452724",
language = "English",
isbn = "9781424465217",
pages = "321--324",
booktitle = "Proceedings - International Conference on Data Engineering",

}

TY - GEN

T1 - Graph indexing for reachability queries

AU - Yildirim, Hilmi

AU - Zaki, Mohammed J.

PY - 2010/5/28

Y1 - 2010/5/28

N2 - Reachability queries appear very frequently in many important applications that work with graph structured data. In some of them, testing reachability between two nodes corresponds to an important problem. For example, in protein-protein interaction networks one can use it to answer whether two proteins are related, whereas in ontological databases such queries might correspond to the question of whether a concept subsumes another one. Given the huge databases that are often tested with reachability queries, it is important problem to come up with a scalable indexing scheme that has almost constant query time. In this paper, we bring a new dimension to the well-known interval labeling approach. Our approach labels each node with multiple intervals instead of a single interval so that each labeling represents a hyper-rectangle. Our new approach BOX can index dags in linear time and space while retaining the querying time admissible. In experiments, we show that BOX is not vulnerable to increasing edge to node ratios which is a problem for the existing approaches.

AB - Reachability queries appear very frequently in many important applications that work with graph structured data. In some of them, testing reachability between two nodes corresponds to an important problem. For example, in protein-protein interaction networks one can use it to answer whether two proteins are related, whereas in ontological databases such queries might correspond to the question of whether a concept subsumes another one. Given the huge databases that are often tested with reachability queries, it is important problem to come up with a scalable indexing scheme that has almost constant query time. In this paper, we bring a new dimension to the well-known interval labeling approach. Our approach labels each node with multiple intervals instead of a single interval so that each labeling represents a hyper-rectangle. Our new approach BOX can index dags in linear time and space while retaining the querying time admissible. In experiments, we show that BOX is not vulnerable to increasing edge to node ratios which is a problem for the existing approaches.

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

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

U2 - 10.1109/ICDEW.2010.5452724

DO - 10.1109/ICDEW.2010.5452724

M3 - Conference contribution

AN - SCOPUS:77952614023

SN - 9781424465217

SP - 321

EP - 324

BT - Proceedings - International Conference on Data Engineering

ER -