Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

RP
2010
Springer

favoriteEmaildiscussreport

163views Control Systems» more RP 2010»

Efficient Graph Reachability Query Answering Using Tree Decomposition

13 years 2 months ago

Efficient Graph Reachability Query Answering Using Tree Decomposition

Download www.informatik.uni-freiburg.de

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.

Fang Wei

Real-time Traffic

Control Systems | Efficient Reachability Query | Large Directed Graphs | RP 2010 | XML Data Processing |

claim paper

Related Content

» Dual Labeling Answering Graph Reachability Queries in Constant Time

» An Efficient Algorithm for Solving the DyckCFL Reachability Problem on Trees

» EventBased Decompositions for Reasoning about External Change in Planners

» ClosureTree An Index Structure for Graph Queries

» Efficient data structures for rangeaggregate queries on trees

» 3HOP a highcompression indexing scheme for reachability query

» An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics

» Topk Exploration of Query Candidates for Efficient Keyword Search on GraphShaped RDF Data

» Keyword Searching and Browsing in Databases using BANKS

Post Info
More Details (n/a)

Added	14 Feb 2011
Updated	14 Feb 2011
Type	Journal
Year	2010
Where	RP
Authors	Fang Wei

Comments (0)