 Current state-of-the-art implementations either fail on the presented scale or are orders of magnitude slower than our system . FLASH is capable of computing an approximate k-NN graph, from scratch, over  full webspam dataset (1.3 billion nonzeros) in less than 10 seconds.
<clarity>  Current state-of-the-art implementations either fail on the presented scale or are orders of magnitude slower than our system . FLASH is capable of computing an approximate k-NN graph, from scratch, over  full webspam dataset (1.3 billion nonzeros) in less than 10 seconds.
 Current state-of-the-art implementations either fail on the presented scale or are orders of magnitude slower than FLASH . FLASH is capable of computing an approximate k-NN graph, from scratch, over full webspam dataset (1.3 billion nonzeros) in less than 10 seconds.