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:
主要作者: | |
---|---|
其他作者: | |
格式: | Theses and Dissertations |
出版: |
2008
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/2366 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |