%0 Journal Article
%T A Data-overlap-partitioning-based Parallel DBSCAN Algorithm<br>基于数据交叠分区的并行DBSCAN算法
%A SONG Ming
%A LIU Zong-tian
%A <br>宋明
%A 刘宗田
%J 计算机应用研究
%D 2004
%I 
%X As an outstanding representative of clustering algorithms,DBSCAN algorithm show good performance in spatial data clustering.However,for large spatial databases,original DBSCAN requires large volume of memory support and could incur substantial I/O costs.With the rapid development of high performance computer,especially appearance of the cluster computers give a means to overcome the defect of original DBSCAN algorithm.Experimental results show that the new algorithm is superior to the original DBSCAN in efficiency.
%K Massive Database
%K Clustering
%K Data-overlap-partition
%K DBSCAN Algorithm
%K Parallel Computing<br>大规模数据库
%K 聚类
%K 数据交叠分区
%K DBSCAN算法
%K 并行计算
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=C5938733AAEC0077&yid=D0E58B75BFD8E51C&vid=659D3B06EBF534A7&iid=DF92D298D3FF1E6E&sid=BCA2697F357F2001&eid=A04140E723CB732E&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=3&reference_num=10