Retrieval performance of a distributed text database utilizing a parallel processor document server

ABSTRACT

This paper considers text retrieval systems which store extremely huge amounts of text while providing a multi-user retrieval service for a large customer base. Due to the severe I/O demands of such a system, it is usually beneficial if not necessary to utilize a multi-processor system with multiple I/O facilities in an effort to increase the parallel I/O activity, the objective being to lower search response times. After defining the problem, we model a solution and show that the application can be handled in a very effective fashion by a multi-processor system with a simple LAN-based topology. The final discussion describes a type of functional splitting which, if done in a careful manner, helps improve search response time.

REFERENCES

• 1: Bayer, R. and McCreight, E., "Organization and maintenance of large ordered indexes," Acta Informatica, vol. 1, no. 3, 1972, pp. 173-189.
• 2: Burkowski, F. J., "Textriever: A database engine for tagged text," To appear.
• 3: Burkowski, F. J., "Surrogate subsets: A free space management strategy for the index of a text retrieval system,"To appear.
• 4: Chris Faloutsos , Stavros Christodoulakis, Signature files: an access method for documents and its analytical performance evaluation, ACM Transactions on Information Systems (TOIS), v.2 n.4, p.267-288, Oct. 1984 [doi>10.1145/2275.357411]
• 5: Faloutsos, C., "Signature files: An integrated access method for text and attributes, suitable for optical disk storage,"UMIACS-TR-87-23, CS-tr-1867, Dept. of Comp. Sci. and Inst. for Adv. Comp. Studies, Univ. of Maryland, June 1987,29 pages.
• 6: Garth A. Gibson, Performance and Reliability in Redundant Arrays of Inexpensive Disks, University of California at Berkeley, Berkeley, CA, 1999
• 7: Per-Åke Larson, A Method for Speeding Up Text Retrieval, Databases for Business and Office Applications, Database Week, p.117-123, May 23-26, 1983 [doi>10.1145/647004.711872]
• 8: Lee, D. L., "On distributed signature file design", OSU- CISRC-6/87-TR20, Dept. of Comp. & Inf. Sci., The Ohio State Univ., Columbus, Ohio, (1987) 9 pages.
• 9: Jayadev Misra, Distributed discrete-event simulation, ACM Computing Surveys (CSUR), v.18 n.1, p.39-65, March 1986 [doi>10.1145/6462.6485]
• 10: David A. Patterson , Garth Gibson , Randy H. Katz, A case for redundant arrays of inexpensive disks (RAID), Proceedings of the 1988 ACM SIGMOD international conference on Management of data, p.109-116, June 01-03, 1988, Chicago, Illinois, United States
• 11: Preiss, B. R., "The yaddes distributed discrete event simulation specification language and execution environments", CCNG TR-E- 18 1, Computer Communications Networks Group, University of Waterloo, Jan. 1989. (Also to appear in the Distributed / Parallel Simulation part of the 1989 Eastern Multiconference of the Society for Computer Simulation).
• 12: Preiss, B. R., Loucks, W. M. and Hamacher, V. C., "A unified modelling methodology for performance evaluation of distributed discrete event simulation mechanisms", CCNG TR-E-180, Computer Communications Networks Group, University of Waterloo, Jan. 1989.
• 13: Zipf, G. K., "Human behaviour and the principle of least effort", Addison-Wesley, Boston, 1949.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL

Additional Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT

General Terms:
Design, Performance, Theory