Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 28 for “"Key-Value store"”.
-
BlueCache : a scalable distributed flash-based key-value store
… access to a large amount of data is a key requirement for many web applications in data centers. To satisfy such a requirement, a distributed inmemory key-value store (KVS), such as memcached and Redis, is widely used as a caching layer to augment the slower persistent backend storage …
-
Retina: Cross-Layered Key-Value Store using Computational Storage
… Due to their design choices, traditional key-value stores do not fully leverage these new storage devices. These key-value stores become CPU-bound even before fully utilizing the IO bandwidth. LSM or B+ tree-based key-value stores involve complex garbage collection and store sorted keys …
-
Building A Scalable And High-Performance Key-Value Store System
<p>Contemporary web sites can store and process very large amounts of data. To provide timely service to their users, they have adopted key-value (KV) stores, which is a simple but effective caching infrastructure atop the conventional databases that store these data, to boost performance. Examples …
-
Implementing accelerated key-value store: From SSDs to datacenter servers
… collected these days are not well-structured, a key-value store has become one of the most important building blocks widely used in datacenters thanks to its simple interface. Key-value stores are often used as a internal engine for other databases. This thesis explores whether a modern …
-
FPGA-based hardware acceleration for a key-value store database
… Array (FPGA) as a hardware accelerator for a key-value database. Utilized as a platform of reconfigurable logic, the FPGA offers massively parallel usability at a much faster pace than a traditional software-enabled database system. This project implements a key-value store database hardware …
-
OpenKV: LSM-tree-based key-value store for open-channel SSD
Log-structured merge (LSM) tree-based key-value stores, such as LevelDB and RocksDB, have seen great adoption in industry due to their high write speed. However, one major issue with LSM-based databases is the high write amplification. The root cause of this problem is the LSM tree structure that …
-
Efficient Data Management and Processing in Big Data Applications
… are investigated for Big Data applications. Key-value store (KVS) is widely used in many Big Data applications by providing flexible and efficient performance. Recently, a new Ethernet accessed disk drive for key-value pairs called "Kinetic Drive" was developed by Seagate. It can reduce the …
-
NOHOST : a new storage architecture for distributed storage systems
… system that forms a cluster of distributed key-value store. This is done by refactoring deep I/O layers in the current design so that refactored layers are light-weight enough to run seamlessly on resource constrained environments. The NOHOST node is a full-fledged storage node, composed of …
-
Adaptive control for availability and consistency in distributed key-values stores
The CAP theorem says that distributed key-value stores can only provide bounded consistency (C) and availability (A) under the presence of partition (P). Recent work has proposed the ability for applications of such stores to specify either an availability SLA or a consistency SLA. In this paper, …
-
Modular Verification of Distributed Systems with Grove
… of components that build on it (e.g. a key value service built on RPC). To enable modular specification and verification in a distributed systems, Grove uses the idea of ownership from separation logic. Using Grove, we built a verified unreliable RPC library, where we captured …
-
PebblesDB : building key-value stores using fragmented log-structured merge trees
Key-value stores such as LevelDB and RocksDB offer excellent write throughput, but suffer high write amplification. The write amplification problem is due to the Log-Structured Merge Trees data structure that underlies these key-value stores. To remedy this problem, this thesis presents a novel …
-
Idempotent distributed counters using a Forgetful Bloom Filter
Distributed key-value stores power the backend of high-performance web services and cloud computing applications. Key-value stores such as Cassandra rely heavily on counters to keep track of the occurrences of various kinds of events. However, today's implementations of counters do not provide …
-
Rethinking Update-in-Place Key-Value Stores for Modern Storage
Several widely-used key-value stores, like RocksDB, are designed around log-structured merge trees (LSMs). Optimizing for the performance characteristics of HDDs, LSMs provide good write performance by emphasizing sequential access to storage. However, this approach negatively impacts read …
-
Fast transactions for multicore in-memory databases
… data structure design provides excellent base key-value store performance, to which we add a new, cache-friendly serializable protocol and support for running large, read-only transactions on a recent snapshot. On a key-value workload, the resulting system introduces negligible performance …
-
Delegation for Multi-Threaded and Rack-Scale Software
… in microbenchmarks and 5-9x improvement for a key-value store in high-contention workloads, while remaining competitive even without contention. Gossamer extends the concept of delegation to distributed computing. It allows an application written for a single machine to scale to a small cluster …
-
Accelerated Storage Systems
… put a tremendous stress on data centers to store, index, and retrieve large amounts of data. Exemplified by technologies such as social media, photo and video sharing, and e-commerce, the rise of the real-time web demands data stores support minimal latencies, always-on availability and …
-
Rethinking Storage System Design in Distributed NVRAM+RDMA Clusters
… a novel data access protocol for distributed key-value storage systems. Telepathy supports replicated data storage for fault tolerance and guarantees strong consistency while supporting high-volume concurrent read/write access. Our read protocol can perform (largely) silent consistent reads …
-
BP-Tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B⁺-trees
… presents the BP-tree, an efficient concurrent key-value store based on the B⁺-tree, that uses large leaf nodes to optimize for range-query performance without sacrificing update speed by using large leaf nodes. B⁺-trees are a fundamental data structure for implementing in-memory indexes in …
-
A Scalable Leader Based Consensus Algorithm
… durations. We evaluate this protocol using a key-value store built on FDRaft and Raft and compare multi-datacenter and edge deployments. The evaluation shows 2x improved throughput and around 55% improved latency over Raft during normal operations and 45% improvement over Raft with vanilla …
-
Latency Tradeoffs in Distributed Storage Access
… data. An alternate mechanism, popularly known as Key-Value Store (KVS) has been investigated over the last decade to handle such data. A KVS store only needs a 'key' to uniquely identify the data record, which may be of variable length and may or may not have further structure in the form of …
Page 1 of 2