In the past decade, advances in speed of commodity CPUs have far out-paced advances in memory latency. Main-memory access is therefore increasingly a performance bottleneck for many computer applications, including database systems. In this article, we use a simple scan test to show the severe impact of this bottleneck. The insights gained are translated into guidelines for database architecture; in terms of both data structures and algorithms. We discuss how vertically fragmented data structures optimize cache performance on sequential data access. We then focus on equi-join, typically a random-access operation, and introduce radix algorithms for partitioned hash-join. The performance of these algorithms is quantified using a detailed analytical model that incorporates memory access cost. Experiments that validate this model were performed on the Monet database system. We obtained exact statistics on events like TLB misses, L1 and L2 cache misses, by using hardware performance counters found in modern CPUs. Using our cost model, we show how the carefully tuned memory access pattern of our radix algorithms make them perform well, which is confirmed by experimental results.

Additional Metadata
THEME Information (theme 2)
Publisher Very Large Data Base Endowment.
Conference International Conference on Very Large Databases
Citation
Boncz, P.A, Manegold, S, & Kersten, M.L. (1999). Database architecture optimized for the new bottleneck: Memory access. In Proceedings of International Conference on Very Large Databases 1999 (VLDB 25) (pp. 54–65). Very Large Data Base Endowment.