skip to content
Caching and database scaling in distributed shared-nothing information retrieval systems Preview this item
ClosePreview this item
Checking...

Caching and database scaling in distributed shared-nothing information retrieval systems

Author: Anthony Tomasic; Hector Garcia-Molina; Stanford University. Computer Science Department.
Publisher: Stanford, Calif. : Stanford University, Dept. of Computer Science, [1992]
Series: Report (Stanford University. Computer Science Department), STAN- CS-92-1456.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
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,
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Anthony Tomasic; Hector Garcia-Molina; Stanford University. Computer Science Department.
OCLC Number: 28470698
Notes: Cover title.
"December 1992."
Description: 21 pages : illustrations ; 28 cm.
Series Title: Report (Stanford University. Computer Science Department), STAN- CS-92-1456.
Responsibility: by Anthony Tomasic and Hector Garcia- Molina.

Abstract:

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."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(2)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/28470698>
library:oclcnum"28470698"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/28470698>
rdf:typeschema:Book
schema:about
<http://id.worldcat.org/fast/895581>
rdf:typeschema:Intangible
schema:name"Distributed databases"@en
schema:name"Distributed databases."@en
schema:about
schema:about
schema:about
schema:contributor
<http://viaf.org/viaf/239748731>
rdf:typeschema:Organization
schema:name"Stanford University. Computer Science Department."
schema:contributor
schema:creator
schema:datePublished"1992"
schema:description"The second way determines the optimal number of hosts given a fixed database size.""@en
schema:description"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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/30614170>
schema:inLanguage"en"
schema:name"Caching and database scaling in distributed shared-nothing information retrieval systems"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.