Efficient graph reachability query answering using tree decomposition

Authors:
Fang Wei
Affiliations:
Computer Science Department, University of Freiburg, Germany
Venue:
RP'10 Proceedings of the 4th international conference on Reachability problems
Year:
2010

Citing 13
Cited 1

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Efficient management of transitive relationships in large data and knowledge bases

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A linear time algorithm for finding tree-decompositions of small treewidth

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On supporting containment queries in relational database management systems

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Reachability and Distance Queries via 2-Hop Labels

SIAM Journal on Computing
Efficient Creation and Incremental Maintenance of the HOPI Index for Complex XML Document Collections

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Dual Labeling: Answering Graph Reachability Queries in Constant Time

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Tractable database design through bounded treewidth

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fast and practical indexing and querying of very large graphs

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficiently answering reachability queries on very large directed graphs

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
3-HOP: a high-compression indexing scheme for reachability query

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Unifying tree decompositions for reasoning in graphical models

Artificial Intelligence
TEDI: efficient shortest path query answering on graphs

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data

Probabilistic pattern queries over complex probabilistic graphs

Proceedings of the 2012 Joint EDBT/ICDT Workshops

Quantified Score

Hi-index	0.00

Visualization

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.