Year

1994

Degree Name

Master of Science (Hons.)

Department

Department of Computer Science

Abstract

The SR-tree is a new dynamic access method for spatial databases. It is primarily designed after the ubiquitous R-tree and is based on the heuristic optimization of area enclosing each inner node. The SR-tree is designed for paged secondary memory and emphasis is placed in minimizing the amount of disk access during a tree search. Objects are assumed to acquire complex forms, with which rectangle-based methods perfoirn quite inefficiendy.

Share

COinS
 

Unless otherwise indicated, the views expressed in this thesis are those of the author and do not necessarily represent the views of the University of Wollongong.