Before revision:  In particular, we develop an online sketching algorithm that can compress N vectors into a tiny sketch consisting of small arrays of counters whose size scales as O(N ^{b\log^2{N}) } ) in O(N^{b+1} \log^3{N}) time} , where b < 1 depending on the stability of the near-neighbor search.
After revision:  In particular, we develop an online sketching algorithm that can compress N vectors into a tiny sketch consisting of small arrays of counters whose size scales as O(N ^{b\log^2{N}) } ) in O(N^{b+1} \log^3{N}) time} , where b < 1 when the query satisfies a data-dependent near-neighbor search.