%0 Journal Article
%T Core Algorithm of High-dimensional Main Memory kNN-Join Index Structure<br>高维主存kNN连接索引结构的核心算法
%A LIU Yan
%A HAO Zhong-xiao
%A <br>刘艳
%A 郝忠孝
%J 计算机科学
%D 2011
%I 
%X kNN-Join is an important but costly primitive operation of high-dimensional databases. As RAM gets cheaper and larger,more and more datasets can fit into the main memory,how to realize the kNN-Join efficiently brings people's interests. 4-trecR and 4-trecS were designed especially for main-memory kNN-Join according to the properties of it.The core algorithms and relevant certificates of building them were presented combining with coding and node center coincidence technologies. Experiments show that the algorithrr}p-tree-kNN-Join based on p-tree-R and p-tree-S is superior to the existing kNN-Join algorithm of Gorder that can be used in main memory.
%K kNN-Join
%K High-dimensional space
%K Main-memory
%K Index structure
%K kNN search<br>kNN连接，高维空间，主存，索引结构，kNN搜索
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=A72829DDE955E0D24D4A31CD2FFCA9EA&yid=9377ED8094509821&vid=16D8618C6164A3ED&iid=9CF7A0430CBB2DFD&sid=A020552C37306588&eid=EB552E4CFC85690B&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=0