X*tree index structure for k nearest neighbor queries
Zhongping Zhang · Computer Engineering and Applications Journal · 2011
By analyzing the inefficiency of k nearest neighbor query in existing index structures,this paper presents X*tree index structure which is suitable to perform k nearest neighbor query.A new node splitting algorithm is adopted,and the Split History field is omitted.The experiment shows that it has better performance than X*tree in time and space complexity,and it is more suitable to k nearest neighbor query.