Performance of Data-Parallel Spatial Operations
Summary: Data-parallel spatial ops (build, polygonization, spatial join) for planar line segments compare bucket PMR quadtree, R-tree, and R+-tree on the Connection Machine. Bucket PMR quadtree outperforms the others due to a regular disjoint space decomposition that boosts parallelism and reduces interprocessor communication. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Erik G. Hoelt (United States Census Bureau)
- 2. Hanan Samet (University of Maryland)
BibTeX Citation
@article{hoelt_vldb94,
title = {{Performance of Data-Parallel Spatial Operations}},
author = {Hoelt, Erik G. and Samet, Hanan},
journal = {PVLDB},
series = {{VLDB} '94},
pages = {156},
year = {1994}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,148 | Spatial Partitioning Techniques in SpatialHadoop | 2015 | VLDB | 6.872045e-05 |
| 5,795 | Benchmarking Spatial Join Operations with Spatial Output | 1995 | VLDB | 6.0859946e-05 |
| 8,644 | Incremental Partitioning for Efficient Spatial Data Analytics | 2022 | VLDB | 5.3934068e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0020210012 |
| 4 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.001157935 |
| 52 | GAMMA - A High Performance Dataflow Database Machine | 1986 | VLDB | 0.00041107291 |
| 145 | Efficient Processing of Spatial Joins Using R-trees | 1993 | SIGMOD | 0.00029548428 |
| 188 | Data Placement In Bubba | 1988 | SIGMOD | 0.00026126036 |
| 1,814 | Analysis Of Object Oriented Spatial Access Methods | 1987 | SIGMOD | 9.6928497e-05 |
| 2,168 | A Qualitative Comparison Study of Data Structures for Large Line Segment Databases | 1992 | SIGMOD | 9.0469646e-05 |
| 2,341 | Parallel R-trees | 1992 | SIGMOD | 8.7233426e-05 |
| 2,613 | A Performance Analysis of Alternative Multi-Attribute Declustering Strategies | 1992 | SIGMOD | 8.3460281e-05 |
| 6,464 | Research Directions in Object-Oriented Database Systems | 1990 | PODS | 5.8714103e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,685 | Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures | 2016 | PODS |
| 2 | 4,740 | An Experimental Analysis of Iterated Spatial Joins in Main Memory | 2013 | VLDB |
| 3 | 5,202 | Filter Trees for Managing Spatial Data Over a Range of Size Granularities | 1996 | VLDB |
| 4 | 6,089 | Window Query-Optimal Clustering of Spatial Objects | 1995 | PODS |
| 5 | 2,548 | Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations | 1997 | VLDB |
| 6 | 11,675 | Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* | 2021 | SIGMOD |
| 7 | 2,168 | A Qualitative Comparison Study of Data Structures for Large Line Segment Databases | 1992 | SIGMOD |
| 8 | 145 | Efficient Processing of Spatial Joins Using R-trees | 1993 | SIGMOD |
| 9 | 2,341 | Parallel R-trees | 1992 | SIGMOD |
| 10 | 5,795 | Benchmarking Spatial Join Operations with Spatial Output | 1995 | VLDB |