Efficient processing of spatial joins using R-trees

@inproceedings{Brinkhoff1993EfficientPO,
  title={Efficient processing of spatial joins using R-trees},
  author={Thomas Brinkhoff and Hans-Peter Kriegel and Bernhard Seeger},
  booktitle={SIGMOD '93},
  year={1993}
}
Spatial joins are one of the most important operations for combining spatial objects of several relations. The efficient processing of a spatial join is extremely important since its execution time is superlinear in the number of spatial objects of the participating relations, and this number of objects may be very high. In this paper, we present a first detailed study of spatial join processing using R-trees, particularly R*-trees. R-trees are very suitable for supporting spatial queries and… 
Optimization of spatial join using constraints based- clustering techniques
Spatial joins are used to combine the spatial objects. The efficient processing depends upon the spatial queries. The execution time and input/output (I/O) time of spatial queries are crucial,
Multi-step processing of spatial joins
TLDR
This paper presents a complete approach of spatial join processing on complex spatial objects that is based on three steps and reduces the total execution time of the spatial join by factors.
Efficient temporal join processing using indices
TLDR
An extensive comparison of all index based temporal joins, using a variety of datasets and query characteristics shows that the MVBT based join algorithms are consistently faster and the link-based algorithm has the most robust behavior.
Efficient computation of spatial joins with intersection predicates
  • N. Koudas
  • Computer Science
    Int. J. Geogr. Inf. Sci.
  • 2002
TLDR
An analytical evaluation of its I/O and processor requirements comparing them with those of previously proposed algorithms for the same problem is presented and it is shown that S3 J has relatively simple cost estimation formulas that can be exploited by a query optimizer.
Indexing support for spatial joins
  • N. Koudas
  • Computer Science
    Data Knowl. Eng.
  • 2000
TLDR
The experimental results show that full spatial joins can always be done more efficiently with Filter Trees than with current competitive methods, with large performance improvements.
Exploiting Spatial Indexes for Semijoin-Based Join Processing in Distributed Spatial Databases
TLDR
A semijoin-like operator is proposed to prune away objects that do not contribute to the join result, which reduces both the transmission and local processing costs for a later join operation.
Processing of Spatiotemporal Joins Using Indexes
It's a well-known fact that the new GIS applications need to keep track of temporal information. Among other operations, a spatiotemporal DBMS should efficiently answer the spatiotemporal join. The
A Unified Approach for Indexed and Non-Indexed Spatial Joins
TLDR
This paper develops a simple plane-sweeping algorithm that unifies the index-based and non-index based approaches to spatial join algorithms, and proposes the use of a simple cost model to decide when to follow an index- based approach.
An Efficient Cost Model for Spatial Joins Using R-trees
TLDR
An analytical model that efficiently estimates the cost (in terms of disk accesses) of a spatial join query between two spatial datasets is introduced and it turns out that the relative error rarely exceeds 15% for all combinations.
Spatial Joins and R-trees
TLDR
An effective algorithm for spatial joins which combines both I/O and CPU cost optimization is presented which is designed like a multi-step process and uses combination of the algorithms described in the previous paper.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 49 REFERENCES
Efficient Computation of Spatial Joins
TLDR
A class of tree structures, called generalization trees, that can be applied efficiently to compute spatial joins in a hierarchical manner are described.
Parallel R-trees
TLDR
Experiments indicate that the multiplexed R-tree with PI heuristic gives better response time than the disk-stripping (=“Super-node”) approach, and imposes lighter load on the I/O sub-system.
Join processing in relational databases
TLDR
The different kinds of joins and the various implementation techniques are surveyed and they are classified based on how they partition tuples from different relations.
The R*-tree: an efficient and robust access method for points and rectangles
TLDR
The R*-tree is designed which incorporates a combined optimization of area, margin and overlap of each enclosing rectangle in the directory which clearly outperforms the existing R-tree variants.
Spatial query processing in an object-oriented database system
TLDR
This work unifies much of the work on spatial query processing capabilities by identifying common principles and distilling them into a small set of constructs that can be supported with only minor modifications to current DBMS implementations.
A qualitative comparison study of data structures for large line segment databases
A qualitative comparative study is performed of the performance of three popular spatial indexing methods - the R-tree, R+-tree, and the PMR quadtree-in the context of processing spatial queries in
Redundancy in spatial databases
TLDR
The optimal use of redundancy for z- order is explored through analysis of the z-order search algorithm and through experiments.
Optimal Secondary Storage Access Sequence for Performing Relational Join
TLDR
The authors show the performance improvement of the proposed heuristics over the hybrid-has join algorithm for a wide range of join factors and the problem of determining an ordered list of joining blocks that requires the smallest buffer is considered.
A class of data structures for associative searching
TLDR
The class of data structures generated by this scheme includes a type of kd tree whose balance can be efficiently maintained, a multidimensional Btree which is simpler than previously proposed generalizations, and some previously reported data structures for range searching.
Scheduling of Page-Fetches in Join Operations
TLDR
Procedures to schedule join operations in a paging environment based on the Hamiltonian path condition and the Eular path condition are discussed and heuristic procedures for near optimum solutions are obtained.
...
1
2
3
4
5
...