Berthier Ribeiro-Neto
Marden S. Neubert
Nivio Ziviani
- 1.T. Anderson, D. Culler, and D. Patterson. A case for NOW (network of workstations). IEEE Micro, 15(1):54-64, February 1995. Google Scholar
Digital Library
- 2.M.D. Aradjo, G. Navarro, and N. Ziviani. Large text searching allowing errors. In Ricardo Baeza-Yates, editor, IV South American Workshop on String Processing- WSP97- International Informatics Series, volume 8, pages 2-20, Valpara/so, Chile, November 1997. Carleton University Press.Google Scholar
- 3.Ramurti Barbosa. Desempenho de consultas em bibliotecas digitais distribuidas, 1998. Master thesis. In Portuguese.Google Scholar
- 4.D.E. Culler, R.M. Karp, D. Patterson, A. Sahay, E.E. Santos, K.E. Schauser, R. Subramonian, and T.v. Eicken. Logp: A practical model of parallel computation. Communications of the ACM, 39(11):78-85, 1996. Google ScholarDigital Library
- 5.Z.J. Czech, G. Havas, and B.S. Majewski. An optimal algorithm for generating minimal perfect hash functions. Information Processing and Letters, 43:257-264, 1992. Google ScholarDigital Library
- 6.J. Heaps. Information Retrieval- Compfftational and Theoretical Aspects. Academic Press, NY, 1978. Google ScholarDigital Library
- 7.A. Moffat and T.A.H. Bell. In situ generation of compressed inverted files. Journal of the American Society for Information Science, 46(7):537-550, 1995. Google ScholarDigital Library
- 8.M. Persin. Document filtering for fast ranking. In Proc. of the 17th A CM SIGIR Conference, pages 339-348. Springer Verlag, July 1994. Google ScholarDigital Library
- 9.M. Persin, J. Zobel, and R. Sacks-Davis. Filtered document retrieval with frequency-sorted indexes. Journal o.f the American Society .for Information Science, 47(10):749-764, 1996. Google ScholarDigital Library
- 10.B. Ribeiro-Neto and R. Barbosa. Query performance for tightly coupled distributed digital libraries. ACM Digital Libraries Conference, 1998. Google ScholarDigital Library
- 11.B. Ribeiro-Neto, J.P. Kitajima, G. Navarro, C. Santana, and N. Ziviani. Parallel generation of inverted files for distributed text collections. In Proceedings o/ the X VIII International Conference of the Chilean Society of Computer Science (SCCC'98), pages 149-157, Antofagasta, Chile, 1998. Google ScholarDigital Library
- 12.T.B. Tabe, J.P. Hardwick, and Q.F. Stout. Statistical analysis of communication time on the IBM SP2. Computing Science and Statistics, 27:347-351, 1995.Google Scholar
- 13.I.H. Witten, A. Moffat, and T.C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Van Nostrand Reinhold, New York, 1994. Google ScholarDigital Library
Index Terms
- Efficient distributed algorithms to build inverted files
Recommendations
Compressing Inverted Files
AbstractResearch into inverted file compression has focused on compression ratio—how small the indexes can be. Compression ratio is important for fast interactive searching. It is taken as read, the smaller the index, the faster the search.
The premise “...
Comments