FERRARI: Flexible and efficient reachability range assignment for graph indexing
Citations
208 citations
108 citations
Cites methods from "FERRARI: Flexible and efficient rea..."
...Representative works include GRAIL [26], FERRARI [21], and IP+ [25]....
[...]
99 citations
Cites background from "FERRARI: Flexible and efficient rea..."
...We are also aware of a recent work [22] that trades off query performance for reduced index size and indexing cost....
[...]
85 citations
Cites background or methods from "FERRARI: Flexible and efficient rea..."
...and patents are from [8, 17], while GovWild, Yago2, Twitter, and Web-UK are used in [25]....
[...]
...Methods based on transitive closure retrieval [3, 7, 8, 10, 14, 19, 25, 28, 29] pre-compute and compress the transitive closures of each vertex in G....
[...]
74 citations
Cites background or methods from "FERRARI: Flexible and efficient rea..."
...propose Ferrari [24]....
[...]
...Such approaches include Tree+SSPI [7], GRIPP [26], GRAIL [29], and Ferrari [24]....
[...]
...The reachability query has been extensively studied over a decade [1, 16, 13, 23, 11, 28, 7, 26, 12, 8, 21, 20, 29, 27, 9, 10, 19, 24, 31], and the early work can be traced back to 1989 to compute transitive closure (TC) over a graph....
[...]
...We test Ferrari using the Ferrari-G index given in [24], because Ferrari-G is scalable to handle massive-scale graphs....
[...]
...GRAIL [29] O(k) or O(n+m)O(kn) O(k(n+m)) Ferrari [24] O(k) or O(n+m)O((k + s)n)O(k2m+ S) IP+ (ours) O(k) or O(knr2) O((k + h)n)O((k + h)(m+ n))...
[...]
References
8,285 citations
3,041 citations
1,186 citations
531 citations
512 citations