Variations of R-Tree Structure for Indexing of Spatial Objects

The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial objects and composite optimization criteria are proposed. The efficient algorithms, including one for spatial join operation, providing for optimize considered methods are described. The results of experimental measurements of different variations of R-trees and proposed methods are presented and compared.

• Type: Conference
• Year: 1994
• Where: ADBIS
• Authors: M. G. Martynov
• Keywords: ADBIS 1994, Database, Large Spatial Objects, Methods Concerned Approximation, Spatial Objects