Cooperative caching in append-only databases with hot spots

Aman Sinha, Craig Chase, Munir Cochinwala

Research output: Contribution to conferencePaperpeer-review

Abstract

We measure the performance of several cooperative caching policies for a database with hot spots. The workload consists of queries and append-only update transactions, and is modeled after a financial database of stock (historical) trading information. We show that cooperative caching is effective for this application. We show that selecting the correct set of peer servers when servicing a cache miss is crucial to achieving high performance, and we demonstrate a greedy algorithm that performs close to optimal for this workload. We also evaluate several cache replacement policies and show that a 2nd-chance algorithm performs best. In a 2nd-chance algorithm, replaced pages are transferred to a peer server rather than being discarded. When a page is selected for replacement a 2nd time, the page is discarded. Our results can be applied in the design of 'proxy' servers for databases or web servers where a layer of proxy servers are used to scale the system performance.

Original languageEnglish (US)
Pages70-78
Number of pages9
DOIs
StatePublished - Jan 1 1999
Externally publishedYes
EventProceedings of the 1999 15th International Conference on Data Engineering, ICDE-99 - Sydney, NSW, AUS
Duration: Mar 23 1999Mar 26 1999

Other

OtherProceedings of the 1999 15th International Conference on Data Engineering, ICDE-99
CitySydney, NSW, AUS
Period3/23/993/26/99

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Information Systems

Fingerprint Dive into the research topics of 'Cooperative caching in append-only databases with hot spots'. Together they form a unique fingerprint.

Cite this