Nearest neighbor queries in spatial database
In this thesis, we propose a k-Nearest Neighbor query processing algorithm that uses one or more window query to retrieve the nearest neighbors of a given query point. We also propose three different methods to estimate the ranges to be used by the window queries. Each range estimation method requir...
Saved in:
Main Author: | Liu, Danzhou. |
---|---|
Other Authors: | Lim, Ee Peng |
Format: | Theses and Dissertations |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/2366 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Similar Items
-
Nearest neighbour queries on commercial databases
by: Lin, Xinzhen.
Published: (2012) -
Aggregate Nearest Neighbor Queries in Spatial Databases
by: PAPADIAS, Dimitris, et al.
Published: (2005) -
Continuous Obstructed Nearest Neighbor Queries in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2009) -
On Efficient Mutual 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)