法拉利图可达性指数

Introduction FERRARI is a reachability index for directed graphs, answering queries of the form "Is node v reachable from node u?". This project contains the source code and datasets used for the experimental evaluation in the publications listed below [1,2]. References Stephan Seufert, Avishek Anand, Srikanta Bedathur, and Gerhard Weikum. FERRARI: Flexible and Efficient Reachability Range Assignment for Graph Indexing. Proceedings of the 29th IEEE International Conference on Data Engineering. Brisbane, Australia, April 8-12, 2013. Stephan Seufert, Avishek Anand, Srikanta Bedathur, and Gerhard Weikum. High-Performance Reachability Query Processing under Index Size Restrictions. CoRR arXiv:1211.3375 [cs.DB], 2012.

ferrari.cpp
Graph.cpp
include
IntervalList.h
Timer.h
Index.h
Graph.h
Index.cpp
IntervalList.cpp
Makefile
Timer.cpp