Aggregate Nearest Neighbor Queries in Spatial Databases
Given two spatial datasets P (e.g., facilities) and Q (queries), an aggregate nearest neighbor (ANN) query retrieves the point(s) of P with the smallest aggregate distance(s) to points in Q. Assuming, for example, n users at locations q1,...qn, an ANN query outputs the facility p belongs to P that m...
Saved in:
Main Authors: | PAPADIAS, Dimitris, TAO, Yufei, MOURATIDIS, Kyriakos, HUI, Chun Kit |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2005
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/175 https://ink.library.smu.edu.sg/context/sis_research/article/1174/viewcontent/TODS05_ANN.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Dynamic Nearest Neighbor Queries in Euclidean Space
by: NUTANONG, Sarana, et al.
Published: (2017) -
On Efficient Mutual Nearest Neighbor Query Processing in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2009) -
Algorithms for multi-point range query and reverse nearest neighbour search
by: NG HOONG KEE
Published: (2010) -
Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2009) -
Continuous Visible Nearest Neighbor Query Processing in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2011)