Group Nearest Neighbor Queries
Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, three users at locations q1 , q2 and q3 that want to find a meeting point (e.g., a restaurant); the corresponding query re...
Saved in:
Main Authors: | PAPADIAS, Dimitris, SHEN, Qiongmao, TAO, Yufei, MOURATIDIS, Kyriakos |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2004
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/882 https://ink.library.smu.edu.sg/context/sis_research/article/1881/viewcontent/ICDE04_GNN.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Continuous Nearest Neighbor Queries over Sliding Windows
by: MOURATIDIS, Kyriakos, et al.
Published: (2007) -
Aggregate Nearest Neighbor Queries in Spatial Databases
by: PAPADIAS, Dimitris, et al.
Published: (2005) -
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
by: MOURATIDIS, Kyriakos, et al.
Published: (2005) -
A Threshold-Based Algorithm for Continuous Monitoring of K Nearest Neighbors
by: MOURATIDIS, Kyriakos, et al.
Published: (2005) -
Visible Reverse K-Nearest Neighbor Queries
by: GAO, Yunjun, et al.
Published: (2009)