Mostrar el registro sencillo del ítem

dc.contributor.authorRoumelis, George
dc.contributor.authorVassilakopoulos, Michael
dc.contributor.authorCorral Liria, Antonio Leopoldo 
dc.contributor.authorManolopoulos, Yannis 
dc.date.accessioned2017-11-06T10:59:33Z
dc.date.available2017-11-06T10:59:33Z
dc.date.issued2017
dc.identifier.issn0164-1212
dc.identifier.urihttp://hdl.handle.net/10835/5259
dc.description.abstractProcessing 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 present new ones. We demonstrate through extensive experimental performance results (I/O efficiency and execution time), based on medium and large real and synthetic datasets, that the xBR + -tree is a big winner in execution time in all cases and a winner in I/O in most cases.es_ES
dc.language.isoeses_ES
dc.relationinfo:eu-repo/grantAgreement/ES/MINECO/TIN2013-41576-R/ES/Evolución de sistemas dinámicos en la nube: Un escenario marco hacia las interfaces de usuario inteligentes/ESDNEMIUIes_ES
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.sourceJournal of Systems and Software 132: 165-185, Elsevieres_ES
dc.titleEfficient query processing on large spatial databases A performance studyes_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses_ES
dc.identifier.doihttps://doi.org/10.1016/j.jss.2017.07.005es_ES
dc.relation.projectIDTIN2013-41576-Res_ES


Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como Attribution-NonCommercial-NoDerivatives 4.0 Internacional