Caching and Database Scaling in Distributed Shard-Nothing Information Retrieval Systems.

Anthony Tomasic, Hector Garcia-Molina: Caching and Database Scaling in Distributed Shard-Nothing Information Retrieval Systems. SIGMOD Conference 1993: 129-138

@inproceedings{DBLP:conf/sigmod/TomasicG93,
  author    = {Anthony Tomasic and
               Hector Garcia-Molina},
  editor    = {Peter Buneman and
               Sushil Jajodia},
  title     = {Caching and Database Scaling in Distributed Shard-Nothing Information
               Retrieval Systems},
  booktitle = {Proceedings of the 1993 ACM SIGMOD International Conference on
               Management of Data, Washington, D.C., May 26-28, 1993},
  publisher = {ACM Press},
  year      = {1993},
  pages     = {129-138},
  ee        = {http://doi.acm.org/10.1145/170035.170063, db/conf/sigmod/TomasicG93.html},
  crossref  = {DBLP:conf/sigmod/93},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

A common class of existing information retrieval system provides access to abstracts. For example Stanford University, through its FOLIO system, provides access to the INSPEC database of abstracts of the literature on physics, computer science, electrical engineering, etc. In this paper this database is studied by using a trace-driven simulation. We focus on physical index design, inverted index caching, and database scaling in a distributed shared-nothing system. All three issues are shown to have a strong effect on response time and throughput. Database scaling is explored in two ways. One way assumes an "optimal" configuration for a single host and then linearly scales the database by duplicating the host architecture as needed. The second way determines the optimal number of hosts given a fixed database size.

Copyright © 1993 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

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 1, SIGMOD '93-'97" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/smod9397 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

Peter Buneman, Sushil Jajodia (Eds.): Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 26-28, 1993. ACM Press 1993

, SIGMOD Record 22(2), June 1993
Contents

Online Edition: ACM Digital Library

[Index Terms]
[Full Text in PDF Format, 1045 KB]

References

[1]: Forbes J. Burkowski: Retrieval Performance of a Distributed Text Database Utilizing a Parallel Processor Document Server. DPDS 1990: 71-79
[2]: ...
[3]: Janey K. Cringean, Roger England, Gordon A. Manson, Peter Willett: Parallel Text Searching in Serial Files Using a Processor Farm. SIGIR 1990: 429-453
[4]: ...
[5]: ...
[6]: Christos Faloutsos: Access Methods for Text. ACM Comput. Surv. 17(1): 49-74(1985)
[7]: ...
[8]: Jim Gray, Andreas Reuter: Transaction Processing: Concepts and Techniques. Morgan Kaufmann 1993, ISBN 1-55860-190-2
Contents
[9]: ...
[10]: ...
[11]: Craig Stanfill: Partitioned Posting Files: A Parallel Inverted File Structure for Information Retrieval. SIGIR 1990: 413-428
[12]: ...
[13]: ...
[14]: Anthony Tomasic, Hector Garcia-Molina: Performance of Inverted Indices in Distributed Text Document Retrieval Systems. PDIS 1993: 8-17