Abstract
We study graph reduction to accelerate reachability queries answering. We propose a novel graph reduction approach, namely RCN reduction, to reduce the input graph <tex>$G$</tex> of <tex>$\vert V\vert$</tex> nodes into a smaller one with <tex>$\vert V^{r}\vert$</tex> nodes. Assume that the probability of a node of <tex>$G$</tex> to be a query node is <tex>$1/\vert V\vert$</tex>, we show that based on our approach, the lower bound probability that a query <tex>$q$</tex> can be answered in constant time is <tex>$1-(\frac{\vert V^{r}\vert}{\vert V\vert})^{2}$</tex>, denoting that the smaller the reduced graph, the larger the probability that <tex>$q$</tex> can be answered in constant time. We show the difficulties of RCN reduction and propose efficient algorithms to improve the reduction ratio. We confirm the benefits of our approach by rich experimental results using real datasets.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
