Abstract

We propose a new storage model called MBSM (Multiresolution Block Storage Model) for laying out tables on disks. MBSM is intended to speed up operations such as scans that are typical of data warehouse workloads. Disk blocks are grouped into “super-blocks, ” with a single record stored in a partitioned fashion among the blocks in a superblock. The intention is that a scan operation that needs to consult only a small number of attributes can access just those blocks of each super-block that contain the desired attributes. To achieve good performance given the physical characteristics of modern disks, we organize super-blocks on the disk into fixed-size “mega-blocks. ” Within a megablock, blocks of the same type (from various super-blocks) are stored contiguously. We describe the changes needed in a conventional database system to manage tables using such a disk organization. We demonstrate experimentally that MBSM outperforms competing approaches such as NSM (N-ary Storage Model), DSM (Decomposition Storage Model) and PAX (Partition Attributes Across), for I/O bound decision-support workloads consisting of scans in which not all attributes are required. This improved performance comes at the expense of single-record insert and delete performance; we quantify the trade-offs involved. Unlike DSM, the cost of reconstructing a record from its partitions is small. MBSM stores attributes in a vertically partitioned manner similar to PAX, and thus shares PAX’s good CPU cache behavior. We describe methods for mapping attributes to blocks within super-blocks in order to optimize overall performance, and show how to tune the super-block and mega-block sizes. 1

Citations

434	An introduction to disk drive modeling - Ruemmler, Wilkes - 1994
348	Bounds on multiprocessing timing anomalies - Graham - 1969
246	Database Management Systems - Ramakrishnan, Gehrke - 2003
231	A.R.: Optimization and approximation in deterministic sequencing and scheduling: A survey - Graham, Lawler, et al. - 1979
165	DBMSs on a modern processor: Where does time go - Ailamaki, DeWitt, et al. - 1999
139	Improved query performance with variant indexes - O’Neil, Quass - 1997
131	A decomposition storage model - Copeland, Khoshafian - 1985
109	Database architecture optimized for the new bottleneck: Memory access - Boncz, Manegold, et al. - 1999
89	Bounds for certain multiprocessor anomalies - Graham
83	2001,Weaving relations for cache performance - Ailamaki, DeWitt, et al.
75	Cache conscious algorithms for relational query processing - Shatdal, Kant, et al. - 1994
43	A Case for Fractured Mirrors - Ramamurthy, DeWitt, et al. - 2002
22	What happens during a join? Dissecting CPU and memory optimization effects - Manegold, Boncz, et al. - 2000
17	An Effective Approach to Vertical Partitioning for Physical Design of Relational Databases - Cornell, Yu - 1990
1	The PC guide - Kozierok - 2002
1	Cheetah X15 product manual - Corp - 2002