Hao Zhong-xiao
Abstract
Spatial joins are one of the most important operations in spatial database.In this paper,we first introduce the structure of R-trees. Then presents an efficient cost model for spatial joins using R-trees to achieve the goal of spatial query optimazation.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Spatial joins are one of the most important operations in spatial database.In this paper,we first introduce the structure of R-trees. Then presents an efficient cost model for spatial joins using R-trees to achieve the goal of spatial query optimazation.
Key concepts: Joins, Spatial query, Computer science, Spatial database, Spatial analysis, Data mining, Database, Theoretical computer science