Results 1 
3 of
3
Spatial Data Structures
, 1995
"... An overview is presented of the use of spatial data structures in spatial databases. The focus is on hierarchical data structures, including a number of variants of quadtrees, which sort the data with respect to the space occupied by it. Suchtechniques are known as spatial indexing methods. Hierarch ..."
Abstract

Cited by 306 (13 self)
 Add to MetaCart
An overview is presented of the use of spatial data structures in spatial databases. The focus is on hierarchical data structures, including a number of variants of quadtrees, which sort the data with respect to the space occupied by it. Suchtechniques are known as spatial indexing methods. Hierarchical data structures are based on the principle of recursive decomposition. They are attractive because they are compact and depending on the nature of the data they save space as well as time and also facilitate operations such as search. Examples are given of the use of these data structures in the representation of different data types such as regions, points, rectangles, lines, and volumes.
Benchmarking Spatial Join Operations with Spatial Output
 Proceedings of the 21st International Conference on Very Large Data Bases
, 1998
"... The spatial join operation is benchmarked using variants of wellknown spatial data structures such as the Rtree, R tree, R + tree, and the PMR quadtree. The focus is on a spatial join with spatial output because the result of the spatial join frequently serves as input to subsequent spatial ..."
Abstract

Cited by 30 (6 self)
 Add to MetaCart
(Show Context)
The spatial join operation is benchmarked using variants of wellknown spatial data structures such as the Rtree, R tree, R + tree, and the PMR quadtree. The focus is on a spatial join with spatial output because the result of the spatial join frequently serves as input to subsequent spatial operations (i.e., a cascaded spatial join as would be common in a spatial spreadsheet). Thus, in addition to the time required to perform the spatial join itself (whose output is not always required to be spatial), the time to build the spatial data structure also plays an important role in the benchmark. The studied quantities are the time to build the data structure and the time to do the spatial join in an application domain consisting of planar line segment data. Experiments reveal that spatial data structures based on a disjoint decomposition of space and bounding boxes (i.e., the R + tree and the PMR quadtree with bounding boxes) outperform the other structures that are based upon ...
Dataparallel primitives for spatial operations
 In Proceedings of the 1995 International Conference on Parallel Processing. III:184–191
, 1995
"... Dataparallel primitives for performing operations on the PM1 quadtree and the bucket PMR quadtree are presented using the scan model. Algorithms are described for building these two data structures that make use of these primitives. The dataparallel algorithms are assumed tobe main memory resident ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Dataparallel primitives for performing operations on the PM1 quadtree and the bucket PMR quadtree are presented using the scan model. Algorithms are described for building these two data structures that make use of these primitives. The dataparallel algorithms are assumed tobe main memory resident. They were implemented on a Thinking Machines CM5 with 32 processors containing 1GB of main memory. 1