On the Design and Scalability of Distributed Shared-Data Databases
Authors:
Open Access
- 27 May 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 663-676
Abstract
Database scale-out is commonly implemented by partitioning data across several database instances. This approach, however, has several restrictions. In particular, partitioned databases are inflexible in large-scale deployments and assume a partition-friendly workload in order to scale. In this paper, we analyze an alternative architecture design for distributed relational databases that overcomes the limitations of partitioned databases. The architecture is based on two fundamental principles: We decouple query processing and transaction management from data storage, and we share data across query processing nodes. The combination of these design choices provides scalability, elasticity, and operational flexibility without making any assumptions on the workload. As a drawback, sharing data among multiple database nodes causes synchronization overhead. To address this limitation, we introduce techniques for scalable transaction processing in shared-data environments. Specifically, we describe mechanisms for efficient data access, concurrency control, and data buffering. In combination with new hardware trends, the techniques enable performance characteristics that top state-of-the-art partitioned databases.Keywords
This publication has 43 references indexed in Scilit:
- The case for RAMCloudCommunications of the ACM, 2011
- Scalable SQLCommunications of the ACM, 2011
- A survey of B-tree locking techniquesACM Transactions on Database Systems, 2010
- Online reorganization of databasesACM Computing Surveys, 2009
- BigtableACM Transactions on Computer Systems, 2008
- SinfoniaACM SIGOPS Operating Systems Review, 2007
- Making snapshot isolation serializableACM Transactions on Database Systems, 2005
- A critique of ANSI SQL isolation levelsACM SIGMOD Record, 1995
- Efficient locking for concurrent operations on B-treesACM Transactions on Database Systems, 1981
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981