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 9 of 9 for “"LSM-Tree"”.

  1. Dynamically tuning LSM tree based databases

    Log-Structured Merge (LSM) trees are a popular choice of data structure for key-value database systems due to their high ingestion rate and fast reads. They achieve this by appending new writes and updates sequentially and buffering changes in memory before flushing them to disk in sorted order. …

    bu Repository record for Dynamically tuning LSM tree based databases (opens in a new tab)

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

  3. Tuning LSM trees using bayesian optimization

    … approach to optimize Log Structured Merge Trees (LSM Trees), a state-of-the-art storage structure primarily created for write-heavy database applications without compromising on read operations. It uses Bayesian optimization via the BoTorch library to fine-tune the LSM tree configurations …

    bu Repository record for Tuning LSM trees using bayesian optimization (opens in a new tab)

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

    … such as slab and Log Structured Merge(LSM) tree, on flash-based Solid State Drives(SSDs) and provide efficient solutions in caching and storage scenarios. With the rapid evolution of data centers, there appear plenty of challenges and opportunities for future optimizations. In this …

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

  5. Automatic tuning of log-structured merge trees under uncertain environments

    Log-structured merge (LSM) trees are the foundation of many database systems in multiple domains due to their inherent flexibility by exposing a rich design space to their maintainers. While this flexibility is beneficial, the large design space introduces complexity when seeking the optimal LSM …

    bu Repository record for Automatic tuning of log-structured merge trees under uncertain environments (opens in a new tab)

  6. Storage System Designs with Emerging Storage Technologies

    … with NVM 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 …

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

  7. Improving Reliability and Performance of Storage Stacks on next generation Solid State Drives

    … zlib compression, jbd2 checksum computation, and LSM Tree compaction are easy to offload to a computational device using our framework. We show that Nescafe is generic and simple to extend to different types of block, stream, and application-based workloads.

    toronto-retro Repository record for Improving Reliability and Performance of Storage Stacks on next generation Solid State Drives (opens in a new tab)

  8. Benchmarking, analyzing, and optimizing partial compaction in LSM-trees

    Log-structured merge (LSM) trees are widely adopted by many NoSQL databases because they offer high ingestion throughput via logging incoming data in a memory buffer, and flushing it to disk as a sorted run when the buffer fills up. To reduce space amplification and facilitate queries, LSM-trees …

    bu Repository record for Benchmarking, analyzing, and optimizing partial compaction in LSM-trees (opens in a new tab)

  9. ALGORITHMS AND DATA STRUCTURES FOR INDEXING, QUERYING, AND ANALYZING LARGE COLLECTIONS OF SEQUENCING DATA IN THE PRESENCE OR ABSENCE OF A REFERENCE

    … and efficient encoding via a minimum spanning tree. We describe, further, how this index can be made incrementally updatable by developing an efficient merge algorithm and storing the overall index in a multi-level log-structured merge (LSM) tree. We demonstrate the utility of this index by …

    maryland Repository record for ALGORITHMS AND DATA STRUCTURES FOR INDEXING, QUERYING, AND ANALYZING LARGE COLLECTIONS OF SEQUENCING DATA IN THE PRESENCE OR ABSENCE OF A REFERENCE (opens in a new tab)