һ�ֶ�·�ռ�������Ӳ�ѯ���?��

ժҪ
ͼ/��
�ο��
�� (15)

ȫ��: PDF (589 KB) HTML (0 KB)
��: BibTeX | EndNote (RIS)

ժҪ Ϊ�˽��·�ռ��Ӳ�ѯ��⣬��һ�ֻ��R��ķ��ݹ��㷨��㷨��ȵݹ��ԣ�ͬ��n��ռ��ݼ��Ӧ��R��㷨��ʱ��ͬʱ��K��̵�nԪ�顣��Ҳ��û��ھ��ƽ��ɨ�輼��Ը��㷨��Ż��Ч��ٴ��̷��ʴ��CPU��Ӧʱ�䡣��ͨ��ʵ��֤��㷨��Ч�ԡ�

	��

	�ѱ��Ƽ��
	��ҵ��
	��ù��
	E-mail Alert
	RSS
	��
	��4
	�ź�

�ؼ�� �� ƽ��ɨ�輼��, �ռ��ݿ�, ��·�ռ��Ӳ�ѯ, R��

Abstract��A recursive non-incremental algorithm following a depth-first search was presented for solving multi-way spatial distance join query, which found the K n-tuples for the smallest distance value from n spatial datasets, where each dataset was stored in an R-tree. The user can not have any result until the algorithm ends. The algorithm adopts distance-based plane-sweep technique as optimization technique to effectively reduce disk accesses and CPU response time. Finally, efficiency of the algorithm is validated by experiment.

Key words�� distance-based plane-sweep technique spatial databases multi-way spatial distance join query R-tree

�ո��: 2007-07-20

ͨѶ��: ��4 E-mail: liangyinq86@163.com

��ñ��:

��4 �ź�. һ�ֶ�·�ռ��Ӳ�ѯ��?��[J]. ��Ӧ��, 2008, 28(1): 155-158. . Method for multi-way spatial distance join query processing. Journal of Computer Applications, 2008, 28(1): 155-158.

��ӱ��:

http://www.joca.cn/CN/ �� http://www.joca.cn/CN/Y2008/V28/I1/155