We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers to the property that no parameters in an algorithm or a data structure need to be tuned for a specific memory hierarchy for optimality. As a result, EaseDB automatically optimizes the cache performance as well as the overall performance of query processing on any memory hierarchy. We have developed a visualization interface to show the detailed performance of EaseDB in comparison with its cacheconscious counterpart, with both the parameter values in the cacheconscious algorithms and the hardware platforms varied. Categories and Subject Descriptors H.2.4 [Database Management]: Systems--Query Processing, Relational Databases General Terms Algorithms, Measurement, Performance Keywords Cache-oblivious, In-memory query processing