List of Clustered Permutations in Secondary Memory

Similarity search is a difficult problem and various indexing schemas have been defined to process similarity queries efficiently in many applications, including multimedia databases and other repositories handling complex objects. Metric indices support efficient similarity searches, but most of t...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Roggero, Patricia, Reyes, Nora Susana, Figueroa, Karina, Paredes, Rodrigo
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2015
Materias:
Ciencias Informáticas
Metrics
Secondary storage
permutation-based algorithm
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/50446
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-50446
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Metrics
Secondary storage
permutation-based algorithm
spellingShingle Ciencias Informáticas
Metrics
Secondary storage
permutation-based algorithm
Roggero, Patricia
Reyes, Nora Susana
Figueroa, Karina
Paredes, Rodrigo
List of Clustered Permutations in Secondary Memory
topic_facet Ciencias Informáticas
Metrics
Secondary storage
permutation-based algorithm
description Similarity search is a difficult problem and various indexing schemas have been defined to process similarity queries efficiently in many applications, including multimedia databases and other repositories handling complex objects. Metric indices support efficient similarity searches, but most of them are designed for main memory. Thus, they can handle only small datasets, suffering serious performance degradations when the objects reside on disk.Most real-life database applications require indices able to work on secondary memory. Among a plethora of indices, the List of Clustered Permutations (LCP) has shown to be competitive in main memory, since groups the permutations and establishes a criterion to discard whole clusters according the permutation of their centers. We introduce a secondary-memory variant of the LCP, which maintains the low number of distance evaluations when comparing the permutations themselves, and also needs a low number of I/O operations at construction and searching.
format Objeto de conferencia
Objeto de conferencia
author Roggero, Patricia
Reyes, Nora Susana
Figueroa, Karina
Paredes, Rodrigo
author_facet Roggero, Patricia
Reyes, Nora Susana
Figueroa, Karina
Paredes, Rodrigo
author_sort Roggero, Patricia
title List of Clustered Permutations in Secondary Memory
title_short List of Clustered Permutations in Secondary Memory
title_full List of Clustered Permutations in Secondary Memory
title_fullStr List of Clustered Permutations in Secondary Memory
title_full_unstemmed List of Clustered Permutations in Secondary Memory
title_sort list of clustered permutations in secondary memory
publishDate 2015
url http://sedici.unlp.edu.ar/handle/10915/50446
work_keys_str_mv AT roggeropatricia listofclusteredpermutationsinsecondarymemory
AT reyesnorasusana listofclusteredpermutationsinsecondarymemory
AT figueroakarina listofclusteredpermutationsinsecondarymemory
AT paredesrodrigo listofclusteredpermutationsinsecondarymemory
bdutipo_str Repositorios
_version_ 1764820475047837696

Ejemplares similares