The X-tree (eXtended node tree) [1] is a spatial access method [2] that supports efficient query processing for high-dimensional data. It supports not only point data but also extended spatial data. The X-tree provides overlap-free split whenever it is possible without allowing the tree to degenerate; otherwise, the X-tree uses extended variable size directory nodes, so-called supernodes. The X-tree may be seen as a hybrid of a linear array-like and a hierarchical R-tree-like directory
This paper provides an analysis of R-trees and a variation (R+ - trees) that avoids overlapping rect...
The performance of spatial queries depends mainly on the underlying index structure used to handle t...
Many database applications require effective representation of regional objects in high-dimensional ...
The X-tree (eXtended node tree) [1] is a spatial access method [2] that supports efficient query pro...
In this paper, we propose a new method for index-ing large amounts of point and spatial data in high...
In this paper, we propose a new method for index-ing large amounts of point and spatial data in high...
In this paper, we propose a new method for indexing large amounts of point and spatial data in highd...
In this paper, we propose a new method for indexing large amounts of point and spatial data in highd...
Abstract. Spatial indexes, such as those based on Quadtree, are impor-tant in spatial databases for ...
Processing of spatial queries has been studied extensively in the literature. In most cases, it is a...
A major part of the interface to a database is made up of the queries that can be addressed to this ...
Abstract. Within spatial databases it is important to have a multi-dimensional index structure. This...
Spatial databases are optimized for the management of data stored based on their geometric space. Re...
Quadtrees are well known data structures for handling images and image-like objects. They encode an ...
In spatial databases, traditional approach is to build separate indexing structures for spatial and ...
This paper provides an analysis of R-trees and a variation (R+ - trees) that avoids overlapping rect...
The performance of spatial queries depends mainly on the underlying index structure used to handle t...
Many database applications require effective representation of regional objects in high-dimensional ...
The X-tree (eXtended node tree) [1] is a spatial access method [2] that supports efficient query pro...
In this paper, we propose a new method for index-ing large amounts of point and spatial data in high...
In this paper, we propose a new method for index-ing large amounts of point and spatial data in high...
In this paper, we propose a new method for indexing large amounts of point and spatial data in highd...
In this paper, we propose a new method for indexing large amounts of point and spatial data in highd...
Abstract. Spatial indexes, such as those based on Quadtree, are impor-tant in spatial databases for ...
Processing of spatial queries has been studied extensively in the literature. In most cases, it is a...
A major part of the interface to a database is made up of the queries that can be addressed to this ...
Abstract. Within spatial databases it is important to have a multi-dimensional index structure. This...
Spatial databases are optimized for the management of data stored based on their geometric space. Re...
Quadtrees are well known data structures for handling images and image-like objects. They encode an ...
In spatial databases, traditional approach is to build separate indexing structures for spatial and ...
This paper provides an analysis of R-trees and a variation (R+ - trees) that avoids overlapping rect...
The performance of spatial queries depends mainly on the underlying index structure used to handle t...
Many database applications require effective representation of regional objects in high-dimensional ...