Spatial Join Queries Based on QR-Tree

Abstract:

Article Preview

Spatial join query is a most important query in the spatial database.How to improve the efficiency of a spatial join is a serious question.In this paper,we propose a new algorithm to process spatial join problem.The algorithm is based on the QR-tree,which combines the good property of the R-tree and quadtree.By dividing the space into several subspaces,the algorithm implement the spatial join query on the small R-tree.We compare the algorithm with the R-tree join algorithm of Brinkhoff. Experiments demonstrate the proposed algorithms have high query efficiency.

Info:

Periodical:

Edited by:

Yanwen Wu

Pages:

752-757

DOI:

10.4028/www.scientific.net/AMR.187.752

Citation:

Z. X. Yang and Z. X. Hao, "Spatial Join Queries Based on QR-Tree", Advanced Materials Research, Vol. 187, pp. 752-757, 2011

Online since:

February 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.