Sciweavers

165 search results - page 4 / 33
» Parallel Processing of Spatial Joins Using R-trees
Sort
View
SIGMOD
1993
ACM
78views Database» more  SIGMOD 1993»
14 years 14 days ago
Efficient Processing of Spatial Joins Using R-Trees
Thomas Brinkhoff, Hans-Peter Kriegel, Bernhard See...
IGIS
1994
145views GIS» more  IGIS 1994»
14 years 15 days ago
Approximations for a Multi-Step Processing of Spatial Joins
The basic concept for processing spatial joins consists of two steps: First, the spatial join is performed on the minimum bounding rectangles of the objects by using a spatial acce...
Thomas Brinkhoff, Hans-Peter Kriegel
BTW
2001
Springer
98views Database» more  BTW 2001»
14 years 28 days ago
On Parallel Join Processing in Object-Relational Database Systems
Abstract. So far only few performance studies on parallel object-relational database systems are available. In particular, the relative performance of relational vs. reference-base...
Holger Märtens, Erhard Rahm
TKDE
1998
122views more  TKDE 1998»
13 years 8 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
EDBT
2002
ACM
188views Database» more  EDBT 2002»
14 years 8 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis