Dynamic Nearest Neighbor Queries in Euclidean Space
Given a query point q and a set D of data points, a nearest neighbor (NN) query returns the data point p in D that minimizes the distance DIST(q,p), where the distance function DIST(,) is the L2norm. One important variant of this query type is kNN query, which returns k data points with the minimum...
Saved in:
Main Authors: | NUTANONG, Sarana, ALI, Mohammed Eunus, TANIN, Egemen, MOURATIDIS, Kyriakos |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2017
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3217 https://ink.library.smu.edu.sg/context/sis_research/article/4219/viewcontent/GIS_DynamicNN_EncyclopediaGIS_2016.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Continuous Obstructed Nearest Neighbor Queries in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2009) -
Two ellipse-based pruning methods for group nearest neighbor queries
by: Li, H., et al.
Published: (2013) -
Finding all nearest neighbors with a single graph traversal
by: XU, Yixin, et al.
Published: (2018) -
Ranked Reverse Nearest Neighbor Search
by: LEE, Ken C. K., et al.
Published: (2008) -
Authenticated multistep nearest neighbor search
by: Papadopoulos, S., et al.
Published: (2013)