Access the full text.
Sign up today, get DeepDyve free for 14 days.
P. Boncz, S. Manegold, M. Kersten (1999)
Database Architecture Optimized for the New Bottleneck: Memory Access
S. Manegold, P. Boncz, M. Kersten (2000)
What Happens During a Join? Dissecting CPU and Memory Optimization Effects
(1996)
Direct rambus technology disclosure
P. Boncz, Tim Rühl, F. Kwakkel (1998)
The Drill Down Benchmark
P. Apers, C. Berg, J. Flokstra, P. Grefen, M. Kersten, A. Wilschut (1992)
PRISMA/DB: A Parallel Main Memory Relational DBMSIEEE Trans. Knowl. Data Eng., 4
S. Manegold, P. Boncz, M. Kersten (2002)
Optimizing Main-Memory Join on Modern HardwareIEEE Trans. Knowl. Data Eng., 14
C. Nyberg, Tom Barclay, Z. Cvetanovic, J. Gray, D. Lomet (1994)
AlphaSort: a RISC machine sort
S. Listgarten, Marie-Anne Neimat (1996)
Modelling Costs for a MM-DBMS
(1997)
Mountain View, Calif. Performance Tuning and Optimization for Origin2000 and Onyx2
P. Boncz, M. Kersten (1994)
Monet: An Impressionist Sketch of an Advanced Database System
P. Boncz, W. Quak, M. Kersten (1996)
Monet And Its Geographic Extensions: A Novel Approach to High Performance GIS Processing
G. Copeland, S. Khoshafian (1985)
A decomposition storage modelProceedings of the 1985 ACM SIGMOD international conference on Management of data
A. Shatdal, C. Kant, J. Naughton (1994)
Cache Conscious Algorithms for Relational Query Processing
G. Whitesides (1970)
The Art of Computer ProgrammingNuclear Science and Engineering, 40
S. Mckee, R. Klenke, K. Wright, W. Wulf, M. Salinas, J. Aylor, A. Batson (1998)
Smarter Memory: Improving Bandwidth for Streamed ReferencesComputer, 31
T. Mowry (1994)
Tolerating latency through software-controlled data prefetching
(1995)
Memory bandwidth and machine balance in current high performance computers
P. Boncz, M. Kersten (1999)
MIL primitives for querying a fragmented worldThe VLDB Journal, 8
P. Boncz, A. Wilschut, M. Kersten (1998)
Flattening an object algebra to provide performanceProceedings 14th International Conference on Data Engineering
T. Lehman, M. Carey (1986)
A Study of Index Structures for a Main Memory Database Management System
K. Whang, R. Krishnamurthy (1990)
Query optimization in a memory-resident domain relational calculus database systemACM Trans. Database Syst., 15
P. Valduriez (1987)
Join indicesACM Trans. Database Syst., 12
In the past decade, advances in the 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 such as TLB misses and 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 makes them perform well, which is confirmed by experimental results.
The VLDB Journal – Springer Journals
Published: Dec 1, 2000
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.