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 4 of 4 for “"LSM trees"”.
-
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 …
-
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 …
-
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 …
-
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. …