Efficient Graph Reachability Query Answering Using Tree Decomposition

  • Fang Wei
Conference paper

DOI: 10.1007/978-3-642-15349-5_13

Volume 6227 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Wei F. (2010) Efficient Graph Reachability Query Answering Using Tree Decomposition. In: Kučera A., Potapov I. (eds) Reachability Problems. RP 2010. Lecture Notes in Computer Science, vol 6227. Springer, Berlin, Heidelberg

Abstract

Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data processing, ontology reasoning and bioinformatics.

In this paper, we present a novel indexing method based on the concept of tree decomposition. We show analytically that this intuitive approach is both time and space efficient. We demonstrate empirically the efficiency and the effectiveness of our method.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Fang Wei
    • 1
  1. 1.Computer Science DepartmentUniversity of FreiburgGermany