Rubato DB
Published 3 November 2014
Li-Yan Yuan, Lengdong Wu, Jia-Huai You, Yan Chi
Citations12
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper verifies that the formula protocol and the staged grid architecture provide a satisfactory solution to one of the important challenges in the database systems: to develop a highly scalable database management system that supports various consistency levels from ACID to BASE.
Abstract
This paper proposes a new formula protocol for distributed concurrency control, and specifies a staged grid architecture for highly scalable database management systems. The paper also describes novel implementation techniques of Rubato DB based on the proposed protocol and architecture. We have conducted extensive experiments which clearly show that Rubato DB is highly scalable with efficient performance under both TPC-C and YCSB benchmarks. Our paper verifies that the formula protocol and the staged grid architecture provide a satisfactory solution to one of the important challenges in the database systems: to develop a highly scalable database management system that supports various consistency levels from ACID to BASE.
Keywords
Computer Science
Communications of the ACMMapReduce
18,538 Citations2008Jay B. Dean, Sanjay Ghemawat
This presentation explains how the underlying runtime system automatically parallelizes the computation across large-scale clusters of machines, handles machine failures, and schedules inter-machine communication to make efficient use of the network and disks.
Benchmarking cloud serving systems with YCSB
3,632 Citations2010Brian F. Cooper, Adam Silberstein +3 more
This work presents the "Yahoo! Cloud Serving Benchmark" (YCSB) framework, with the goal of facilitating performance comparisons of the new generation of cloud data serving systems, and defines a core set of benchmarks and reports results for four widely used systems.
Dynamo
3,454 Citations2007Giuseppe DeCandia, Deniz Hastorun +7 more
D Dynamo is presented, a highly available key-value storage system that some of Amazon's core services use to provide an "always-on" experience and makes extensive use of object versioning and application-assisted conflict resolution in a manner that provides a novel interface for developers to use.
ACM Transactions on Computer SystemsBigtable
3,432 Citations2008Fay W. Chang, Jay B. Dean +7 more
The simple data model provided by Bigtable is described, which gives clients dynamic control over data layout and format, and the design and implementation of Bigtable are described.
ACM SIGOPS Operating Systems ReviewCassandra
2,630 Citations2010Avinash Lakshman, Prashant Malik
Cassandra is a distributed storage system for managing very large amounts of structured data spread out across many commodity servers, while providing highly available service with no single point of failure.
Dryad
2,460 Citations2007Michael Isard, Mihai Budiu +3 more
The Dryad execution engine handles all the difficult problems of creating a large distributed, concurrent application: scheduling the use of computers and their CPUs, recovering from communication or computer failures, and transporting data between vertices.
Proceedings of the VLDB EndowmentHive
1,539 Citations2009Ashish Thusoo, Joydeep Sen Sarma +7 more
Hadoop is a popular open-source map-reduce implementation which is being used as an alternative to store and process extremely large data sets on commodity hardware.
Proceedings of the VLDB EndowmentPNUTS
960 Citations2008Brian F. Cooper, Raghu Ramakrishnan +7 more
PNUTS provides data storage organized as hashed or ordered tables, low latency for large numbers of concurrent requests including updates and queries, and novel per-record consistency guarantees and utilizes automated load-balancing and failover to reduce operational complexity.
Proceedings of the VLDB EndowmentHadoopDB
856 Citations2009A. A. ABOUZEID, Kamil Bajda-Pawlikowski +3 more
This paper explores the feasibility of building a hybrid system that takes the best features from both technologies; the prototype built approaches parallel databases in performance and efficiency, yet still yields the scalability, fault tolerance, and flexibility of MapReduce-based systems.
SEDA
847 Citations2001Matt Welsh, David Culler +1 more
This work presents the SEDA design and an implementation of an Internet services platform based on this architecture, and describes several control mechanisms for automatic tuning and load conditioning, including thread pool sizing, event batching, and adaptive load shedding.
Spanner: Google's globally-distributed database
827 Citations2012James C. Corbett, Jay B. Dean +24 more
Proceedings of the VLDB EndowmentSCOPE
731 Citations2008Ronnie Chaiken, B. Keith Jenkins +5 more
A new declarative and extensible scripting language, SCOPE (Structured Computations Optimized for Parallel Execution), targeted for this type of massive data analysis, designed for ease of use with no explicit parallelism, while being amenable to efficient parallel execution on large clusters.
Proceedings of the VLDB EndowmentDremel
709 Citations2010Sergey Melnik, Andrey Gubarev +5 more
This paper describes the architecture and implementation of Dremel, and explains how it complements MapReduce-based computing, and presents a novel columnar storage representation for nested records.
Megastore: Providing Scalable, Highly Available Storage for Interactive Services
654 Citations2011Jason D. Baker, Chris T. Bond +8 more
Megastore provides fully serializable ACID semantics within ne-grained partitions of data, which allows us to synchronously replicate each write across a wide area network with reasonable latency and support seamless failover between datacenters.
Very Large Data BasesThe end of an architectural era: (it's time for a complete rewrite)
575 Citations2007Michael Stonebraker, Samuel Madden +4 more
Proceedings of the VLDB EndowmentH-store
525 Citations2008Robert R. Kallman, Hideaki Kimura +10 more
The demonstration presented here provides insight on the development of a distributed main memory OLTP database and allows for the further study of the challenges inherent in this operating environment.
Calvin
524 Citations2012Alexander Thomson, Thaddeus Diamond +4 more
Calvin is a practical transaction scheduling and data replication layer that uses a deterministic ordering guarantee to significantly reduce the normally prohibitive contention costs associated with distributed transactions.
Proceedings of the VLDB EndowmentMAD skills
467 Citations2009Jeffrey P. Cohen, Brian Dolan +3 more
This paper highlights the emerging practice of Magnetic, Agile, Deep (MAD) data analysis as a radical departure from traditional Enterprise Data Warehouses and Business Intelligence, and describes database design methodologies that support the agile working style of analysts in these settings.
ACM Transactions on Database SystemsMaking snapshot isolation serializable
322 Citations2005Alan Fekete, Dimitrios Liarokapis +3 more
A theory is developed that characterizes when nonserializable executions of applications can occur under Snapshot Isolation, and it is applied to demonstrate that the TPC-C benchmark application has no serialization anomalies under SI, and how this demonstration can be generalized to other applications.
Proceedings of the VLDB EndowmentHigh-performance concurrency control mechanisms for main-memory databases
263 Citations2011Per-Åke Larson, Spyros Blanas +4 more
This paper introduces two efficient concurrency control methods specifically designed for main-memory databases that use multiversioning to isolate read-only transactions from updates but differ in how atomicity is ensured.
Building a database on S3
263 Citations2008Matthias Brantner, Daniela Florescu +3 more
The purpose of this paper is to demonstrate the opportunities and limitations of using S3 as a storage system for general-purpose database applications which involve small objects and frequent updates.
Consistency Analysis in Bloom: a CALM and Collected Approach
157 Citations2011Peter Alvaro, Neil Conway +2 more
This work introduces Bloom, a distributed programming language that is amenable to high-level consistency analysis and encourages order-insensitive programming, and proposes a program analysis technique that identifies points of order in Bloom programs: code locations where programmers may need to inject coordination logic to ensure consistency.
Proceedings of the VLDB EndowmentUsing Paxos to build a scalable, consistent, and highly available datastore
148 Citations2011Jun Rao, Eugene J. Shekita +1 more
It is shown that Paxos replication can be competitive with alternatives that provide weaker consistency guarantees and can be as fast or even faster on reads and only 5% to 10% slower on writes than an eventually consistent datastore.
Exploiting distributed version concurrency in a transactional memory cluster
129 Citations2006Kaloian Manassiev, Madalin Mihailescu +1 more
A transactional memory runtime system providing scaling and strong consistency on commodity clusters for both distributed scientific applications and database applications is investigated and shows near-linear scaling up to 8 transactional nodes for the most common e-commerce workload, the TPC-W shopping mix.
Communications of the ACM10 rules for scalable performance in 'simple operation' datastores
112 Citations2011Michael Stonebraker, R. G. G. Cattell
ACM Transactions on Computer SystemsSinfonia
65 Citations2009Marcos K. Aguilera, Arif Merchant +3 more
At the core of Sinfonia is a new minitransaction primitive that enables efficient and consistent access to data, while hiding the complexities that arise from concurrency and failures.
Infoscience (Ecole Polytechnique Fédérale de Lausanne)A Case for Staged Database Systems
53 Citations2003Stavros Harizopoulos, Anastassia Ailamaki
This paper proposes to break the database system into modules and to encapsulate them into self-contained stages connected to each other through queues to remedy the weaknesses of modern DBMS.
Elsevier eBooksAn Almost-Serial Protocol for Transaction Execution in Main-Memory Database Systems
17 Citations2002Stephen Blott, Henry F. Korth
This paper proposes SP, a serial protocol for the execution of transactions in main-memory systems, and evaluates its performance against that of strict two-phase locking, and presents a modified SP, that exploits multiprocessor systems.