Fast reachability query processing

Jiefeng Cheng, Jeffrey Xu Yu, Nan Tang

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

6 Citations (Scopus)

Abstract

Graph has great expressive power to describe the complex relationships among data objects, and there are large graph datasets available. In this paper, we focus ourselves on processing a primitive graph query. We call it reachability query. The reachability query, denoted A D, is to find all elements of a type D that are reachable from some elements in another type A. The problem is challenging because the existing structural join algorithms, studied in XML query processing, cannot be directly applied to it, because those techniques make use of the tree-structure heavily. We propose a novel approach which can process reachability queries on the fly while keeping the space consumption small that is needed to keep the required information for processing reachability queries. In brief, our approach is based on 2-hop labeling for a directed graph G which consumes O(|V| · log |E|) space. We construct a novel join-index which is built on a small table and B+-tree. With the join-index, the high efficiency is achieved. We conducted extensive experimental studies, and we confirm that our approach can efficiently process reachability queries over a graph or a tree.

Original languageEnglish
Title of host publicationDatabase Systems for Advanced Applications - 11th International Conference, DASFAA 2006, Proceedings
Pages674-688
Number of pages15
DOIs
Publication statusPublished - 7 Jul 2006
Externally publishedYes
Event11th International Conference on Database Systems for Advanced Applications, DASFAA 2006 - Singapore, Singapore
Duration: 12 Apr 200615 Apr 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3882 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Conference on Database Systems for Advanced Applications, DASFAA 2006
CountrySingapore
CitySingapore
Period12/4/0615/4/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Fast reachability query processing'. Together they form a unique fingerprint.

  • Cite this

    Cheng, J., Yu, J. X., & Tang, N. (2006). Fast reachability query processing. In Database Systems for Advanced Applications - 11th International Conference, DASFAA 2006, Proceedings (pp. 674-688). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3882 LNCS). https://doi.org/10.1007/11733836_47