By Topic

Comparison of approximations of complex objects used for approximation-based query processing in spatial database systems

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

3 Author(s)
T. Brinkhoff ; Inst. for Comput. Sci., Munich Univ., Germany ; H. -P. Kriegel ; R. Schneider

The minimum bounding box, the convex hull, the minimum bounding four- and five-corner, rotated boxes, and the minimum bounding ellipses and circles convex conservative approximation methods for handling complex spatial objects in spatial access methods are discussed. Results indicate that, depending on the complexity of the objects and the type of queries, the approximations five-corner, ellipse and rotated bounding box clearly outperform the bounding box. It is the reduced number of false hits that yields a considerable improvement in total query time when using the proposed approximations

Published in:

Data Engineering, 1993. Proceedings. Ninth International Conference on

Date of Conference:

19-23 Apr 1993