Corpus ID: 55258446

Evaluation of High Performance Key-Value Stores

  title={Evaluation of High Performance Key-Value Stores},
  author={Christian Forfang},
Key-value stores have a long history of providing users with a simple to use, yet powerful, interface to durable data storage. Useful for various purposes in their own right, they are also often used as storage layers in more complicated systems---such as fully featured database management systems. For these reasons, it is educational to investigate how such systems are actually architectured and implemented. This thesis looks in detail at two recently developed embedded key-value stores… Expand
Big File Cloud Storage (BFCS): Distributed Storage Service with De-Duplication and Secure Storage
Nowadays, cloud-based storage are growing and has become an emerging trend in big data storage field. Many problems arise while designing an efficient and low complicated storage engine forExpand
Can Applications Recover from fsync Failures?
The findings show that although applications use many failure-handling strategies, none are sufficient: fsync failures can cause catastrophic outcomes such as data loss and corruption. Expand
Flowchain : A Distributed Ledger Designed for Peer-to-Peer IoT Networks and Real-time Data Transactions
The main feature of the Flowchain framework is Virtual Blocks that provides a new blockchain data structure design to ensure the real-time data transactions. Expand


Transaction Processing: Concepts and Techniques
Using transactions as a unifying conceptual framework, the authors show how to build high-performance distributed systems and high-availability applications with finite budgets and risk. Expand
The log-structured merge-tree (LSM-tree)
The log-structured mergetree (LSM-tree) is a disk-based data structure designed to provide low-cost indexing for a file experiencing a high rate of record inserts (and deletes) over an extended period. Expand
Scalable SQL and NoSQL data stores
This paper examines a number of SQL and socalled "NoSQL" data stores designed to scale simple OLTP-style application loads over many servers, and contrasts the new systems on their data model, consistency mechanisms, storage mechanisms, durability guarantees, availability, query support, and other dimensions. Expand
CouchDB: The Definitive Guide
This book introduces you to Apache CouchDB, a document-oriented database that offers a different way to model your data, and explains basic document CRUD, advanced MapReduce, and deployment tuning for performance and reliability. Expand
Bigtable: A Distributed Storage System for Structured Data
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. Expand
Practical lock-freedom
This dissertation introduces and evaluates practical abstractions and data structures that facilitate the development of large-scale lock-free systems and presents an implementation of two useful abstractions that make it easier to develop arbitrary lock- free data structures. Expand
Ubiquitous B-Tree
The major variations of the B-tree are discussed, especially the B+-tree, contrasting the merits and costs of each implementation and illustrating a general purpose access method that uses a B- tree. Expand
The Recovery Manager of the System R Database Manager
The recovery subsystem of an experimental data management system is described and evaluated and the DO-UNDO-REDO protocol allows new recoverable types and operations to be added to the recovery system. Expand
Berkeley DB
The design and technical features of Berkeley DB, the distribution, and its license are described, including surviving system and disk crashes. Expand
Skip Lists: A Probabilistic Alternative to Balanced Trees
This paper describes and analyzes skip lists and presents new techniques for analyzing probabilistic algorithms. Expand