|
Author(s): |
Ben Wang, College of Computer Science and Technology,Zhejiang University of Technology,Hangzhou,China
Qingzhen Li, College of Computer Science and Technology,Zhejiang University of Technology,Hangzhou,China
Hong Huang, College of Computer Science and Technology,Zhejiang University of Technology,Hangzhou,China
Xiaoyu Mao, College of Computer Science and Technology,Zhejiang University of Technology,Hangzhou,China |
|
Abstract: |
Top-k query algorithms can quickly and accurately get the k query results without traversing all the records, so they have been widely used in multimedia data indexing areas. However, for most of the Top-k algorithms, the cost of query time increases rapidly when the dimensions of the data sets grow, and this defect confines the application of Top-k query algorithms in high dimensional data search and retrieval. In this paper, a new Top-k algorithm based on sorting table, which is called the Fast Threshold Decline Top-k Algorithm (FTDT), is proposed. Utilizing a fast threshold decline mechanism, FTDT reduces the updating and comparing time of the threshold quickly, and improves the query efficiency for the Top-k query as well.
|