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-10-31T07:51:50Z
dc.date.available2017-10-31T07:51:50Z
dc.date.issued2015
dc.identifier.isbn978-989-758-142-7
dc.identifier.urihttp://hdl.handle.net/10835/5214
dc.description.abstractOne of the most representative and studied queries in Spatial Databases is the (K) Nearest-Neighbor (NNQ), that discovers the (K) nearest neighbor(s) to a query point. An extension that is important for practical applications is the (K) Group Nearest Neighbor Query (GNNQ), that discovers the (K) nearest neighbor(s) to a group of query points (considering the sum of distances to all the members of the query group). This query has been studied during the recent years, considering data sets indexed by efficient spatial data structures. We study (K) GNNQs, considering non-indexed data sets, since this case is frequent in practical applications. And we present two (RAM-based) Plane Sweep algorithms, that apply optimizations emerging from the geometric properties of the problem. By extensive experimentation, using real and synthetic data sets, we highlight the most efficient algorithm.es_ES
dc.language.isoeses_ES
dc.publisherIEEE Presses_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.sourcest International Conference on Geographical Information Systems Theory, Applications and Management (GISTAM), Barcelona, 28-30 April, 2015es_ES
dc.titlePlane-Sweep Algorithms for the K Group Nearest-Neighbor Queryes_ES
dc.typeinfo:eu-repo/semantics/reportes_ES
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses_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