Decomposability of DiSAT for Index Dynamization

• Chávez, Edgar ^[1] ; Di Genaro, María E. ^[2] ; Reyes, Nora Susana ^[2] ; Roggero, Patricia ^[2]
  1. [1] Center for Scientific Research and Higher Education at Ensenada

     Center for Scientific Research and Higher Education at Ensenada

     México

     
  2. [2] Universidad Nacional de San Luis

     Universidad Nacional de San Luis

     Argentina

     
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 17, Nº. 2, 2017, págs. 110-116
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • The Distal Spatial Approximation Tree (DiSAT) is one of the most competitive indexes for exact proximity searching. The absence of parameters, the most salient feature, makes the index a suitable choice for a practitioner. The most serious drawback is the static nature of the index, not allowing further insertions once it is built. On the other hand, there is an old approach from Bentley and Saxe (BS) allowing the dynamization of decomposable data structures. The only requirement is to provide a decomposition operation. This is precisely our contribution, we define a decomposition operation allowing the application of the BS technique. The resulting data structure is competitive against the static counterparts.