Efficient query processing on large spatial databases A performance study
Identifiers
URI: http://hdl.handle.net/10835/5259
ISSN: 0164-1212
DOI: https://doi.org/10.1016/j.jss.2017.07.005
ISSN: 0164-1212
DOI: https://doi.org/10.1016/j.jss.2017.07.005
Share
Metadata
Show full item recordAuthor/s
Roumelis, George; Vassilakopoulos, Michael; Corral Liria, Antonio Leopoldo; Manolopoulos, YannisDate
2017Abstract
Processing of spatial queries has been studied extensively in the literature. In most cases, it is accomplished by indexing spatial data using spatial access methods. Spatial indexes, such as those based on the Quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints and objects. In this paper, we study a recent balanced disk-based index structure for point data, called xBR + -tree, that belongs to the Quadtree family and hierarchically decomposes space in a regular manner. For the most common spatial queries, like Point Location, Window, Distance Range, Nearest Neighbor and Distance-based Join, the R-tree family is a very popular choice of spatial index, due to its excellent query performance. For this reason, we compare the performance of the xBR + -tree with respect to the R ∗ -tree and the R + -tree for tree building and processing the most studied spatial queries. To perform this comparison, we utilize existing algorithms and pr...