FERRARI: Flexible and efficient reachability range assignment for graph indexing
Authors:
- 1 April 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 1009-1020
Abstract
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 particular node is compactly encoded as a collection of node identifier ranges. We impose an explicit bound on the size of the index and flexibly assign approximate reachability ranges to nodes of the graph such that the number of index probes to answer a query is minimized. The resulting tunable index structure generates a better range labeling if the space budget is increased, thus providing a direct control over the trade off between index size and the query processing performance. By using a fast recursive querying method in conjunction with our index structure, we show that, in practice, reachability queries can be answered in the order of microseconds on an off-the-shelf computer - even for the case of massive-scale real world graphs. Our claims are supported by an extensive set of experimental results using a multitude of benchmark and real-world web-scale graph datasets.Keywords
This publication has 16 references indexed in Scilit:
- GRAIL: a scalable index for reachability queries in very large graphsThe VLDB Journal, 2011
- A memory efficient reachability data structure through bit vector compression2011
- Path-treeACM Transactions on Database Systems, 2011
- GRAILProceedings of the VLDB Endowment, 2010
- Graph Reachability Queries: A Survey2010
- 3-HOP2009
- A large time-aware web graphACM SIGIR Forum, 2008
- Efficiently answering reachability queries on very large directed graphs2008
- Dual Labeling: Answering Graph Reachability Queries in Constant Time2006
- ANF2002