An Efficient Algorithm for Bulk-Loading xBR+ -trees
Identificadores
URI: http://hdl.handle.net/10835/5258
ISSN: 0920-5489
DOI: https://doi.org/10.1016/j.csi.2017.05.003
ISSN: 0920-5489
DOI: https://doi.org/10.1016/j.csi.2017.05.003
Compartir
Metadatos
Mostrar el registro completo del ítemAutor
Roumelis, George; Vassilakopoulos, Michael; Corral Liria, Antonio Leopoldo; Manolopoulos, YannisFecha
2017Resumen
A major part of the interface to a database is made up of the queries that can be addressed to this database and answered (processed) in an efficient way, contributing to the quality of the developed software. Efficiently processed spatial queries constitute a fundamental part of the interface to spatial databases due to the wide area of applications that may address such queries, like geographical information systems (GIS), location-based services, computer visualization, automated mapping, facilities management, etc. Another important capability of the interface to a spatial database is to offer the creation of efficient index structures to speed up spatial query processing. The xBR + -tree is a balanced disk-resident quadtree-based index structure for point data, which is very efficient for processing such queries. Bulk-loading refers to the process of creating an index from scratch, when the dataset to be indexed is available beforehand, instead of creating the index gradually (and...