Abstract

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. 1

Citations

267	Complexity of finding embeddings in a k-tree - Arnborg, Corneil, et al. - 1987
187	On supporting containment queries in relational database management systems - Zhang, Naughton, et al. - 2001
175	A linear time algorithm for finding treedecompositions of small treewidth - Bodlaender - 1996
167	A tourist guide through treewidth - Bodlaender - 1993
85	H.V.: Efficient management of transitive relationships in large data and knowledge bases - Agrawal, Borgida, et al. - 1989
66	Graph minors. III. Planar tree-width - Robertson, Seymour - 1984
51	Reachability and distance queries via 2-hop labels - Cohen, Halperin, et al.
34	Treewidth: Computational experiments - Koster, Bodlaender, et al. - 2001
28	Fast and practical indexing and querying of very large graphs - Trißl, Leser - 2007
23	Hopi: An efficient connection index for complex xml document collections - Schenkel, Theobald, et al. - 2004
18	Dual labeling: Answering graph reachability queries in constant time - Wang, He, et al. - 2006
15	Efficient creation and incremental maintenance of the hopi index for complex xml document collections - Schenkel, Theobald, et al. - 2005
13	3-hop: a high-compression indexing scheme for reachability query - Jin, Xiang, et al. - 2009
12	Unifying tree decomposition for reasoning in graphical models - Kask, Dechter, et al.
8	Efficiently answering reachability queries on very large directed graphs - Jin, Xiang, et al.
6	Tedi: efficient shortest path query answering on graphs - Wei - 2010
4	den Eijkhof, Preprocessing rules for triangulation of probabilistic networks - Bodlaender, Koster, et al. - 2005
3	Tractable database design through bounded treewidth - Gottlob, Pichler, et al. - 2006