Share Email Print
cover

Proceedings Paper

Indexing and retrieving point and region objects
Author(s): Azzam T. Ibrahim; Farshad A. Fotouhi
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 13 March 1996
PDF: 16 pages
Proc. SPIE 2670, Storage and Retrieval for Still Image and Video Databases IV, (13 March 1996); doi: 10.1117/12.234812
Show Author Affiliations
Azzam T. Ibrahim, Metlife-Metsource Consulting (United States)
Farshad A. Fotouhi, Wayne State Univ. (United States)


Published in SPIE Proceedings Vol. 2670:
Storage and Retrieval for Still Image and Video Databases IV
Ishwar K. Sethi; Ramesh C. Jain, Editor(s)

© SPIE. Terms of Use
Back to Top