Skip to main content

Parallel computations in information retrieval

  • Nonnumerical Parallel Algorithms
  • Conference paper
  • First Online:
Conpar 81 (CONPAR 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 111))

Included in the following conference series:

Abstract

Conventional information retrieval processes are largely based on data movement, pointer manipulations and integer arithmetic; more refined retrieval algorithms may in addition benefit from substantial computational power.

In the present study a number of parallel processing methods are described that serve to enhance retrieval services. In conventional retrieval environments parallel list processing and parallel search facilities are of greatest interest. In more advanced systems, the use of array processors also proves beneficial. Various information retrieval processes are examined and evidence is given to demonstrate the usefulness of parallel processing and fast computational facilities in information retrieval.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.Y.W. Su, Cellular Logic Devices: Concepts and Applications, Computer, Vol. 12, No. 3, March 1979, p. 11–25.

    Google Scholar 

  2. G.P. Copeland, G.J. Lipovski, and S.Y.W. Su, The Architecture of CASSM: A Cellular System for Non-numeric Processing, Proceedings of the First Annual Symposium on Computer Architecture, Association for Computing Machinery, New York, December 1973, p. 121–125.

    Google Scholar 

  3. P.J. Sadowski and S.A. Schuster, Exploiting Parallelism in a Relational Associative Processor, Proceedings of the Fourth Workshop on Computer Architecture for Non-numeric Processing, Association for Computing Machinery, New York, August 1978, p. 99–109.

    Chapter  Google Scholar 

  4. S.A. Schuster, H.B. Nguyen, E.A. Ozkarahan and K.C. Smith, RAP2-An Associative Processor for Data Bases and Its Applications, IEEE Transactions on Computers, Vol. C-28, No. 6, June 1979, p. 446–458.

    Google Scholar 

  5. S.A. Schuster, H.B. Nguyen, E.A. Ozkarahan and K.C. Smith, RAP2-An Associative Processor for Data Bases, Proceedings of the Fifith Annual Symposium on Computer Architecture, Association for Computing Machinery, New York, April 1978, p. 52–59.

    Google Scholar 

  6. C.R. DeFiore and P.B. Berra, A quantitative Analysis of the Utilization of Associative Memories in Data Management, IEEE Transactions on Computers, Vol. C-23, No. 2, February 1979, p. 121–133.

    Google Scholar 

  7. E.S. Davis, STARAN Parallel Processor Software, AFIPS Conference Proceedings, Vol. 43, AFIPS Press, Montvale, New Jersey, 1974, p. 16–22.

    Google Scholar 

  8. J.A. Rudolph, A Production Implementation of an Associative Array Processor — STARAN, AFIPS Conference Proceedings, Vol. 41, Part 1, AFIPS Press, Montvale, New Jersey, 1972, p. 229–241.

    Google Scholar 

  9. D.E. Knuth, The Art of Programming, Vol. 3, Searching and Sorting, Addison Wesley Publishing Company, Reading, Massachusetts, 1973, p. 224–230.

    Google Scholar 

  10. L.A. Hollaar, A Design for a List Merging Network, IEEE Transactions on Computters, Vol. C-28, No. 6, June 1979, p. 406–413.

    Google Scholar 

  11. W.H. Stellhorn, An Inverted File Processor for Information Retrieval, IEEE Transactions on Computers, Vol. C-26, No. 12, December 1977, p. 1258–1267.

    Google Scholar 

  12. L.A. Hollaar and W.H. Stellhorn, A Specialized Architecture for Textual Retrieval, AFIPS Conference Proceedings, Vol. 46, AFIPS Press, Montvale, New Jersey, 1977, p. 697–702.

    Google Scholar 

  13. L.A. Hollaar, Specialized Merge Processor Networks for Combining Sorted Lists, ACM Transactions on Data Base Systems, Vol. 3, No. 3, September 1978, p. 272–284.

    Article  Google Scholar 

  14. G. Salton, editor, The Smart Retrieval System—Experiments in Automatic Document Processing, Prentice Hall Inc., Englewood Cliffs, New Jersey, 1971.

    Google Scholar 

  15. G. Salton, Dynamic Information and Library Processing, Prentice Hall Inc., Englewood Cliffs, New Jersey, 1975.

    Google Scholar 

  16. A.L. Robinson, Array Processors: Maxi-Number Crunching for a Mini Price, Science, Vol. 203, January 12, 1979, p. 156–160.

    Article  Google Scholar 

  17. C.N. Winningstad, Scientific Computing on a Budget, Datamation, Vol. 24, No. 10, October 1978, p. 159–173.

    Google Scholar 

  18. G. Salton, D. Bergmark, and A. Hanushevsky, Using Array Processors in Information Retrieval, Technical Report,Computer Science Department Cornell University, Ithaca, New York 1980.

    Google Scholar 

  19. D. Bergmark and A. Hanushevsky, Document Retrieval: A Novel Application for the AP, FPS User's Group Meeting, Los Angeles, California, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

W. Brauer P. Brinch Hansen D. Gries C. Moler G. Seegmüller J. Stoer N. Wirth Wolfgang Händler

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salton, G., Bergmark, D. (1981). Parallel computations in information retrieval. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105128

Download citation

  • DOI: https://doi.org/10.1007/BFb0105128

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10827-6

  • Online ISBN: 978-3-540-38715-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics