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 43 for “"Key-Value Stores"”.

  1. 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)

  2. An Evaluation of Key-value Stores in Scientific Applications

    … available in the market today, including key-value databases. Key-value databases are the simplest NoSQL databases where every single item is stored as a key-value pair. In-memory key-value stores are specialized key-value databases that maintain data in main memory instead of the disk. …

    houston Repository record for An Evaluation of Key-value Stores in Scientific Applications (opens in a new tab)

  3. Designing key-value stores for emerging memory and disaggregation technologies

    … of applications to the cloud, cloud-based key-value stores (KVSs) should offer high performance, scalability, elasticity, utilization, and crash resilience. However, conventional storage technologies and monolithic server models make it challenging to achieve these goals. The transition to …

    texas Repository record for Designing key-value stores for emerging memory and disaggregation technologies (opens in a new tab)

  4. mPart: Miss Ratio Curve Guided Partitioning in Key-Value Stores

    Web applications employ key-value stores to cache the data that is most commonly accessed. The cache improves an web application’s performance by serving its requests from memory, avoiding fetching them from the backend database. Since the memory space is limited, maximizing the memory utilization …

    mtu Repository record for mPart: Miss Ratio Curve Guided Partitioning in Key-Value Stores (opens in a new tab)

  5. Data Partitioning and Placement Mechanisms for Elastic Key-Value Stores

    Key-Value Stores (KVSs) have become a standard component for many web services and applications due to their inherent scalability, availability, and reliability. Many enterprises are now adopting them for use on servers leased from Infrastructure-as-a-Service (IaaS) providers. The defining …

    unsw Repository record for Data Partitioning and Placement Mechanisms for Elastic Key-Value Stores (opens in a new tab)

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

    texas Repository record for PebblesDB : building key-value stores using fragmented log-structured merge trees (opens in a new tab)

  7. GD-Wheel: A Cost-Aware Replacement Policy for Key-Value Stores

    Various memory-based key-value stores, such as Memcached and Redis, are used to speed up dynamic web applications. Specifically, they are used to cache the results of computations, such as database queries. Currently, these key-value stores use either LRU or an LRU approximation as the replacement …

    rice Repository record for GD-Wheel: A Cost-Aware Replacement Policy for Key-Value Stores (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. 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)

  10. Scaling Up The Performance of Distributed Key-ValueStores Using Emerging Technologies for Big DataApplications

    … due to their flexibility and high performance. Key-value stores, one of the NoSQL databases categories, are widely used in many big data applications. This wide usage is for its efficiency in handling data in key-value format, and flexibility to scale out without significant database redesign. …

    umn Repository record for Scaling Up The Performance of Distributed Key-ValueStores Using Emerging Technologies for Big DataApplications (opens in a new tab)

  11. Efficient programming of massive-memory machines

    … Larger and longer-lived data sets managed by key-value stores require minimizing over- commitments of memory, but current designs trade off performance scalability and memory bloat. Furthermore, opaque operating system abstractions like virtual memory and ill-matched, non-portable interfaces …

    gatech Repository record for Efficient programming of massive-memory machines (opens in a new tab)

  12. Network-accelerated Scheduling for Large Clusters

    … and one for accelerating scheduling in key-value stores. First, we present a scheduler designed for low-latency data analytics workloads. The proposed scheduler receives job description, maintains a task queue in the switch memory, and schedules tasks on the next available worker at …

    waterloo Repository record for Network-accelerated Scheduling for Large Clusters (opens in a new tab)

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

    uiuc Repository record for Idempotent distributed counters using a Forgetful Bloom Filter (opens in a new tab)

  14. Scheduling for High Throughput and Small Latency in Parallel and Distributed Systems

    … data-placement strategies for distributed key-value stores. In distributed key-value stores, a large amount of data is stored across multiple servers. When a request to access data arrives, it is routed to the appropriate server, queued, and eventually processed. If the queue is full, then …

    wustl Repository record for Scheduling for High Throughput and Small Latency in Parallel and Distributed Systems (opens in a new tab)

  15. Secure and high-performance big-data systems in the cloud

    … big data, various scalable systems (e.g. key-value stores and MapReduce) have recently emerged in industry. However, there is a huge gap between what these open-source software systems can offer and what the real-world applications demand. First, scalable key-value stores are designed for …

    gatech Repository record for Secure and high-performance big-data systems in the cloud (opens in a new tab)

  16. 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)

  17. 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

  18. 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)

  19. OasisDB: An Oblivious and Scalable System for Relational Data

    … RDBMSs, OasisDB leverages existing oblivious key value stores (KV-stores) as storage engines and securely scales them to enhance performance. Its novel multi-tier architecture allows for independent scaling of each tier while supporting multi-user environments without compromising privacy. We …

    waterloo Repository record for OasisDB: An Oblivious and Scalable System for Relational Data (opens in a new tab)

Page 1 of 3