Spatial Join Queries Based on QR-Tree

Ze Xue Yang; Zhong Xiao Hao

doi:10.4028/www.scientific.net/AMR.187.752

Paper Titles

Improvement and Optimization of HITS in Web Mining
p.728

The Application of Fuzzy-Based Internet of Things in Household Security
p.735

Research and Design of Digital Clock Based on FPGA
p.741

Research on MAC Layer Supporting MESH Model in IEEE 802.16
p.746

Spatial Join Queries Based on QR-Tree
p.752

Application and Research of Virtual Prototype Technology for Wood Powder Disintegrator Used in Fuel
p.758

Study on the Application of COM Method in Motor Imagine
p.762

Research on Status and Problems of Environment of Mountain’s Lake Tourism Attractions in Xinjiang
p.767

Research on Status and Problems of Tourism E-Commerce in Xinjiang
p.771

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 187Spatial Join Queries Based on QR-Tree

Spatial Join Queries Based on QR-Tree

Abstract:

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.

You might also be interested in these eBooks

Sport Materials, Modelling and Simulation

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 187)

Pages:

752-757

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.187.752

Citation:

Cite this paper

Online since:

February 2011

Authors:

Ze Xue Yang, Zhong Xiao Hao

Keywords:

QR-Tree, Quadtree, R-Tree, Spatial Database, Spatial Join Query

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] BRINKHOFF T., KRIEGEL,H. -P., and SEEGER B. Efficient processing of spatial joins using R-trees. In Proceedings of the ACM SIGMOD Conference. 1993: 237-246.

DOI: 10.1145/170036.170075

Google Scholar

[2] HUANG Y. -W., JING N., and RUNDENSTEINER,E.A. Spatial joins using R-trees: Breadth-First traversal with global optimizations. In Proceedings of the 23rd International Conference on Very Large Data Bases(VLDB). 1997: 396-405.

Google Scholar

[3] BRINKHOFF T., KRIEGEL,H. -P., and SEEGER,B. Parallel processing of spatial joins using R-trees. In Proceedings of the 12th International Conference on Data Engineering. 1996: 258-265.

DOI: 10.1109/icde.1996.492114

Google Scholar

[4] HOEL,E.G. AND SAMET,H. Benchmarking spatial join operations with spatial output. In Proceedings of the 21st International Conference on Very Large Data Bases(VLDB). 1995: 606–618.

Google Scholar

[5] JACOX E, SAMET H. Spatial join techniques. ACM Transactions on Database Systems. 32(1), (2007).

DOI: 10.1145/1206049.1206056

Google Scholar

[6] LO M. -L. and RAVISHANKAR, C.V. Spatial joins using seeded trees. In Proceedings of the ACM SIGMOD Conference. 1994: 209-220.

DOI: 10.1145/191843.191881

Google Scholar

[7] PATEL J.M. and DEWITT D. J. Partition based spatial-merge join. In Proceedings of the ACM SIGMOD Conference. 1996: 259-270.

DOI: 10.1145/235968.233338

Google Scholar

[8] DITTRICH J. -P. and SEEGER, B. Data redundancy and duplicate detection in spatial join processing. In Proceedings of the 16th IEEE International Conference on Data Engineering. 2000: 535-546.

DOI: 10.1109/icde.2000.839452

Google Scholar

[9] YU-CHEN FU, ZHI-YONG HU, WEI GUO, DONG-RU ZHOU. QR-tree: a hybrid spatial index structure. In Proceedings of the Second International Conference on Machine Learning and Cybernetics. 2003: 459-463.

DOI: 10.1109/icmlc.2003.1264521

Google Scholar