|
Abstract
|
Article Information:
An Approach to Indexing and Retrieval of Spatial Data with Reduced R+ Tree and K-NN Query Algorithm
S. Palaniappan, T.V. Rajinikanth and A. Govardhan
Corresponding Author: S. Palaniappan
Submitted: September 13, 2014
Accepted: November 26, 2014
Published: May 20, 2015 |
Abstract:
|
Recently, “spatial data bases have been extensively adopted in the recent decade and various methods have been presented to store, browse, search and retrieve spatial objects”. In this study, a method is plotted for retrieving nearest neighbors from spatial data indexed by R+ tree. The approach uses a reduced R+tree for the purpose of representing the spatial data. Initially the spatial data is selected and R+tree is constructed accordingly. Then a function called joining nodes is applied to reduce the number of nodes by combining the half-filled nodes to form completely filled. The idea behind reducing the nodes is to perform search and retrieval quickly and efficiently. The reduced R+ tree is then processed with KNN query algorithm to fetch the nearest neighbors to a point query. The basic procedures of KNN algorithm are used in the proposed approach for retrieving the nearest neighbors. The proposed approach is evaluated for its performance withspatial data and results are plotted in the experimental analysis section. The experimental results showed that the proposed approach is remarkably up a head than the conventional methods. The maximum time required to index the 1000 data points by the R+ tree is 10324 ms. The number of nodes possessed by reduced R+ tree is also less for 1000 data points as compared to the conventional R+ tree algorithm.
Key words: Indexing, KNN algorithm, query, R+ tree, spatial data, ,
|
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
S. Palaniappan, T.V. Rajinikanth and A. Govardhan, . An Approach to Indexing and Retrieval of Spatial Data with Reduced R+ Tree and K-NN Query Algorithm. Research Journal of Applied Sciences, Engineering and Technology, (2): 138-150.
|
|
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
