SharedDB
Authors:
Open Access
- 1 February 2012
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 5 (6) , 526-537
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.Keywords
This publication has 23 references indexed in Scilit:
- Predictable performance and high query concurrency for data analyticsThe VLDB Journal, 2011
- Predictable performance for unpredictable workloadsProceedings of the VLDB Endowment, 2009
- A scalable, predictable join operator for highly concurrent data warehousesProceedings of the VLDB Endowment, 2009
- Sort vs. Hash revisitedProceedings of the VLDB Endowment, 2009
- Main-memory scan sharing for multi-core CPUsProceedings of the VLDB Endowment, 2008
- Batched Processing for Information Filters2005
- Path sharing and predicate evaluation for high-performance XML filteringACM Transactions on Database Systems, 2003
- Cache investmentACM Transactions on Database Systems, 2000
- Multiple-query optimizationACM Transactions on Database Systems, 1988
- Join processing in database systems with large main memoriesACM Transactions on Database Systems, 1986