An Inclusion Rule for Vantage Point Tree Range Query Processing
Similarity search is a common computational task in many applications.Distance-based indexing techniques are proposed to enhance performance for similarity search in metric space.In this paper,we propose an enhanced search algorithm for Vantage Point Tree with an inclusion rule based on an upper bound on distances between the query item and objects in database.In a range search task,objects which satisfy the inclusion rule also satisfy the range query,which means we can return them as results without distance calculations.We obtain experimental results showing that our enhanced algorithm outperforms the algorithm without inclusion rule signi cantly when the query radius is large.
similarity search indexing metric space
Guohang Zeng Qiaozhi Li Huiming Jia Xingliang Li Yadi Cai Rui Mao
Guangdong Key Laboratory of Popular High Performance Computers Shenzhen Key Laboratory of Service Computing and Applications College of Computer Science and Software Engineering Shenzhen University Shenzhen,Guangdong 518060,China
国际会议
南昌
英文
1-7
2013-09-26（万方平台首次上网日期，不代表论文的发表时间）