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
id sg-ntu-dr.10356-2366
record_format dspace
spelling sg-ntu-dr.10356-23662023-03-04T00:32:15Z Nearest neighbor queries in spatial database Liu, Danzhou. Lim, Ee Peng School of Computer Engineering DRNTU::Engineering::Computer science and engineering::Information systems::Information storage and retrieval 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. Master of Engineering (SCE) 2008-09-17T09:01:03Z 2008-09-17T09:01:03Z 2003 2003 Thesis http://hdl.handle.net/10356/2366 Nanyang Technological University application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
topic DRNTU::Engineering::Computer science and engineering::Information systems::Information storage and retrieval
spellingShingle DRNTU::Engineering::Computer science and engineering::Information systems::Information storage and retrieval
Liu, Danzhou.
Nearest neighbor queries in spatial database
description 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.
author2 Lim, Ee Peng
author_facet Lim, Ee Peng
Liu, Danzhou.
format Theses and Dissertations
author Liu, Danzhou.
author_sort Liu, Danzhou.
title Nearest neighbor queries in spatial database
title_short Nearest neighbor queries in spatial database
title_full Nearest neighbor queries in spatial database
title_fullStr Nearest neighbor queries in spatial database
title_full_unstemmed Nearest neighbor queries in spatial database
title_sort nearest neighbor queries in spatial database
publishDate 2008
url http://hdl.handle.net/10356/2366
_version_ 1759858052588109824

Similar Items