David J. DeWitt

David J. DeWitt

Auto-generated profile, based on publicly available information

David J. DeWitt

MIT CSAIL, Cambridge, MA, USA

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 1992
Verified
Conference Paper
Open access
PDF file
DLDaniel F. Lieuwen
Daniel F. Lieuwen
DDDavid J. DeWitt
David J. DeWitt
Database programming languages like O2, E, and O++ include the ability to iterate through a set. Nested iterators can be used to express joins. This paper describes compile-time optimizations similar to relational transformations like join reordering for such programming constructs. This paper also shows how to use a standard transformation-based optimizer to optimize these joins. An optimizer built using the EXODUS Optimizer Generator [GRAE87] was added to the Bell Labs O++ [AGRA89] compiler. We used the resulting optimizing compiler to experimentally validate the ideas in this paper. The experiments show that this technique can significantly improve the performance of database programming languages.

27 August 2015
Verified
Conference Paper
Open access
WLWillis Lang
Willis Lang
FBFrank Bertsch
Frank Bertsch
DDDavid J. DeWitt
David J. DeWitt
NENigel Ellis
Nigel Ellis
Microsoft operates the Azure SQL Database (ASD) cloud service, one of the dominant relational cloud database services in the market today. To aid the academic community in their research on designing and efficiently operating cloud database services, Microsoft is introducing the release of production-level telemetry traces from the ASD service. This telemetry data set provides, over a wide set of important hardware resources and counters, the consumption level of each customer database replica. The first release will be a multi-month time-series data set that includes the full cluster traces from two different ASD global regions.

1 October 1994 in ACM SIGPLAN Notices
Verified
Journal Article
Open access
MCMichael J. Carey
Michael J. Carey
DDDavid J. DeWitt
David J. DeWitt
CKChander Kant
Chander Kant
JNJeffrey F. Naughton
Jeffrey F. Naughton
The OO7 Benchmark was first published in 1993, and has since found a home in the marketing literature of various object-oriented database management system (OODBMS) vendors. The OO7 Benchmark (as published) was the initial result of an ongoing OODBMS performance evaluation effort at the University of Wisconsin. This paper provides an update on the status of the effort on two fronts: single-user and multi-user. On the single-user front, we review and critique the design of the initial OO7 Benchmark. We discuss some of its faults, the reasons for those faults, and things that might be done to correct them. On the multi-user front, we describe our current work on the development of a multi-user benchmark for OODBMSs. This effort includes changes and extensions to the OO7 database and the design of a family of interesting multi-user workloads.

8 December 2023 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
MPMatthew Perron
Matthew Perron
RFRaul Castro Fernandez
Raul Castro Fernandez
DDDavid DeWitt
David DeWitt
MCMichael Cafarella
Michael Cafarella
SMSamuel Madden
Samuel Madden
Analytical query workloads are prone to rapid fluctuations in resource demands. These rapid, hard to predict resource demand changes make provisioning a challenge. Users must either over provision at excessive cost or suffer poor query latency when demand spikes. Prior work shows the viability of using cloud functions to match the supply of compute to the workload demand without provisioning resources ahead of time. For low query volumes, this approach is less costly at reasonable performance compared to provisioned systems, but as query volumes increase the cost overhead of cloud functions outweighs the benefit gained by rapid elasticity. In this work, we propose a novel strategy combining rapidly scalable but expensive resources with slow to start but inexpensive virtual machines to gain the benefit of elasticity without losing out on the cost savings of provisioned resources. We demonstrate a technique that minimizes cost over a wide range of workloads, environmental conditions, and compute costs while providing stable query performance. We implement these ideas in Cackle and demonstrate that it achieves similar performance and cost per query across a wide range of workloads, avoiding the cost and performance cliffs of alternative approaches.