By Topic

Spatial database indices for large extended objects

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
O. Gunther ; FAW Ulm, Germany ; H. Noltemeier

An analytic model is given for the behavior of dynamic spatial index structures under insertions and deletions. Based on this model a new tool, called the oversize shelf to improve the performance of tree-based indices by minimizing redundancy, is optimized and evaluated. Oversize shelves are extra disk pages that are attached to the interior nodes of a tree-based spatial index structure. These pages are used to accommodate very large data objects in order to avoid their excessive fragmentation. Whenever inserting a new object into the tree, it should be decided whether to store it on an oversize shelf or to insert it into the subtrees. From the analytic model a threshold q* for the object size is obtained. If the object is larger than q*, it is more favorable to put it on the oversize shelf, otherwise the insertion into the subtrees is preferable

Published in:

Data Engineering, 1991. Proceedings. Seventh International Conference on

Date of Conference:

8-12 Apr 1991