Decomposability of DiSAT for Index Dynamization
Journal of Computer Science and Technology · 2017
DOI: 10.24215/16666038.17.e15 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computer Science and Technology, 2017. Verfasst von Edgar Chávez und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Chávez, E., Genaro, M. E. D., Reyes, N. S., & Roggero, P. (2017). Decomposability of DiSAT for Index Dynamization. Journal of Computer Science and Technology. https://doi.org/10.24215/16666038.17.e15
Vancouver
Chávez E, Genaro MED, Reyes NS, Roggero P. Decomposability of DiSAT for Index Dynamization. Journal of Computer Science and Technology. 2017. doi:10.24215/16666038.17.e15
BibTeX
@article{Chvez2017,
author = {Chávez, Edgar and Genaro, María E. Di and Reyes, Nora Susana and Roggero, Patricia},
title = {Decomposability of DiSAT for Index Dynamization},
journal = {Journal of Computer Science and Technology},
year = {2017},
doi = {10.24215/16666038.17.e15}
}
EUVIMED