Ir al contenido

Documat


Buckets inverted lists for a search engine with BSP

  • Autores: Graciela Verónica Gil Costa, Alicia Marcela Printista, Mauricio Marin Caihuan Árbol académico
  • Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 6, Nº. 1, 2006 (Ejemplar dedicado a: Seventeenth Issue), págs. 28-35
  • Idioma: inglés
  • Enlaces
  • Resumen
    • Most information in science, engineering and business has been recorded in form of text. This information can be found online in the World-Wide-Web. One of the major tools to support information access are the search engines which usually use information retrieval techniques to rank Web pages based on a simple query and an index structure like the inverted lists. The retrieval models are the basis for the algorithms that score and rank the Web pages. The focus of this presentation is to show some inverted lists alternatives, based on buckets, for an information retrieval system. The main interest is how query performance is effected by the index organization on a cluster of PCs. The server design is effected on top of the parallel computing model Bulk Synchronous Parallel-BSP.

  • Referencias bibliográficas
    • References [1] Serge Abiteboul and Victor Vianu. Queries and Computation on the Web. Proceedings of the International Congerence on Database...
    • [2] C. S. Badue. Distributed query processing using partitioned inverted files. Master's thesis, Federal University of Minas Gerais, Belo...
    • [3] R. A. Barbosa. Departameho de consultas em bibliotecas digitais fortemente aclopadas.Master's thesis, Federal Univerity of Minas Gerais,...
    • [4] R. Baeza and B. Ribeiro. Modern Information Retrieval.Addison-Wesley. 1999.
    • [5] R. Baeza-Yates and A. Moffat and G. Navarro. Searching Large Text Collectionsî, Handbook of Massive Data Sets,Kluwer Academic Publishers,...
    • [6] T. Berners-Lee, R. Cailliau, A. Luotonen, H. Nielsen, and A. Secret.The World-Wide Web. Comm. of the ACM, 37(8):76-82,aug 1994.
    • [7] G. V. Gil Costa. Procesamiento Paralelo de Queries sobre Base de Datos Textuales. Tesis de licenciatura. Universidad Nacional de San Luis....
    • [8] Veronica Gil Costa, A.Marcela Printista. Estrategia de Buckets para Listas Invertidas Paralelas. XII Jornadas Chilenas de computacion....
    • [9] V. Gil Costa, M. Printista y M. Marín. Modelizacion de Listas Invertidas Paralelasî. X Congreso Argentino de Ciencias de la Computacion,...
    • [10] M. Goudreau and J. Hill and K. Lang and B. McColl and S. Rao. A Proposal for the BSP Worldwide Standard Library. http://www.bsp-worldwide.org/standar/stand2.html....
    • [11] A. MacParlane, J.A.McCanny S.E. Robertson. ìParallel Search Using Inverted Filesî. In the 7th. International Symposium on String Processing...
    • [12] M. Marin, C. Bonacic y S. Casas. ìAnalysis of two indexing structures for text databasesî, Actas del VIII Congreso Argentino de Ciencias...
    • [13] M. Persin, J. Zobel, R.Sacks-Davis.ìFilteres Document Retrieval with Frequency-Stores Indexesî. Journal of the American Society for Information...
    • [14] B.A. Ribeiro-Neto and R.A. Barbosa. ìQuery performance for tightly coupled distributed digital librariesî. In Third ACM Conference on...
    • [15] C. Santos Badue, R. Baeza-Yates, B. Ribeiro-Neto, and N. Ziviani. ìConcurrent query processing using distributed inverted files. In the...
    • [16] D.B. Skillcorn and J. Hill and W.F. McColl. ìQuestions and Answers about BSPî. Oxford University Computing Laboratory. PRG-TR-15-96....
    • [17] L. Valiant. ìA Bridging Model for Parallel Computationî. Communications of the ACM, Vol. 33, Pp 103-111, 1990.
    • [18] I. Qitten, A. Mof fat and T. C. Bell. ìManaging Gigabytes- Compressing and Indexing Documents and Imagesî. Morgan Kaufmann Publishers,...
    • [19] WWW .BSP and Worldwilde Standard, http://www.bsp-worldwide.org
    • [20] WWW.BSPPUB Library ar Paderborn Univertity, http://www.uni-paderborn.de/bsp

Fundación Dialnet

Mi Documat

Opciones de artículo

Opciones de compartir

Opciones de entorno