Please use this identifier to cite or link to this item:
|Title:||Cache-on-demand: Recycling with certainty|
|Authors:||Tan, K.-L. |
Beng Chin Ooi
|Source:||Tan, K.-L.,Goh, S.-T.,Beng Chin Ooi (2001). Cache-on-demand: Recycling with certainty. Proceedings - International Conference on Data Engineering : 633-640. ScholarBank@NUS Repository.|
|Abstract:||Queries posed to a database usually access some common relations, or share some common sub-expressions. In this paper, we examine the issue of caching using a novel framework, called cache-on-demand (COD). CoD views in-termediate/final answers of existing running queries as virtual caches that an incoming query can exploit. Those caches that are beneficial may then be materialized for the incoming query. Such an approach is essentially non-speculative: the exact cost of investment and the return on investment are known, and the cache is certain to be reused! We addressed several issues for CoD to be realized. We also propose two optimizing strategies, Conform-CoD and Scramble-CoD, and evaluated their performance. Our results show that CoD-based schemes can provide substantial performance improvement.|
|Source Title:||Proceedings - International Conference on Data Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.