earticle

영어

Due to the mass track data accumulated day by day, new challenges are raised for traditional information retrieval. This paper studies the issue of k-nearest neighbor track retrieval facing moving object, and converts this issue into aggregate Top-k query issue of information retrieval field. A parallel TA algorithm in random access database is proposed, and it has effectively solved the issue of k-nearest neighbor track retrieval. Performance of this algorithm is verified through a large number of experiments.