The Gr_Tree: The Use of Active Regions in G-Trees

  • Authors:
  • Dimitris G. Kapopoulos;Michael Hatzopoulos

  • Affiliations:
  • -;-

  • Venue:
  • ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present an efficient data structure, called Gr_tree, for organizing multidimensional data. The proposed structure combines the features of distance functions of metric spaces and G-trees. Although the Gr_tree requires distance computations and has the overhead of a small amount of storage space, due to the introduction of active regions inside the partitions of the data space, it reduces the accesses of partial match and range queries. We give algorithms for the dynamic operations of the Gr_tree, examine several types of queries and provide some comparative results.