List of clustered permutations in secondary memory for proximity searching

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 th...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Roggero, Patricia, Reyes, Nora Susana, Figueroa, Karina, Paredes, Rodrigo
Formato:	Articulo
Lenguaje:	Inglés
Publicado:	2015
Materias:	Ciencias Informáticas metric spaces permutation-based algorithm list of clusters secondary memory Search process Secondary storage
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/50184 http://journal.info.unlp.edu.ar/wp-content/uploads/JCST41-Paper-10.pdf
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

id	I19-R120-10915-50184
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 metric spaces permutation-based algorithm list of clusters secondary memory Search process Secondary storage
spellingShingle	Ciencias Informáticas metric spaces permutation-based algorithm list of clusters secondary memory Search process Secondary storage Roggero, Patricia Reyes, Nora Susana Figueroa, Karina Paredes, Rodrigo List of clustered permutations in secondary memory for proximity searching
topic_facet	Ciencias Informáticas metric spaces permutation-based algorithm list of clusters secondary memory Search process Secondary storage
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 reallife 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.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	Articulo Articulo
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 for proximity searching
title_short	List of clustered permutations in secondary memory for proximity searching
title_full	List of clustered permutations in secondary memory for proximity searching
title_fullStr	List of clustered permutations in secondary memory for proximity searching
title_full_unstemmed	List of clustered permutations in secondary memory for proximity searching
title_sort	list of clustered permutations in secondary memory for proximity searching
publishDate	2015
url	http://sedici.unlp.edu.ar/handle/10915/50184 http://journal.info.unlp.edu.ar/wp-content/uploads/JCST41-Paper-10.pdf
work_keys_str_mv	AT roggeropatricia listofclusteredpermutationsinsecondarymemoryforproximitysearching AT reyesnorasusana listofclusteredpermutationsinsecondarymemoryforproximitysearching AT figueroakarina listofclusteredpermutationsinsecondarymemoryforproximitysearching AT paredesrodrigo listofclusteredpermutationsinsecondarymemoryforproximitysearching
bdutipo_str	Repositorios
_version_	1764820475560591361

List of clustered permutations in secondary memory for proximity searching

Ejemplares similares