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 language | English (US) |
|---|---|
| Pages | 70-78 |
| Number of pages | 9 |
| DOIs | |
| State | Published - 1999 |
| Externally published | Yes |
| Event | Proceedings of the 1999 15th International Conference on Data Engineering, ICDE-99 - Sydney, NSW, AUS Duration: Mar 23 1999 → Mar 26 1999 |
Other
| Other | Proceedings of the 1999 15th International Conference on Data Engineering, ICDE-99 |
|---|---|
| City | Sydney, NSW, AUS |
| Period | 3/23/99 → 3/26/99 |
All Science Journal Classification (ASJC) codes
- Software
- Signal Processing
- Information Systems