"We already have clients using it with 100m record data bases," he said. "We can sort a million records in a minute; so if you sort a ten million record data base, it takes ten minutes."
(For non-programmers: No sort algorithm is linear. The best achievable is provably n.log(n). Solve for k: 1 = k.1M.log(1M) ; k = 7.23e-8 ; compute k.10M.log(10M), you get 11.66 minutes not 10)