A case for fractured mirrors

Authors:
Ravishankar Ramamurthy;David J. DeWitt;Qi Su
Affiliations:
Department of Computer Sciences, University of Wisconsin-Madison, 1210 W. Dayton Street, WI 53706, Madison, USA;Department of Computer Sciences, University of Wisconsin-Madison, 1210 W. Dayton Street, WI 53706, Madison, USA;Department of Computer Sciences, University of Wisconsin-Madison, 1210 W. Dayton Street, WI 53706, Madison, USA
Venue:
The VLDB Journal — The International Journal on Very Large Data Bases
Year:
2003

Citing 20
Cited 9

Multi-disk management algorithms

SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Data placement in Bubba

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Write-only disk caches

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Experiences building the open OODB query optimizer

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Doubly distorted mirrors

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Shoring up persistent applications

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Query optimization

ACM Computing Surveys (CSUR)
Improved query performance with variant indexes

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Database management systems

Database management systems
The five-minute rule ten years later, and other computer storage rules of thumb

ACM SIGMOD Record
Performance characterization of a Quad Pentium Pro SMP using OLTP workloads

Proceedings of the 25th annual international symposium on Computer architecture
A decomposition storage model

SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Differential files: their application to the maintenance of large databases

ACM Transactions on Database Systems (TODS)
Designing and mining multi-terabyte astronomy archives: the Sloan Digital Sky Survey

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A Query Processing Strategy for the Decomposed Storage Model

Proceedings of the Third International Conference on Data Engineering
Flattening an Object Algebra to Provide Performance

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
DBMSs on a Modern Processor: Where Does Time Go?

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Disk Shadowing

VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Storage and Querying of E-Commerce Data

Proceedings of the 27th International Conference on Very Large Data Bases
Weaving Relations for Cache Performance

Proceedings of the 27th International Conference on Very Large Data Bases

Information-theoretic tools for mining database structure from large data sets

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Integrating compression and execution in column-oriented database systems

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Read-Optimized, Cache-Conscious, Page Layouts for Temporal Relational Data

DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Avoiding version redundancy for high performance reads in temporal databases

Proceedings of the 4th international workshop on Data management on new hardware
SPAX --- PAX with Super-Pages

ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
Positional update handling in column stores

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Divergent physical design tuning for replicated databases

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Executing web application queries on a partitioned database

WebApps'12 Proceedings of the 3rd USENIX conference on Web Application Development
Towards a hybrid row-column database for a cloud-based medical data management system

Proceedings of the 1st International Workshop on Cloud Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract.The decomposition storage model (DSM) vertically partitions all attributes of a table and has excellent I/O behavior when the number of attributes accessed by a query is small. It also has a better cache footprint than the standard storage model (NSM) used by most database systems. However, DSM incurs a high cost in reconstructing the original tuple from its partitions. We first revisit some of the performance problems associated with DSM and suggest a simple indexing strategy and compare different reconstruction algorithms. Then we propose a new mirroring scheme, termed fractured mirrors, using both NSM and DSM models. This scheme combines the best aspects of both models, along with the added benefit of mirroring to better serve an ad hoc query workload. A prototype system has been built using the Shore storage manager, and performance is evaluated using queries from the TPC-H workload.