%0 Journal Article
%T Nearest-neighbor Query Algorithm Based on Grid Partition of Space-filling Curve<br>基于空间填充曲线网格划分的最近邻查询算法
%A XU Hong-bo
%A HAO Zhong-xiao
%A <br>徐红波
%A 郝忠孝
%J 计算机科学
%D 2010
%I 
%X As the overlap between minimum bounding rectangles in the directory of R-tree is increasing very rapidly with growing number of the data,the performance of the nearest-neighbor query algorithm based on R-tree deteriorates rapidly.To avoid the problem,the paper presented a nearest-neighbor query algorithm based on grid partition of space-filling curve.Space-filling curve has the properties of dimension reduction and data clustering.Using space-filling curve,the algorithm divides 2D space into equal-size grid...
%K Nearest neighbors
%K Grid
%K Space-filling curve
%K Reduction of dimensionality<br>空间填充曲线
%K 网格划分
%K 最近邻
%K 降维
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=048D08388CA81DD109C50B7460DCC045&yid=140ECF96957D60B2&vid=42425781F0B1C26E&iid=CA4FD0336C81A37A&sid=798FBE8DE1A255B1&eid=847B14427F4BF76A&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=7