A Reachability Query Approach with Path Interval Labeling

For a directed graph and two vertices, to check whether there is a path between them is so-called reach ability query, how to establish efficient index to answer the reach ability of two nodes has always been a research direction in the field of database. In this paper, we proposed a reachability query approach combining the concept of path dividing and interval labeling. We establish an index with path interval labeling, also two kinds of query strategies are presented. And experimental results on real data sets show that with a path interval labeling it has a better time efficiency of querying.