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 67 for “"Key-value store"”.

  1. Energy-Efficient Key/Value Store

    … systems such as distributed data management stores run and serve billions of users. The two main drivers of this major concern are the pollution impact data centers have on the environment due to their waste heat, and the expensive cost data centers incur due to their enormous energy demand. …

    qucosa-diss

  2. DYNAMIC MEMORY MANAGEMENT FOR KEY-VALUE STORE

    … servers, modern web services often use in-memory key-value (k-v) stores at the front end to cache frequently accessed objects. Due to the limited memory capacity, these stores must be configured with a fixed amount of memory. Consequently, cache replacement is required when the footprint of the …

    mtu Repository record for DYNAMIC MEMORY MANAGEMENT FOR KEY-VALUE STORE (opens in a new tab)

  3. 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 …

    vt Repository record for Retina: Cross-Layered Key-Value Store using Computational Storage (opens in a new tab)

  4. Building A Scalable And High-Performance Key-Value Store System

    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 …

    wayne-thes Repository record for Building A Scalable And High-Performance Key-Value Store System (opens in a new tab)

  5. 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 …

    uiuc Repository record for OpenKV: LSM-tree-based key-value store for open-channel SSD (opens in a new tab)

  6. Has Anyone Seen My Keys? Fast and Oblivious Distributed Key–Value Store via HushMaps

    … write. In MPC the servers hold shares of the keys and values, so an operation takes several rounds. The existing oblivious structures each provide one property at the cost of another. Oblivious RAM hides access patterns but addresses memory by index rather than by key. Static oblivious …

    calgary Repository record for Has Anyone Seen My Keys? Fast and Oblivious Distributed Key–Value Store via HushMaps (opens in a new tab)

  7. A Distributed Key-Value Store Implementation and evaluation of two strategies for lookup in distributed databases

    … more speci - cally, a distributed, scalable key-value store able to handle many concurrent queries. A central issue when building this type of system is how to search for a speci c node in the distributed data space. Two di erent algorithms, solving this issue in di erent ways, have been …

    chalmers Repository record for A Distributed Key-Value Store Implementation and evaluation of two strategies for lookup in distributed databases (opens in a new tab)

  8. Using Eventual Consistency to Improve the Performance of Distributed Graph Computation In Key-Value Stores

    Key-value stores have gained increasing popularity due to their fast performance and simple data model. A key-value store usually consists of multiple replicas located in different geographical regions to provide higher availability and fault tolerance. Consequently, a protocol is employed to …

    msu Repository record for Using Eventual Consistency to Improve the Performance of Distributed Graph Computation In Key-Value Stores (opens in a new tab)

  9. 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 …

    umn Repository record for Efficient Data Management and Processing in Big Data Applications (opens in a new tab)

  10. A Distributed Publish/Subscribe System built on a DHT Substrate

    … system, Ingeborg, which is built on the key-value store Riak is also introduced and its performance is examined and compared to the previously mentioned systems. The results of the experimental study show that it is difficult to scale both RabbitMQ and Kafka with regards to the number of …

    chalmers Repository record for A Distributed Publish/Subscribe System built on a DHT Substrate (opens in a new tab)

  11. Understanding and Optimizing Flash-based Key-value Systems in Data Centers

    Flash-based key-value systems are widely deployed in today’s data centers for providing high-speed data processing services. These systems deploy flash-friendly data structures, such as slab and Log Structured Merge(LSM) tree, on flash-based Solid State Drives(SSDs) and provide efficient solutions …

    lsu-thes Repository record for Understanding and Optimizing Flash-based Key-value Systems in Data Centers (opens in a new tab)

  12. Multi-value distributed key-value stores

    Many large scale distributed data stores rely on optimistic replication to scale and remain highly available in the face of network partitions. Managing data without strong coordination results in eventually consistent data stores that allow for concurrent data updates. To allow writing …

    minho-thes Repository record for Multi-value distributed key-value stores (opens in a new tab)

  13. 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, …

    uiuc Repository record for Adaptive control for availability and consistency in distributed key-values stores (opens in a new tab)

  14. Storage System Designs with Emerging Storage Technologies

    … and storage devices, respectively. NVLSM is a key-value store using Log-Structured Merge Tree (LSM-Tree) on NVM systems. Idler is a mechanism to control the I/O workload to minimize the tail response time of an SMR drive. Idler artificially induces idle cleanings to avoid expensive blocking …

    umn Repository record for Storage System Designs with Emerging Storage Technologies (opens in a new tab)

  15. Leveraging Emerging Data Center Technologies to Build High-Performance Data Stores

    … log and builds the Logless, Linearizable Key-Value storage system (LoLKV). By removing the log, LoLKV eliminates the serialization bottleneck and unnecessary memory copy operations, achieving a higher level of concurrency and improving resource utilization. LoLKV relies on one-sided RDMA …

    waterloo Repository record for Leveraging Emerging Data Center Technologies to Build High-Performance Data Stores (opens in a new tab)

  16. Memory-mapped I/O for Fast Storage

    … space and access its data using processor load/store instructions. In this case, the operating system is responsible for moving data between DRAM and the storage devices, creating/destroying memory mappings, and handling page evictions/writebacks. Hits in memory-mapped I/O are handled entirely …

    greece Repository record for Memory-mapped I/O for Fast Storage (opens in a new tab)

  17. Network-Accelerated Linearizable Reads

    … the new approach, we designed FlairKV, a key-value store atop Raft. FlairKV implements the processing pipeline using the P4 programming language. We evaluate the benefits of the proposed approach and compare it to previous approaches using a cluster with a Barefoot Tofino switch. The …

    waterloo Repository record for Network-Accelerated Linearizable Reads (opens in a new tab)

  18. Evaluating in-memory caching strategies for distributed web services

    … is to have a shared, networked, in-memory, key-value store, such as Redis. This thesis had two goals. Firstly, to implement an alternative to this shared cache system using caches distributed on each server of the web application. Secondly, to implement a test suite for comparing these cache …

    chalmers Repository record for Evaluating in-memory caching strategies for distributed web services (opens in a new tab)

  19. SAFE: A Declarative Trust-Agile System with Linked Credentials

    … principals</p><p>in a networked system. A key barrier to practical use of logical trust systems</p><p>is the problem of managing proof contexts: identifying, validating, and</p><p>assembling the credentials and policies that are relevant to each trust</p><p>decision. </p><p>SAFE addresses …

    duke Repository record for SAFE: A Declarative Trust-Agile System with Linked Credentials (opens in a new tab)

  20. A demand-aware heuristic for value-space partitioning and repartitioning

    … a novel heuristic for partitioning a NoSQL key-value store based on its value-space. Our demand-aware heuristic takes into account the updates and search queries’ distribution in order to partition the value-space into mutually exclusive and exhaustive regions that are fairly contacted by …

    brazil-uerj Repository record for A demand-aware heuristic for value-space partitioning and repartitioning (opens in a new tab)

Page 1 of 4