FERRARI Flexible and Efficient Reachability Range Assignment for Graph Indexin

FERRARI: Flexible and Efficient Reachability Range Assignment for Graph IndexingStephan Seufert1, Avishek Anand1, Srikanta Bedathur2, Gerhard Weikum11Max Planck Institute for Informatics, Germany {sseufert,aanand,weikum}@mpi-inf.mpg.de2IIIT Delhi, India bedathur@iiitd.ac.inAbstract—In this paper, we propose a scalable and highly efficient index structure for the reachability problem over graphs. We build on the well-known node interval labeling scheme where the set of vertices reachable from a p