Adaptive Precision Setting for Cached Approximate Values

Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cached approximations must be of appropriate precision: approximations that are too precise easily become invalid, requiring frequent refreshing, while overly imprecise approximations are likelyto be useless to applications, which must then bypass the cache. We present a parameterized algorithm for adjusting the precision of cached approximations adaptively to achieve the best performance as data values, precision requirements, or workload vary. We consider interval approximations to numeric values but our ideas can be extended to other kinds of data and approximations. Our algorithm strictly generalizes previous adaptive caching algorithms for exact copies: we can set parameters to require that all approximations be exact, in which case our algorithm dynamically chooses whether or not to cache each data value. W...

• Type: Conference
• Year: 2001
• Where: SIGMOD
• Authors: Chris Olston, Boon Thau Loo, Jennifer Widom
• Keywords: Database, Exact Caching, Imprecise Approximations, Interval Approximations, SIGMOD 2001