EaseDB: a cache-oblivious in-memory query processor

Authors:
Bingsheng He;Yinan Li;Qiong Luo;Dongqing Yang
Affiliations:
Hong Kong University of Science and Technology, Hong Kong, Hong Kong;Peking University, Beijing, China;Hong Kong University of Science and Technology, Hong Kong, Hong Kong;Peking University, Beijing, China
Venue:
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Year:
2007

Citing 3
Cited 1

Database Management Systems

Database Management Systems
DBMSs on a Modern Processor: Where Does Time Go?

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Database architectures for new hardware

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Cache-oblivious databases: Limitations and opportunities

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose to demonstrate EaseDB, the first cache-oblivious queryprocessor for in-memory relational query processing. The cache-oblivious 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 cache-conscious counterpart, with both the parameters in the cache-conscious algorithms and the hardware platforms varied.