| Revista: | Computación y sistemas |
| Base de datos: | |
| Número de sistema: | 000560669 |
| ISSN: | 1405-5546 |
| Autores: | Figueroa, Karina1 Camarena Ibarrola, Antonio2 Valero, Luis1 |
| Instituciones: | 1Universidad Michoacana de San Nicolás Hidalgo, Facultad de Ciencias Físico Matemáticas, Morelia, Michoacán. México 2Universidad Michoacana de San Nicolás Hidalgo, Facultad de Ingeniería Eléctrica, Morelia, Michoacán. México |
| Año: | 2022 |
| Periodo: | Ene-Mar |
| Volumen: | 26 |
| Número: | 1 |
| Paginación: | 71-79 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Resumen en inglés | Similarity searching is the most important task in multimedia databases, It consists in retrieving the most similar elements to a given query from a database, knowing that an element identical to the query would not be found. Dissimilarity between objects is measured with a distance function (usually expensive to compute), this allows approaching this problem with a metric space. Many algorithms have been designed to address this problem, in particular, the Permutation Based index has shown an unbeatable performance. This technique uses reference objects to determine a string for each element in the database that is a permutation of the same string. However, Huge databases and the memory required for these indexes make this problem a real challenge. In this paper, we present an improvement to the first approach where classes of reference objects were used instead of single references. In this paper, a new way to choose these classes is proposed and a new way to evaluate similarity between permutations. Our experiments show that we can avoid distance evaluations up to 90% with respect to the original technique, and up to 80% to the first approach. |
| Disciplinas: | Ciencias de la computación |
| Palabras clave: | Procesamiento de datos |
| Keyword: | Data processing |
| Texto completo: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
