ACM SIGMOD Anthology SIGIR dblp.uni-trier.de

On the Allocation of Documents in Multiprocessor Information Retrieval Systems.

Ophir Frieder, Hava T. Siegelmann: On the Allocation of Documents in Multiprocessor Information Retrieval Systems. SIGIR 1991: 230-239
@inproceedings{DBLP:conf/sigir/FriederS91,
  author    = {Ophir Frieder and
               Hava T. Siegelmann},
  editor    = {Abraham Bookstein and
               Yves Chiaramella and
               Gerard Salton and
               Vijay V. Raghavan},
  title     = {On the Allocation of Documents in Multiprocessor Information
               Retrieval Systems},
  booktitle = {Proceedings of the 14th Annual International ACM SIGIR Conference
               on Research and Development in Information Retrieval. Chicago,
               Illinois, USA, October 13-16, 1991 (Special Issue of the SIGIR
               Forum)},
  publisher = {ACM},
  year      = {1991},
  isbn      = {0-89791-448-1},
  pages     = {230-239},
  ee        = {db/conf/sigir/FriederS91.html},
  crossref  = {DBLP:conf/sigir/91},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

Information retrieval is the selection of documents that are potentially relevant to a user's information need. Given the vast volume of data stored in modern information retrieval systems, searching the document database requires vast computational resources. To meet these computational demands, various researchers have developed parallel information retrieval systems. As efficient exploitation of parallelism demands fast access to the documents, data organization and placement significantly affect the total processing time. We describe and evaluate a data placement strategy for distributed memory, distributed I/O multicomputers. Initially, a formal description of the Multiprocessor Document Allocation Problem (MDAP) and a proof that MDAP is NP Complete are presented. A document allocation algorithm for MDAP based on Genetic Algorithms is developed. This algorithm assumes that the documents are clustered using any one of the many clustering algorithms. We define a cost function for the derived allocation and evaluate the performance of our algorithm using this function. As part of the experimental analysis, the effects of varying the number of documents and their distribution across the clusters as well the exploitation of various differing architectural interconnection topologies are studied. We also experiment with the several parameters common to Genetic Algorithms, e.g., the probability of mutation and the population size.

Copyright © 1991 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 3, SIGIR, DASFAA'97, OODBS'86" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Abraham Bookstein, Yves Chiaramella, Gerard Salton, Vijay V. Raghavan (Eds.): Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Chicago, Illinois, USA, October 13-16, 1991 (Special Issue of the SIGIR Forum). ACM 1991, ISBN 0-89791-448-1
Contents BibTeX

Online Edition: ACM Digital Library

Citation page

Referenced by

  1. Ophir Frieder, Chaitanya K. Baru: Site and Query Scheduling Policies in Multicomputer Database Systems. IEEE Trans. Knowl. Data Eng. 6(4): 609-619(1994)
  2. Anthony Tomasic, Hector Garcia-Molina: Query Processing and Inverted Indices in Shared-Nothing Document Information Retrieval Systems. VLDB J. 2(3): 243-275(1993)
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:38:39 2009