Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
A Method for Speeding Up Text Retrieval
Databases for Business and Office Applications, Database Week
Performance and Reliability in Redundant Arrays of Inexpensive Disks
Performance and Reliability in Redundant Arrays of Inexpensive Disks
Caching and database scaling in distributed shared-nothing information retrieval systems
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Performance evaluation of a distributed architecture for information retrieval
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
Query performance for tightly coupled distributed digital libraries
Proceedings of the third ACM conference on Digital libraries
ACM Transactions on Information Systems (TOIS)
Partial collection replication versus caching for information retrieval systems
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Computer Networks: The International Journal of Computer and Telecommunications Networking
Query processing and inverted indices in shared: nothing text document information retrieval systems
The VLDB Journal — The International Journal on Very Large Data Bases - Parallelism in database systems
A case study of distributed information retrieval architectures to index one terabyte of text
Information Processing and Management: an International Journal
Information Processing and Management: an International Journal
A case study of distributed information retrieval architectures to index one terabyte of text
Information Processing and Management: an International Journal
Hi-index | 0.00 |
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.