Proceedings of the VLDB Endowment · 2012 · 117 citations · 30 references
ComputingComputer ScienceComputer SystemsDatabasesDistributed SystemsParallel ComputingDatabase ManagementDistributed Database ArchitectureDistributed DatabasesParallel DatabasesQuery OptimizationQuery ProcessingParallel Database ArchitecturesParallel Database ProcessingParallel Database SystemsQuery Latency OptimizationQuery Performance OptimizationResponse TimeResponse Time GuaranteesScalable Database Architecture
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.
30
Access path selection in a relational database management system
Patricia G. Selinger, M. M. Astrahan, Donald D. Chamberlin et al. · 1979 · 2.2K citations
Timos Sellis · ACM Transactions on Database Systems · 1988 · 809 citations · Full text
Ron Avnur, Joseph M. Hellerstein · ACM SIGMOD Record · 2000 · 795 citations
The end of an architectural era: (it's time for a complete rewrite)
Michael Stonebraker, Samuel Madden, Daniel J. Abadi et al. · Very Large Data Bases · 2007 · 578 citations
Semantic Data Caching and Replacement
Shaul Dar, Michael J. Franklin, Björn Þór Jónsson et al. · 1996 · 502 citations