Multimedia web searches using static SAT

Autores
Gil Costa, Graciela Verónica; Printista, Alicia Marcela; Reyes, Nora Susana; Marín, Mauricio
Año de publicación
2006
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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
VII Workshop de Procesamiento Distribuido y Paralelo (WPDP)
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Metrics Space,
web engine
spatial approximation
indexes
BSP
Trees
Search process
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/22685
Acceder
id SEDICI_49bbd2b0f086071509d14438ee6afb0c
oai_identifier_str oai:sedici.unlp.edu.ar:10915/22685
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Multimedia web searches using static SATGil Costa, Graciela VerónicaPrintista, Alicia MarcelaReyes, Nora SusanaMarín, MauricioCiencias InformáticasMetrics Space,web enginespatial approximationindexesBSPTreesSearch processIn 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 computingVII Workshop de Procesamiento Distribuido y Paralelo (WPDP)Red de Universidades con Carreras en Informática (RedUNCI)2006-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf1448-1459http://sedici.unlp.edu.ar/handle/10915/22685enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T10:47:46Zoai:sedici.unlp.edu.ar:10915/22685Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 10:47:47.036SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Multimedia web searches using static SAT
title Multimedia web searches using static SAT
spellingShingle Multimedia web searches using static SAT
Gil Costa, Graciela Verónica
Ciencias Informáticas
Metrics Space,
web engine
spatial approximation
indexes
BSP
Trees
Search process
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
dc.creator.none.fl_str_mv Gil Costa, Graciela Verónica
Printista, Alicia Marcela
Reyes, Nora Susana
Marín, Mauricio
author Gil Costa, Graciela Verónica
author_facet Gil Costa, Graciela Verónica
Printista, Alicia Marcela
Reyes, Nora Susana
Marín, Mauricio
author_role author
author2 Printista, Alicia Marcela
Reyes, Nora Susana
Marín, Mauricio
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Metrics Space,
web engine
spatial approximation
indexes
BSP
Trees
Search process
topic Ciencias Informáticas
Metrics Space,
web engine
spatial approximation
indexes
BSP
Trees
Search process
dc.description.none.fl_txt_mv 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
VII Workshop de Procesamiento Distribuido y Paralelo (WPDP)
Red de Universidades con Carreras en Informática (RedUNCI)
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
publishDate 2006
dc.date.none.fl_str_mv 2006-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/22685
url http://sedici.unlp.edu.ar/handle/10915/22685
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
1448-1459
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_ 1846063904358137856
score 13.22299

Publicaciones similares