{"id":{"repo_id":"bu","oai_identifier":"oai:open.bu.edu:2144/53740"},"canonical_url":"https://search.ndltd.org/etd/bu/oai:open.bu.edu:2144/53740","repository":{"repo_id":"bu","name":"Boston University","base_url":"https://open.bu.edu/oai/request"},"display":{"title":"Automatic tuning of log-structured merge trees under uncertain environments","abstract":"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 tree configuration for a particular application. Coined as the tuning problem, recent work focuses on tuning database instances for an expected workload, assuming that future workloads are similar. However, these approaches often recommend hyper-optimized configurations that exhibit performance cliffs as workloads evolve. Additionally, these methods are often expensive, requiring multiple database executions for testing, and therefore struggle to scale when tuning multiple database instances across a diverse set of applications. In this thesis, we propose augmenting the tuning problem to consider uncertainty and provide machine learning techniques to recommend tunings at scale. We first address uncertainty by introducing a robust LSM tuning paradigm called ENDURE. In this setting, we assume the expected input workload may not exactly match the workload the database experiences on deployment; rather, the executed workload may be close to the initial assumption. Therefore, ENDURE provides a tuning that maximizes the worst-case throughput over a neighborhood around the expected workload. To address the scalability problem, we introduce AXE, a learned task decomposition approach for tuning LSM trees, which splits the problem into two subtasks: one to model the relationship between workload-configuration pairs and performance, and the other to navigate the cost surface to recommend optimal tunings. We show that our paradigm is a more efficient method for identifying near-optimal configurations and scales to more tuning knobs in the harder robust tuning problem. Our method allows designers to either learn from prior work on analytical models or from data traces for new, unseen databases.","abstract_html":"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 tree configuration for a particular application. Coined as the tuning problem, recent work focuses on tuning database instances for an expected workload, assuming that future workloads are similar. However, these approaches often recommend hyper-optimized configurations that exhibit performance cliffs as workloads evolve. Additionally, these methods are often expensive, requiring multiple database executions for testing, and therefore struggle to scale when tuning multiple database instances across a diverse set of applications. In this thesis, we propose augmenting the tuning problem to consider uncertainty and provide machine learning techniques to recommend tunings at scale. We first address uncertainty by introducing a robust LSM tuning paradigm called ENDURE. In this setting, we assume the expected input workload may not exactly match the workload the database experiences on deployment; rather, the executed workload may be close to the initial assumption. Therefore, ENDURE provides a tuning that maximizes the worst-case throughput over a neighborhood around the expected workload. To address the scalability problem, we introduce AXE, a learned task decomposition approach for tuning LSM trees, which splits the problem into two subtasks: one to model the relationship between workload-configuration pairs and performance, and the other to navigate the cost surface to recommend optimal tunings. We show that our paradigm is a more efficient method for identifying near-optimal configurations and scales to more tuning knobs in the harder robust tuning problem. Our method allows designers to either learn from prior work on analytical models or from data traces for new, unseen databases.","abstract_has_math":false,"creators":["Huynh, Andy"],"institution":"Boston University","degree_name":"Doctor of Philosophy","degree_level":"doctoral","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Athanassoulis, Manos"],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026","date_published":"2026","updated_at":"2026-11-18T19:48:56Z","subjects":["Computer science","Database engine","Databases","LSM trees","NoSQL","Tuning"],"languages":["en_US"],"rights":["Attribution-ShareAlike 4.0 International"],"rights_urls":["http://creativecommons.org/licenses/by-sa/4.0/"],"identifier_entries":[],"person_identifier_entries":[{"key":"dc:identifier.orcid","label":"ORCID","values":["0000-0002-2843-6565"],"render_values":[{"text":"0000-0002-2843-6565","href":"https://orcid.org/0000-0002-2843-6565","code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/2144/53740","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/2144/53740","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.bu.edu/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopen.bu.edu%3A2144%2F53740","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Athanassoulis, Manos"]},{"key":"dc:creator","label":"Author","values":["Huynh, Andy"]},{"key":"dc:identifier.orcid","label":"ORCID","values":["0000-0002-2843-6565"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2026-10-19T18:02:01Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2026-10-19T18:02:01Z"]},{"key":"dc:date.issued","label":"Date","values":["2026"]},{"key":"dc:date.updated","label":"Dc Date Updated","values":["2026-09-02T16:15:16Z"]},{"key":"dc:type","label":"Dc Type","values":["Thesis/Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Boston University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer science","Database engine","Databases","LSM trees","NoSQL","Tuning"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution-ShareAlike 4.0 International"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://creativecommons.org/licenses/by-sa/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/2144/53740"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["2026"]},{"key":"dc:description.abstract","label":"Abstract","values":["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 tree configuration for a particular application. Coined as the tuning problem, recent work focuses on tuning database instances for an expected workload, assuming that future workloads are similar. However, these approaches often recommend hyper-optimized configurations that exhibit performance cliffs as workloads evolve. Additionally, these methods are often expensive, requiring multiple database executions for testing, and therefore struggle to scale when tuning multiple database instances across a diverse set of applications. In this thesis, we propose augmenting the tuning problem to consider uncertainty and provide machine learning techniques to recommend tunings at scale. We first address uncertainty by introducing a robust LSM tuning paradigm called ENDURE. In this setting, we assume the expected input workload may not exactly match the workload the database experiences on deployment; rather, the executed workload may be close to the initial assumption. Therefore, ENDURE provides a tuning that maximizes the worst-case throughput over a neighborhood around the expected workload. To address the scalability problem, we introduce AXE, a learned task decomposition approach for tuning LSM trees, which splits the problem into two subtasks: one to model the relationship between workload-configuration pairs and performance, and the other to navigate the cost surface to recommend optimal tunings. We show that our paradigm is a more efficient method for identifying near-optimal configurations and scales to more tuning knobs in the harder robust tuning problem. Our method allows designers to either learn from prior work on analytical models or from data traces for new, unseen databases."]},{"key":"dc:title","label":"Title","values":["Automatic tuning of log-structured merge trees under uncertain environments"]}]}],"canonical_facts":{"dc:contributor.advisor":["Athanassoulis, Manos"],"dc:creator":["Huynh, Andy"],"dc:date.accessioned":["2026-10-19T18:02:01Z"],"dc:date.available":["2026-10-19T18:02:01Z"],"dc:date.issued":["2026"],"dc:date.updated":["2026-09-02T16:15:16Z"],"dc:description":["2026"],"dc:description.abstract":["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 tree configuration for a particular application. Coined as the tuning problem, recent work focuses on tuning database instances for an expected workload, assuming that future workloads are similar. However, these approaches often recommend hyper-optimized configurations that exhibit performance cliffs as workloads evolve. Additionally, these methods are often expensive, requiring multiple database executions for testing, and therefore struggle to scale when tuning multiple database instances across a diverse set of applications. In this thesis, we propose augmenting the tuning problem to consider uncertainty and provide machine learning techniques to recommend tunings at scale. We first address uncertainty by introducing a robust LSM tuning paradigm called ENDURE. In this setting, we assume the expected input workload may not exactly match the workload the database experiences on deployment; rather, the executed workload may be close to the initial assumption. Therefore, ENDURE provides a tuning that maximizes the worst-case throughput over a neighborhood around the expected workload. To address the scalability problem, we introduce AXE, a learned task decomposition approach for tuning LSM trees, which splits the problem into two subtasks: one to model the relationship between workload-configuration pairs and performance, and the other to navigate the cost surface to recommend optimal tunings. We show that our paradigm is a more efficient method for identifying near-optimal configurations and scales to more tuning knobs in the harder robust tuning problem. Our method allows designers to either learn from prior work on analytical models or from data traces for new, unseen databases."],"dc:identifier.orcid":["0000-0002-2843-6565"],"dc:identifier.uri":["https://hdl.handle.net/2144/53740"],"dc:language.iso":["en_US"],"dc:rights":["Attribution-ShareAlike 4.0 International"],"dc:rights.uri":["http://creativecommons.org/licenses/by-sa/4.0/"],"dc:subject":["Computer science","Database engine","Databases","LSM trees","NoSQL","Tuning"],"dc:title":["Automatic tuning of log-structured merge trees under uncertain environments"],"dc:type":["Thesis/Dissertation"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["doctoral"],"thesis:degree_name":["Doctor of Philosophy"],"thesis:institution_name":["Boston University"]},"updated_at":"2026-11-18T19:48:56Z"}