13 March 1996 Indexing and retrieving point and region objects
Author Affiliations +
Abstract
R-tree and its variants are examples of spatial data structures for paged-secondary memory. To process a query, these structures require multiple path traversals. In this paper, we present a new image access method, SB+-tree which requires a single path traversal to process a query. Also, SB+-tree will allow commercial databases an access method for spatial objects without a major change, since most commercial databases already support B+-tree as an access method for text data. The SB+-tree can be used for zero and non-zero size data objects. Non-zero size objects are approximated by their minimum bounding rectangles (MBRs). The number of SB+-trees generated is dependent upon the number of dimensions of the approximation of the object. The structure supports efficient spatial operations such as regions-overlap, distance and direction. In this paper, we experimentally and analytically demonstrate the superiority of SB+-tree over R-tree.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Azzam T. Ibrahim, Farshad A. Fotouhi, "Indexing and retrieving point and region objects", Proc. SPIE 2670, Storage and Retrieval for Still Image and Video Databases IV, (13 March 1996); doi: 10.1117/12.234812; https://doi.org/10.1117/12.234812
PROCEEDINGS
16 PAGES


SHARE
RELATED CONTENT

PACS archive strategy utilizing a 3-TB jukebox
Proceedings of SPIE (May 01 1996)
Fault-tolerant PACS server design
Proceedings of SPIE (August 07 2001)
Automatic orientation correction for radiographs
Proceedings of SPIE (March 16 2006)
User-steered image boundary segmentation
Proceedings of SPIE (April 16 1996)

Back to Top