Spatial data is data related to space. In various application fields like GIS, multimedia information systems, etc., there is a need to store and manage these data. Some datastructures used for the spatial access methods are R tree and its extensions where objects could be approximated by their minimum bounding rectangles and Quad tree based structures where space is subdivided according to certain rules. Also another structure KD Tree is used for organizing points in a k dimensional space. This paper makes review on some of these Hiearchical datastructures used for handling point data. It focuses on PR Quad Tree and KD Tree.The insertion procedure of these structures is reviewed and analyzed and also a comparison between them is drawn.
Operations on spatial objects have great individuality. As a consequence, the spatial data modelling...
R-tree is incapable of managing spatial objects in concurrent environment. We proposes the CQR-tree ...
In this thesis, a new multidimensional data structure, the q-kd tree, for storing points lying in a ...
We introduce the quad-kd tree: a general purpose and hierarchical data structure for the storage of ...
There are numerous hierarchical data structuring techniques in use for representing spatial data. On...
This paper provides an analysis of R-trees and a variation (R+ - trees) that avoids overlapping rect...
Development of quadtree as hierarchical data structuring technique for representing spatial data (li...
The spatial join operation is benchmarked using variants of well-known spatial data structures such ...
Abstract. Spatial indexes, such as those based on Quadtree, are impor-tant in spatial databases for ...
Spatial database management deals with the storage, indexing, and querying of data with spatial feat...
Operations on spatial objects have much individuality. As a consequence, the spatial data modelling ...
This paper introduces a spatial indexing structure that adjusts itself so as to provide faster acces...
Abstract. Spatial indexing is a well researched field that benefited computer science with many outs...
Processing of spatial queries has been studied extensively in the literature. In most cases, it is a...
A tutorial survey is presented of the quadtree and related hierarchical data structures. They are ba...
Operations on spatial objects have great individuality. As a consequence, the spatial data modelling...
R-tree is incapable of managing spatial objects in concurrent environment. We proposes the CQR-tree ...
In this thesis, a new multidimensional data structure, the q-kd tree, for storing points lying in a ...
We introduce the quad-kd tree: a general purpose and hierarchical data structure for the storage of ...
There are numerous hierarchical data structuring techniques in use for representing spatial data. On...
This paper provides an analysis of R-trees and a variation (R+ - trees) that avoids overlapping rect...
Development of quadtree as hierarchical data structuring technique for representing spatial data (li...
The spatial join operation is benchmarked using variants of well-known spatial data structures such ...
Abstract. Spatial indexes, such as those based on Quadtree, are impor-tant in spatial databases for ...
Spatial database management deals with the storage, indexing, and querying of data with spatial feat...
Operations on spatial objects have much individuality. As a consequence, the spatial data modelling ...
This paper introduces a spatial indexing structure that adjusts itself so as to provide faster acces...
Abstract. Spatial indexing is a well researched field that benefited computer science with many outs...
Processing of spatial queries has been studied extensively in the literature. In most cases, it is a...
A tutorial survey is presented of the quadtree and related hierarchical data structures. They are ba...
Operations on spatial objects have great individuality. As a consequence, the spatial data modelling...
R-tree is incapable of managing spatial objects in concurrent environment. We proposes the CQR-tree ...
In this thesis, a new multidimensional data structure, the q-kd tree, for storing points lying in a ...