Multimedia web searches using static SAT

In this paper we describe the parallelization of a data structure used to perform multimedia web searches. Multimedia Web Engines have not been deeply studied and is a challenging issue. The data structure selected to index the queries is the Spatial Approximation Tree, where the complexity measure...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Gil Costa, Graciela Verónica, Printista, Alicia Marcela, Reyes, Nora Susana, Marín, Mauricio
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2006
Materias:
Ciencias Informáticas
Metrics Space,
web engine
spatial approximation
indexes
BSP
Trees
Search process
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22685
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-22685
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 Space,
web engine
spatial approximation
indexes
BSP
Trees
Search process
spellingShingle Ciencias Informáticas
Metrics Space,
web engine
spatial approximation
indexes
BSP
Trees
Search process
Gil Costa, Graciela Verónica
Printista, Alicia Marcela
Reyes, Nora Susana
Marín, Mauricio
Multimedia web searches using static SAT
topic_facet Ciencias Informáticas
Metrics Space,
web engine
spatial approximation
indexes
BSP
Trees
Search process
description In this paper we describe the parallelization of a data structure used to perform multimedia web searches. Multimedia Web Engines have not been deeply studied and is a challenging issue. The data structure selected to index the queries is the Spatial Approximation Tree, where the complexity measure is given by the number of distance computed to retrieve those objects close enough to the query. We present a parallel method for load balancing the work performed by the processors. The method can adapt itself to the changes of the workload produced by the user queries. Empirical results with di fferent kind of databases show e fficient performance in a real cluster of PC. The algorithm is designed with the bulk-synchronous model of parallel computing
format Objeto de conferencia
Objeto de conferencia
author Gil Costa, Graciela Verónica
Printista, Alicia Marcela
Reyes, Nora Susana
Marín, Mauricio
author_facet Gil Costa, Graciela Verónica
Printista, Alicia Marcela
Reyes, Nora Susana
Marín, Mauricio
author_sort Gil Costa, Graciela Verónica
title Multimedia web searches using static SAT
title_short Multimedia web searches using static SAT
title_full Multimedia web searches using static SAT
title_fullStr Multimedia web searches using static SAT
title_full_unstemmed Multimedia web searches using static SAT
title_sort multimedia web searches using static sat
publishDate 2006
url http://sedici.unlp.edu.ar/handle/10915/22685
work_keys_str_mv AT gilcostagracielaveronica multimediawebsearchesusingstaticsat
AT printistaaliciamarcela multimediawebsearchesusingstaticsat
AT reyesnorasusana multimediawebsearchesusingstaticsat
AT marinmauricio multimediawebsearchesusingstaticsat
bdutipo_str Repositorios
_version_ 1764820467472924674

Ejemplares similares