loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: George Roumelis 1 ; Michael Vassilakopoulos 2 ; Antonio Corral 3 and Yannis Manolopoulos 1

Affiliations: 1 Aristotle University, Greece ; 2 University of Thessaly, Greece ; 3 University of Almeria, Spain

ISBN: 978-989-758-099-4

Keyword(s): Spatial Query Processing, Plane-Sweep, Group Nearest-Neighbor Query, Algorithms.

Related Ontology Subjects/Areas/Topics: Computational Geometry ; Computer Vision, Visualization and Computer Graphics ; Data Engineering ; Databases and Data Security ; Image Formation and Preprocessing ; Query Processing and Optimization

Abstract: One 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.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.81.29.226

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Roumelis, G.; Vassilakopoulos, M.; Corral, A. and Manolopoulos, Y. (2015). Plane-Sweep Algorithms for the K Group Nearest-Neighbor Query.In Proceedings of the 1st International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM, ISBN 978-989-758-099-4, pages 83-93. DOI: 10.5220/0005375300830093

@conference{gistam15,
author={George Roumelis. and Michael Vassilakopoulos. and Antonio Corral. and Yannis Manolopoulos.},
title={Plane-Sweep Algorithms for the K Group Nearest-Neighbor Query},
booktitle={Proceedings of the 1st International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM,},
year={2015},
pages={83-93},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005375300830093},
isbn={978-989-758-099-4},
}

TY - CONF

JO - Proceedings of the 1st International Conference on Geographical Information Systems Theory, Applications and Management - Volume 1: GISTAM,
TI - Plane-Sweep Algorithms for the K Group Nearest-Neighbor Query
SN - 978-989-758-099-4
AU - Roumelis, G.
AU - Vassilakopoulos, M.
AU - Corral, A.
AU - Manolopoulos, Y.
PY - 2015
SP - 83
EP - 93
DO - 10.5220/0005375300830093

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.