2012Unpublished venueRequires access

Exerting spatial join and KNN queries on spatial database

K. Bhima, T. Aruna Sri, K. D. Ramaiah, A. Jagan

Open publisher page 3 citations

Abstract

Spatial database system as a database system that offers spatial data types in its data model and query language and supports spatial data types in its implementation, providing at least spatial indexing and spatial join methods. Spatial database applications, such as Geographical Information Systems (GIS), typically use R-tree variants to index geographical data. Spatial Joins are important operations in applications such as GIS, Cartography and CAD/CAM. Spatial Join is very useful technique for wide spread implementation of R-trees as Spatial index structures. Proposed an algorithm based on R-tree to perform the operation of spatial join for spatial objects in multi-user environment. K-Nearest Neighbor (k-NN) queries are used in GIS and CAD/CAM applications to find the k spatial objects closest to some given query point. Quickly executing k-Nearest-Neighbor (kNN) in spatial database applications requires an informative and efficient index structure that can effectively reduce the search space. Proposed method implements extension to R-trees that uses object classifications to reduce the search space of kNN queries in multi-user environment.

About this research paper

What this paper is about

Spatial database system as a database system that offers spatial data types in its data model and query language and supports spatial data types in its implementation, providing at least spatial indexing and spatial join methods. Spatial database applications, such as Geographical Information Systems (GIS), typically use R-tree variants to index geographical data. Spatial Joins are important operations in applications such as GIS, Cartography and CAD/CAM. Spatial Join is very useful technique for wide spread implementation of R-trees as Spatial index structures. Proposed an algorithm based on R-tree to perform the operation of spatial join for spatial objects in multi-user environment. K-Nearest Neighbor (k-NN) queries are used in GIS and CAD/CAM applications to find the k spatial objects closest to some given query point. Quickly executing k-Nearest-Neighbor (kNN) in spatial database applications requires an informative and efficient index structure that can effectively reduce the search space. Proposed method implements extension to R-trees that uses object classifications to reduce the search space of kNN queries in multi-user environment.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Spatial database system as a database system that offers spatial data types in its data model and query language and supports spatial data types in its implementation, providing at least spatial indexing and spatial join methods. Spatial database applications, such as Geographical Information Systems (GIS), typically use R-tree variants to index geographical data. Spatial Joins are important operations in applications such as GIS, Cartography and CAD/CAM. Spatial Join is very useful technique for wide spread implementation of R-trees as Spatial index structures. Proposed an algorithm based on R-tree to perform the operation of spatial join for spatial objects in multi-user environment. K-Nearest Neighbor (k-NN) queries are used in GIS and CAD/CAM applications to find the k spatial objects closest to some given query point. Quickly executing k-Nearest-Neighbor (kNN) in spatial database applications requires an informative and efficient index structure that can effectively reduce the search space. Proposed method implements extension to R-trees that uses object classifications to reduce the search space of kNN queries in multi-user environment.

Key concepts: Spatial database, Object-based spatial database, Computer science, Spatial query, Search engine indexing, Data mining, Spatial analysis, R-tree

Related papers

Back to paper searchBrowse research topicsOriginal source
Exerting spatial join and KNN queries on spatial database — Research Paper | ScholarLens