Learning to Hash Fast Query Speed o By using hash-code to construct index,we can achieve constant or sub-linear search time complexity. o In some cases,exhaustive search with linear time complexity is also acceptable because the distance calculation cost is low with binary representation. 日卡三4元，互Q0 Li (http://cs.nju.edu.cn/lwj) Big Leamning CS.NJU 13/115Learning to Hash Fast Query Speed By using hash-code to construct index, we can achieve constant or sub-linear search time complexity. In some cases, exhaustive search with linear time complexity is also acceptable because the distance calculation cost is low with binary representation. Li (http://cs.nju.edu.cn/lwj) Big Learning CS, NJU 13 / 115