A parallel view for search engines
To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of n-tillions of queries every day. Despite the importance of large-scale search engines on the Web, very little academi...
Guardado en:
| Autores principales: | Gil Costa, Graciela Verónica, Persico, Andrea, Printista, Alicia Marcela |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2005
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23175 |
| Aporte de: |
Ejemplares similares
-
Using parallel pivot vs. clustering-based techniques for web engines
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2007) -
A parallel search algorithm for the SAT
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2005) -
Buckets inverted lists for a search engine with BSP
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2006) -
Multimedia web searches using static SAT
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2006) -
A parallel search algorithm for the SAT
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2005)