Fractals for secondary key retrieval

摘要: In this paper we propose the use of fractals and especially Hilbert curve, in order to design good distance-preserving mappings. Such mappings improve performance secondary-key- spatial- access methods, where multi-dimensional points have be stored on an 1-dimensional medium (e.g., disk). Good clustering reduces number disk accesses retrieval, improving response time. Our experiments range queries nearest neighbor showed that proposed curve achieves better than older methods (“bit-shuffling”, or Peano curve), for every situation tried.