Finding k-NN (Simple Approach)for i in 1..m { p = Ci(vq) lookup (i,p) in Index fetch (i,p',j) while p' "close to" p on curve i { collect next (i,p',j) as candidate } } for each candidate j { lookup j in Db fetch (j,vj) d = D(vj , vq) include j in k-NN if d small enough } Cost = 2Topen + mTsel + NfTP + NfTD where
|