Decomposability of DiSAT for Index Dynamization
- Autores
- Chávez, Edgar; Di Genaro, María E.; Reyes, Nora Susana; Roggero, Patricia
- Año de publicación
- 2017
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- 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.
Facultad de Informática - Materia
-
Ciencias Informáticas
similarity search
dynamism
metric spaces
non-conventional databases - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by/4.0/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/62937
Ver los metadatos del registro completo
| id |
SEDICI_a0931e1d73ec64018618af52f64fd032 |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/62937 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
Decomposability of DiSAT for Index DynamizationChávez, EdgarDi Genaro, María E.Reyes, Nora SusanaRoggero, PatriciaCiencias Informáticassimilarity searchdynamismmetric spacesnon-conventional databasesThe 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.Facultad de Informática2017-10info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf110-116http://sedici.unlp.edu.ar/handle/10915/62937enginfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/2017/10/JCST-45-Paper-3.pdfinfo:eu-repo/semantics/altIdentifier/issn/1666-6038info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/4.0/Creative Commons Attribution 4.0 International (CC BY 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-11-05T12:48:08Zoai:sedici.unlp.edu.ar:10915/62937Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-11-05 12:48:08.887SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
Decomposability of DiSAT for Index Dynamization |
| title |
Decomposability of DiSAT for Index Dynamization |
| spellingShingle |
Decomposability of DiSAT for Index Dynamization Chávez, Edgar Ciencias Informáticas similarity search dynamism metric spaces non-conventional databases |
| title_short |
Decomposability of DiSAT for Index Dynamization |
| title_full |
Decomposability of DiSAT for Index Dynamization |
| title_fullStr |
Decomposability of DiSAT for Index Dynamization |
| title_full_unstemmed |
Decomposability of DiSAT for Index Dynamization |
| title_sort |
Decomposability of DiSAT for Index Dynamization |
| dc.creator.none.fl_str_mv |
Chávez, Edgar Di Genaro, María E. Reyes, Nora Susana Roggero, Patricia |
| author |
Chávez, Edgar |
| author_facet |
Chávez, Edgar Di Genaro, María E. Reyes, Nora Susana Roggero, Patricia |
| author_role |
author |
| author2 |
Di Genaro, María E. Reyes, Nora Susana Roggero, Patricia |
| author2_role |
author author author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas similarity search dynamism metric spaces non-conventional databases |
| topic |
Ciencias Informáticas similarity search dynamism metric spaces non-conventional databases |
| dc.description.none.fl_txt_mv |
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. Facultad de Informática |
| description |
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. |
| publishDate |
2017 |
| dc.date.none.fl_str_mv |
2017-10 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion Articulo http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
| format |
article |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/62937 |
| url |
http://sedici.unlp.edu.ar/handle/10915/62937 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/2017/10/JCST-45-Paper-3.pdf info:eu-repo/semantics/altIdentifier/issn/1666-6038 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/4.0/ Creative Commons Attribution 4.0 International (CC BY 4.0) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by/4.0/ Creative Commons Attribution 4.0 International (CC BY 4.0) |
| dc.format.none.fl_str_mv |
application/pdf 110-116 |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1847978513748983808 |
| score |
13.084122 |