Efficient processing of spatial selection and join operations using SB+-tree

Authors:
Azzam Ibrahim;Farshad Fotouhi;Amer AL-Badameh
Affiliations:
R&D Consulting, Dearborn, MI;Department of Computer Science, Wayne State University, Detroit, MI;Department of Computer Science, Wayne State University, Detroit, MI
Venue:
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
Year:
1997

Citing 13
Cited 0

Spatial query processing in an object-oriented database system

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The design and analysis of spatial data structures

The design and analysis of spatial data structures
The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Fundamentals of database systems (2nd ed.)

Fundamentals of database systems (2nd ed.)
Efficient processing of spatial joins using R-trees

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On packing R-trees

CIKM '93 Proceedings of the second international conference on Information and knowledge management
A class of data structures for associative searching

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An introduction to spatial database systems

The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Join Strategies on KB-Tree Indexed Relations

Proceedings of the Fifth International Conference on Data Engineering
Spatial Join Indices

Proceedings of the Seventh International Conference on Data Engineering
Efficient Computation of Spatial Joins

Proceedings of the Ninth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a spatial access method, SB+ -tree that is based on B+ -tree structure. For each axis of the space, a set of indexing points is generated, where an indexing point is created whenever a new minimum bounding rectilinear rectangle (or MBR) begins or ends. These indexing points are then used to create a SB+ -tree. We will present algorithms using SB+ -tree, for performing two spatial selection operators, namely, Window-Intersection and Point-Containment, and one spatial join operator, Regions-Containment. Analytically, we will show the improved performance of the Window-Intersection operation using SB+ -tree over using existing paged-secondary memory spatial access structures such as R*-tree [4].