On using B+-tree for efficient processing for the boundary neighborhood problem

Authors:
Azzam Sleit
Affiliations:
Department of Computer Science, King Abdulla II School for Information Technology, University of Jordan, Amman, Jordan
Venue:
WSEAS TRANSACTIONS on SYSTEMS
Year:
2008

Citing 11
Cited 3

Hierarchical representations of collections of small rectangles

ACM Computing Surveys (CSUR)
Redundancy in spatial databases

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Spatial data structures

Modern database systems
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
B-trees: bearing fruits of all kinds

ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
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
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Efficient processing of spatial selection and join operations using SB/sup +/-tree

IDEAS '97 Proceedings of the 1997 International Symposium on Database Engineering & Applications
Depth-First K-Nearest Neighbor Finding Using the MaxNearestDist Estimator

ICIAP '03 Proceedings of the 12th International Conference on Image Analysis and Processing
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)

Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)

Three different designs for packet classification

WSEAS Transactions on Computers
Shape approximation using circular grids

WSEAS Transactions on Information Science and Applications
Corner-based splitting: An improved node splitting algorithm for R-tree

Journal of Information Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A spatial data set is a collection of spatially referenced objects. The boundary neighborhood problem (i.e. BN problem) in spatial database systems is defined as finding all boundary neighbors for a given object based on special dimensions. This problem arises in several applications mainly in GIS systems such as finding all countries that surround a given lake or sea. Spatial objects can be represented and indexed by their minimum bounding rectangles (i.e. MBR's) which give rough indication for the existence of an object. This paper proposes a solution for the BN problem, based on indexing the space using B+-tree.