apavlo/h-store — Issue #21: Java-based Query Cache
Author: apavlo
Created: 2012-01-11 19:20:14+00:00
State: open
Labels: cs227

1. Implement a query cache for the `PartitionExecutor`. Each cache invocation will be unique per partition, thus no synchronization or locking protections are needed.

2. Analyze the catalog to pre-compute which queries can be cached and which queries invalidate cached items. Start off with simple queries (i.e., single-key look-ups) that return columns that are not modified by any other query. Such queries can always be cached. Then add support for

2. Compare performance differences for different eviction strategies for the cache. Examples include least-recently used, most-recently used, and least-frequently used.

Students will compare the performance gains of their cache using H-Store's built-in benchmarks to ensure that the overhead of computing