Benchmarking Spatial Join Operations with Spatial Output (1998)
Cached
Download Links
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.umiacs.umd.edu]
- [www.cs.umd.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Proceedings of the 21st International Conference on Very Large Data Bases |
| Citations: | 27 - 6 self |
BibTeX
@INPROCEEDINGS{Hoel98benchmarkingspatial,
author = {Erik G. Hoel and Hanan Samet and Tree R},
title = {Benchmarking Spatial Join Operations with Spatial Output},
booktitle = {Proceedings of the 21st International Conference on Very Large Data Bases},
year = {1998},
pages = {606--618}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, 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 ...
