SharedDB: killing one thousand queries with one stone

  • Authors:
  • Georgios Giannikis;Gustavo Alonso;Donald Kossmann

  • Affiliations:
  • Systems Group, ETH Zurich, Switzerland;Systems Group, ETH Zurich, Switzerland;Systems Group, ETH Zurich, Switzerland

  • Venue:
  • Proceedings of the VLDB Endowment
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Traditional database systems are built around the query-at-a-time model. This approach tries to optimize performance in a best-effort way. Unfortunately, best effort is not good enough for many modern applications. These applications require response time guarantees in high load situations. This paper describes the design of a new database architecture that is based on batching queries and shared computation across possibly hundreds of concurrent queries and updates. Performance experiments with the TPC-W benchmark show that the performance of our implementation, SharedDB, is indeed robust across a wide range of dynamic workloads.