5.9.
1: Lab Task 1
Declaration......................................................................................................1
Acknowledgement...........................................................................................1
Dedication........................................................................................................1
Abstract...........................................................................................................1
List of figures...................................................................................................1
List of Tables....................................................................................................1
1. Introduction............................................................................................1
1.1 Searching Techniques..........................................................................1
1.1.1 Deterministic search......................................................................1
1.1.2 non-deterministic search\..............................................................1
1.2 Motivation to use Searching technique................................................1
1.3 Searching in high dimensional space...................................................1
1.4 Nearest Neighbour search...................................................................1
1.5 Nearest neighbor in euclidem space....................................................1
1.6 Types of Nearest neighbor search Algorithms.....................................1
1.6.1 Partition based Algorithm...............................................................1
1.6.2 Graph based Algorithm..................................................................1
1.6.3 Range based Algorithm..................................................................1
1.7 k-nearest neighbor search...................................................................1
1.8 Types of Queries..................................................................................1
1.9 Storage and retrieval of spatial objects...............................................1
1.10 Proposed research idea......................................................................1
1.11 Outline of the thesis...........................................................................1
2. Literature Review......................................................................................1
2.1 Concepts and Definition.......................................................................1
2.1.1 Near neighbor Query (range query)...............................................1
2.1.2 Nearest neighbor Query.................................................................1
2.1.3 k-nearest neighbor Query..............................................................1
2.2 Nearest neighbor search background..................................................1
2.3 GIS and nearest neighbor searching....................................................1
2.4 Nearest neighbor searching techniques...............................................1
Declaration
Acknowledgement
Dedication
Abstract
List of figures
List of Tables
1. Introduction
1.1 Searching Techniques
1.1.1 Deterministic search
1.1.2 non-deterministic search\
1.2 Motivation to use Searching technique
1.3 Searching in high dimensional space
1.4 Nearest Neighbour search
1.5 Nearest neighbor in euclidem space
1.6 Types of Nearest neighbor search Algorithms
1.6.1 Partition based Algorithm
1.6.2 Graph based Algorithm
1.6.3 Range based Algorithm
1.7 k-nearest neighbor search
1.8 Types of Queries
1.9 Storage and retrieval of spatial objects
1.10 Proposed research idea
1.11 Outline of the thesis
2. Literature Review
2.1 Concepts and Definition
2.1.1 Near neighbor Query (range query)
2.1.2 Nearest neighbor Query
2.1.3 k-nearest neighbor Query
2.2 Nearest neighbor search background
2.3 GIS and nearest neighbor searching
2.4 Nearest neighbor searching techniques
5.9.2: Lab Task 2
