A Memory-Constrained Join for Column-Store Main-Memory Databases
Zhen He (La Trobe University)
COMPUTER SYSTEMS SEMINARDATE: 2012-07-04
TIME: 16:00:00 - 17:00:00
LOCATION: CSIT Seminar Room, N101
CONTACT: JavaScript must be enabled to display this email address.
ABSTRACT:
There exists a need for high performance, read-only main-memory database systems for OLAP-style application scenarios. Most of the existing works in this area are centered around the domain of column-store databases, which are particularly well suited to OLAP-style scenarios and have been shown to overcome the memory bottleneck issues that have been found to hinder the more traditional row-store database systems. One of the main database operations these systems are focused on optimizing is the JOIN operation. However, all these existing systems use join algorithms that are designed with the unrealistic assumption that there is unlimited temporary memory available to perform the join. In contrast, we propose a Memory Constrained Join algorithm (MCJoin) which is both high performing and also performs all of its operations within a tight given memory constraint. Extensive experimental results show that MCJoin outperforms a naive memory constrained version of the state-of-the-art Radix-Clustered Hash Join algorithm in all of the situations tested, with margins of up to almost 500%.
BIO:
Dr Zhen He is currently a senior lecturer at La Trobe University. He
obtained his PhD, Honours and Bachelors degrees from the Australian
National University. The main focus of his research has been on
optimizing relational database queries. In particular how various levels
of the memory hierarchy can be exploited to achieve maximum query
performance. He is also interested in flash memory-based databases and
query processing on graphics processors. Finally, Zhen has also worked
