Chad Whipkey

dblp:84/11411 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Distributed and cloud data management · 26% Query processing and optimization · 26% Information retrieval · 26%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › web search
data freshness
0.212016
Shasta: Interactive Reporting At Scale · SIGMOD Conference 2016
Query processing and optimization
online query processing
0.212016
Shasta: Interactive Reporting At Scale · SIGMOD Conference 2016
Distributed and cloud data management › distributed database architecture
distributed relational database
0.212013
F1: A Distributed SQL Database That Scales · Proc. VLDB Endow. 2013
Distributed systems
replication and consistency
0.212013
F1: A Distributed SQL Database That Scales · Proc. VLDB Endow. 2013
Database system architecture and tuning
relational database system
0.112012
F1: the fault-tolerant distributed RDBMS supporting google's ad business · SIGMOD Conference 2012
Distributed systems
distributed database
0.112012
F1: the fault-tolerant distributed RDBMS supporting google's ad business · SIGMOD Conference 2012
Distributed and cloud data management › distributed query processing
distributed query engine
0.012013
F1: A Distributed SQL Database That Scales · Proc. VLDB Endow. 2013
Distributed and cloud data management
distributed data store
0.012012
F1: the fault-tolerant distributed RDBMS supporting google's ad business · SIGMOD Conference 2012

Methods — techniques the papers use, named apart from their topics

query transformation · 0.2join processing over many tables · 0.2
YearPublicationVenuePosition
2016 Shasta: Interactive Reporting At Scale
abstract
We describe Shasta, a middleware system built at Google to support interactive reporting in complex user-facing applications related to Google's Internet advertising business. Shasta targets applications with challenging requirements: First, user query latencies must be low. Second, underlying transactional data stores have complex "read-unfriendly" schemas, placing significant transformation logic between stored data and the read-only views that Shasta exposes to its clients. This transformation logic must be expressed in a way that scales to large and agile engineering teams. Finally, Shasta targets applications with strong data freshness requirements, making it challenging to precompute query results using common techniques such as ETL pipelines or materialized views. Instead, online queries must go all the way from primary storage to user-facing views, resulting in complex queries joining 50 or more tables.
Gokul Nath Babu Manoharan, Stephan Ellner, Karl Schnaitter, Sridatta Chegu, Alejandro Estrella-Balderrama, Stephan Gudmundson, Apurv Gupta, Ben Handy, Bart Samwel, Chad Whipkey, Larysa Aharkava, Himani Apte, Nitin Gangahar, Shivakumar Venkataraman, Divyakant Agrawal, Jeffrey D. Ullman
SIGMOD Conference10
2013 F1: A Distributed SQL Database That Scales
abstract
F1 is a distributed relational database system built at Google to support the AdWords business. F1 is a hybrid database that combines high availability, the scalability of NoSQL systems like Bigtable, and the consistency and usability of traditional SQL databases. F1 is built on Spanner, which provides synchronous cross-datacenter replication and strong consistency. Synchronous replication implies higher commit latency, but we mitigate that latency by using a hierarchical schema model with structured data types and through smart application design. F1 also includes a fully functional distributed SQL query engine and automatic change tracking and publishing.
Jeff Shute, Radek Vingralek, Bart Samwel, Ben Handy, Chad Whipkey, Eric Rollins, Mircea Oancea, Kyle Littlefield, David Menestrina, Stephan Ellner, John Cieslewicz, Ian Rae, Traian Stancescu, Himani Apte
Proc. VLDB Endow.5
2012 F1: the fault-tolerant distributed RDBMS supporting google's ad business
abstract
Many of the services that are critical to Google's ad business have historically been backed by MySQL. We have recently migrated several of these services to F1, a new RDBMS developed at Google. F1 implements rich relational database features, including a strictly enforced schema, a powerful parallel SQL query engine, general transactions, change tracking and notification, and indexing, and is built on top of a highly distributed storage system that scales on standard hardware in Google data centers. The store is dynamically sharded, supports transactionally-consistent replication across data centers, and is able to handle data center outages without data loss.
Jeff Shute, Mircea Oancea, Stephan Ellner, Ben Handy, Eric Rollins, Bart Samwel, Radek Vingralek, Chad Whipkey, Beat Jegerlehner, Kyle Littlefield, Phoenix Tong
SIGMOD Conference8