Nearest neighbor queries in spatial database

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...

Full description

Saved in:
Bibliographic Details
Main Author: Liu, Danzhou.
Other Authors: Lim, Ee Peng
Format: Theses and Dissertations
Published: 2008
Subjects:
DRNTU::Engineering::Computer science and engineering::Information systems::Information storage and retrieval
Online Access:http://hdl.handle.net/10356/2366
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Description
Summary: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 requires different statistical knowledge about the spatial database.

Similar Items