A case for fractured mirrors
The VLDB JournalPublished 1 August 2003
Ravishankar Ramamurthy, David J. DeWitt, Qi Su
Citations146
SJR quartileQ1
SJR score1.18
SNIP2.29
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new mirroring scheme is proposed, termed fractured mirrors, using both NSM and DSM models, that combines the best aspects of both models, along with the added benefit of mirroring to better serve an ad hoc query workload.
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.
Keywords
Computer Science
Elsevier eBooksDatabase Management Systems
1,336 Citations2014
New to this edition are the early coverage of the ER model, new chapters on Internet databases, data mining, and spatial databases, and a new supplement on practical SQL assignments (with solutions for instructors' use).
Improved query performance with variant indexes
482 Citations1997Patrick E. O׳Neil, Dallan Quass
A new method whereby multi-dimensional group-by queries, reminiscent of OLAP/Datacube queries but with more flexibility, can be very efficiently performed is introduced.
Infoscience (Ecole Polytechnique Fédérale de Lausanne)DBMSs on a Modern Processor: Where Does Time Go?
455 Citations1999Anastassia Ailamaki, David J. DeWitt +2 more
This paper examines four commercial DBMSs running on an Intel Xeon and NT 4.0 and introduces a framework for analyzing query execution time, and finds that database developers should not expect the overall execution time to decrease significantly without addressing stalls related to subtle implementation issues.
Shoring up persistent applications
421 Citations1994Michael J. Carey, David J. DeWitt +10 more
The goals and motivation for SHORE are given, and some novel aspects of the SHORE architecture are described, including a symmetric peer-to-peer server architecture, server customization through an extensible value-added server facility, and support for scalability on multiprocessor systems.
A decomposition storage model
421 Citations1985George P. Copeland, Setrag Khoshafian
This report examines the relative advantages of a storage model based on decomposition over conventional n-ary storage models and claims that neither is clearly better until a closer analysis is made along the many dimensions of a database system.
Weaving Relations for Cache Performance
326 Citations2001Anastassia Ailamaki, David J. DeWitt +2 more
This paper proposes a new data organization model called PAX (Partition Attributes Across), that significantly improves cache performance by grouping together all values of each attribute within each page, and demonstrates that in-page data placement is the key to high cache performance.
ACM SIGMOD RecordData placement in Bubba
302 Citations1988George P. Copeland, William Alexander +2 more
ACM Transactions on Database SystemsDifferential files
302 Citations1976Dennis G. Severance, Guy M. Lohman
This paper describes a differential database representation which is shown to be an efficient method for storing large and volatile databases.
ACM Computing SurveysQuery optimization
241 Citations1996Yannis Ioannidis
Imagine yourself standing in front of an exquisite restaurant with numerous delicacies, but you need to decide in what order to try them all out, to maximize the overall pleasure of your palate.
International Symposium on Computer ArchitecturePerformance characterization of a Quad Pentium Pro SMP using OLTP workloads
230 Citations1998Kimberly Keeton, David A. Patterson +3 more
Multi-disk management algorithms
195 Citations1987Miron Livny, Setrag Khoshafian +1 more
It is shown that declustering (spreading each file across several disks) is inherently better than clustering (placing each file on a single disk) due to a number of reasons including parallelism and uniform load on all disks.
ACM SIGMOD RecordDesigning and mining multi-terabyte astronomy archives
188 Citations2000Alexander S. Szalay, Peter Kunszt +4 more
Storage and Querying of E-Commerce Data
178 Citations2001Rakesh Agrawal, Amit Somani +1 more
This work represents objects in a vertical format storing an object as a set of tuples, and creates a logical horizontal view of the vertical representation and transforms queries on this view to the vertical table.
ACM SIGMOD RecordThe five-minute rule ten years later, and other computer storage rules of thumb
124 Citations1997Jim Gray, Goetz Graefe
Simple economic and performance arguments suggest appropriate lifetimes for main memory pages and suggest optimal page sizes, and motivate the importance of the new Kaps, Maps, Scans, and $/Kaps, $/Maps,$/TBscan metrics.
IBM Systems JournalThe Peterlee Relational Test Vehicle—a system overview
99 Citations1976Stephen Todd
The Peterlee Relational Test Vehicle is not a fullfledged data-base system, but rather an evolving prototype which is expected to aid in solving some of the problems that have been encountered in using relational data bases.
Experiences building the open OODB query optimizer
86 Citations1993José A. Blakeley, William J. McKenna +1 more
The Open OODB query optimizer was constructed using the Volcano Optimizer Generator, demonstrating that this second-generation optimizer generator enables rapid development of efficient and effective query optimizers for non-standard data models and systems.
Flattening an object algebra to provide performance
67 Citations2002Peter Boncz, A.N. Wilshut +1 more
It is shown how flattening enabled us to implement a query algebra, using only a very limited set of simple operations, and was evaluated on the 1-GByte TPC-D (Transaction-processing Performance Council's Benchmark D), showing that the divide-and-conquer approach yields excellent results.
A query processing strategy for the decomposed storage model
65 Citations1987Setrag Khoshafian, George P. Copeland +3 more
This paper presents a novel and promising query processing strategy for a decomposed storage model called the “pivot” and discusses some of the qualitative advantages of the scheme.
Write-only disk caches
47 Citations1990Jon A. Solworth, Cyril U. Orji
It is shown that cache sizes in the range of a few percent allow writes to be performed at negligible or no cost and independently of locality considerations.
Doubly distorted mirrors
35 Citations1993Cyril U. Orji, Jon A. Solworth
Doubly distorted mirrors increase the number of physical writes per logical write from 2 to 3, but performs logical writes more efficiently, which achieves a 135% performance improvement over traditional mirrors in the TP1 benchmark.
PRTV, an efficient implementation for large relational data bases
14 Citations1975Stephen Todd
PRTV is a research prototype interactive data base intended for use on its own or as part of a specialist system to provide high level flexible data support, functional extensibility and reasonable efficiency.