Performance of Data-Parallel Spatial Operations.
Erik G. Hoel, Hanan Samet:
Performance of Data-Parallel Spatial Operations.
VLDB 1994: 156-167@inproceedings{DBLP:conf/vldb/HoelS94,
author = {Erik G. Hoel and
Hanan Samet},
editor = {Jorge B. Bocca and
Matthias Jarke and
Carlo Zaniolo},
title = {Performance of Data-Parallel Spatial Operations},
booktitle = {VLDB'94, Proceedings of 20th International Conference on Very
Large Data Bases, September 12-15, 1994, Santiago de Chile, Chile},
publisher = {Morgan Kaufmann},
year = {1994},
isbn = {1-55860-153-8},
pages = {156-167},
ee = {db/conf/vldb/vldb94-156.html},
crossref = {DBLP:conf/vldb/94},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
The performance of data-parallel algorithms for spatial operations
using data-parallel variants of the bucket PMR quadtree, R-tree, and
R+-tree spatial data structures is compared. The studied
operations are data structure build, polygonization, and spatial join
in an application domain consisting of planar line segment data. The
algorithms are implemented using the scan model of parallel
computation on the hypercube architecture of the Connection Machine.
The results of experiments reveal that the bucket PMR quadtree
outperforms both the R-tree and R+-tree. This is primarily because
the bucket PMR quadtree yields a regular disjoint decomposition of
space while the R-tree and R+-tree do not. The regular disjoint
decomposition increases the potential for interprocessor communication
and parallelism in the bucket PMR quadtree, thereby enabling the
execution times to decrease relative to those needed by the R-tree and
R+-tree.
Copyright © 1994 by the VLDB Endowment.
Permission to copy without fee all or part of this material is granted provided that the copies are not made or
distributed for direct commercial advantage, the VLDB
copyright notice and the title of the publication and
its date appear, and notice is given that copying
is by the permission of the Very Large Data Base
Endowment. To copy otherwise, or to republish, requires
a fee and/or special permission from the Endowment.
Online Paper
CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Jorge B. Bocca, Matthias Jarke, Carlo Zaniolo (Eds.):
VLDB'94, Proceedings of 20th International Conference on Very Large Data Bases, September 12-15, 1994, Santiago de Chile, Chile.
Morgan Kaufmann 1994, ISBN 1-55860-153-8
Contents
References
- [1]
- ...
- [2]
- Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger:
The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles.
SIGMOD Conference 1990: 322-331
- [3]
- ...
- [4]
- ...
- [5]
- Haran Boral, William Alexander, Larry Clay, George P. Copeland, Scott Danforth, Michael J. Franklin, Brian E. Hart, Marc G. Smith, Patrick Valduriez:
Prototyping Bubba, A Highly Parallel Database System.
IEEE Trans. Knowl. Data Eng. 2(1): 4-24(1990)
- [6]
- Thomas Brinkhoff, Hans-Peter Kriegel, Bernhard Seeger:
Efficient Processing of Spatial Joins Using R-Trees.
SIGMOD Conference 1993: 237-246
- [7]
- Douglas Comer:
The Ubiquitous B-Tree.
ACM Comput. Surv. 11(2): 121-137(1979)
- [8]
- George P. Copeland, William Alexander, Ellen E. Boughter, Tom W. Keller:
Data Placement In Bubba.
SIGMOD Conference 1988: 99-108
- [9]
- David J. DeWitt, Robert H. Gerber, Goetz Graefe, Michael L. Heytens, Krishna B. Kumar, M. Muralikrishna:
GAMMA - A High Performance Dataflow Database Machine.
VLDB 1986: 228-237
- [10]
- David J. DeWitt, Jim Gray:
Parallel Database Systems: The Future of Database Processing or a Passing Fad?
SIGMOD Record 19(4): 104-112(1990)
- [11]
- Ramez Elmasri, Shamkant B. Navathe:
Fundamentals of Database Systems.
Benjamin/Cummings 1989
- [12]
- Christos Faloutsos, Timos K. Sellis, Nick Roussopoulos:
Analysis of Object Oriented Spatial Access Methods.
SIGMOD Conference 1987: 426-439
- [13]
- Shahram Ghandeharizadeh, David J. DeWitt, Waheed Qureshi:
A Performance Analysis of Alternative Multi-Attribute Declustering Strategies.
SIGMOD Conference 1992: 29-38
- [14]
- Antonin Guttman:
R-Trees: A Dynamic Index Structure for Spatial Searching.
SIGMOD Conference 1984: 47-57
- [15]
- Erik G. Hoel, Hanan Samet:
A Qualitative Comparison Study of Data Structures for Large Line Segment Databases.
SIGMOD Conference 1992: 205-214
- [16]
- ...
- [17]
- ...
- [18]
- Ibrahim Kamel, Christos Faloutsos:
Parallel R-trees.
SIGMOD Conference 1992: 195-204
- [19]
- Won Kim:
Research Directions in Object-Oriented Database Systems.
PODS 1990: 1-15
- [20]
- ...
- [21]
- Hanan Samet:
The Design and Analysis of Spatial Data Structures.
Addison-Wesley 1990
- [22]
- ...
Copyright © Tue Mar 16 02:22:04 2010
by Michael Ley (ley@uni-trier.de)