Loading…

Towards flexibility and robustness of LSM trees

Log-structured merge trees (LSM trees) are increasingly used as part of the storage engine behind several data systems, and are frequently deployed in the cloud. As the number of applications relying on LSM-based storage backends increases, the problem of performance tuning of LSM trees receives inc...

Full description

Saved in:
Bibliographic Details
Published in:The VLDB journal 2024, Vol.33 (4), p.1105-1128
Main Authors: Huynh, Andy, Chaudhari, Harshal A., Terzi, Evimaria, Athanassoulis, Manos
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c314t-f3ac3ca15ecf143ca688be7d38a379a9c82eb5eda0003300a8ea9380608698de3
container_end_page 1128
container_issue 4
container_start_page 1105
container_title The VLDB journal
container_volume 33
creator Huynh, Andy
Chaudhari, Harshal A.
Terzi, Evimaria
Athanassoulis, Manos
description Log-structured merge trees (LSM trees) are increasingly used as part of the storage engine behind several data systems, and are frequently deployed in the cloud. As the number of applications relying on LSM-based storage backends increases, the problem of performance tuning of LSM trees receives increasing attention. We consider both nominal tunings—where workload and execution environment are accurately known a priori—and robust tunings—which consider uncertainty in the workload knowledge. This type of workload uncertainty is common in modern applications, notably in shared infrastructure environments like the public cloud. To address this problem, we introduce Endure , a new paradigm for tuning LSM trees in the presence of workload uncertainty. Specifically, we focus on the impact of the choice of compaction policy, size ratio, and memory allocation on the overall performance. Endure considers a robust formulation of the throughput maximization problem and recommends a tuning that offers near-optimal throughput when the executed workload is not the same, instead in a neighborhood of the expected workload. Additionally, we explore the robustness of flexible LSM designs by proposing a new unified design called K-LSM that encompasses existing designs. We deploy our robust tuning system, Endure , on a state-of-the-art key-value store, RocksDB, and demonstrate throughput improvements of up to 5 × in the presence of uncertainty. Our results indicate that the tunings obtained by Endure are more robust than tunings obtained under our expanded LSM design space. This indicates that robustness may not be inherent to a design, instead, it is an outcome of a tuning process that explicitly accounts for uncertainty.
doi_str_mv 10.1007/s00778-023-00826-9
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3084374142</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3084374142</sourcerecordid><originalsourceid>FETCH-LOGICAL-c314t-f3ac3ca15ecf143ca688be7d38a379a9c82eb5eda0003300a8ea9380608698de3</originalsourceid><addsrcrecordid>eNp9kE9PwzAMxSMEEmPwBThV4hzmxF2THNHEP2mIA0PiFqWtizqNdsSdYN-eQJG44YPtw3vP1k-IcwWXCsDMODVjJWiUAFYX0h2ICbjcSWvMy6GYKCgKaVMdixPmNQBorecTMVv1HyHWnDUb-mzLdtMO-yx0dRb7csdDR8xZ32TLp4dsiER8Ko6asGE6-51T8XxzvVrcyeXj7f3iaikrVPkgGwwVVkHNqWpUnrbC2pJMjTagccFVVlM5pzqkRxABgqXg0EIBtnC2JpyKizF3G_v3HfHg1_0udumkR7A5mlzlOqn0qKpizxyp8dvYvoW49wr8Nxg_gvEJjP8B410y4WjiJO5eKf5F_-P6AgAuZSQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3084374142</pqid></control><display><type>article</type><title>Towards flexibility and robustness of LSM trees</title><source>Springer Nature</source><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><creator>Huynh, Andy ; Chaudhari, Harshal A. ; Terzi, Evimaria ; Athanassoulis, Manos</creator><creatorcontrib>Huynh, Andy ; Chaudhari, Harshal A. ; Terzi, Evimaria ; Athanassoulis, Manos</creatorcontrib><description>Log-structured merge trees (LSM trees) are increasingly used as part of the storage engine behind several data systems, and are frequently deployed in the cloud. As the number of applications relying on LSM-based storage backends increases, the problem of performance tuning of LSM trees receives increasing attention. We consider both nominal tunings—where workload and execution environment are accurately known a priori—and robust tunings—which consider uncertainty in the workload knowledge. This type of workload uncertainty is common in modern applications, notably in shared infrastructure environments like the public cloud. To address this problem, we introduce Endure , a new paradigm for tuning LSM trees in the presence of workload uncertainty. Specifically, we focus on the impact of the choice of compaction policy, size ratio, and memory allocation on the overall performance. Endure considers a robust formulation of the throughput maximization problem and recommends a tuning that offers near-optimal throughput when the executed workload is not the same, instead in a neighborhood of the expected workload. Additionally, we explore the robustness of flexible LSM designs by proposing a new unified design called K-LSM that encompasses existing designs. We deploy our robust tuning system, Endure , on a state-of-the-art key-value store, RocksDB, and demonstrate throughput improvements of up to 5 × in the presence of uncertainty. Our results indicate that the tunings obtained by Endure are more robust than tunings obtained under our expanded LSM design space. This indicates that robustness may not be inherent to a design, instead, it is an outcome of a tuning process that explicitly accounts for uncertainty.</description><identifier>ISSN: 1066-8888</identifier><identifier>EISSN: 0949-877X</identifier><identifier>DOI: 10.1007/s00778-023-00826-9</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Computer Science ; Data systems ; Database Management ; Memory management ; Optimization ; Robustness ; Special Issue Paper ; Tuning ; Uncertainty ; Workload ; Workloads</subject><ispartof>The VLDB journal, 2024, Vol.33 (4), p.1105-1128</ispartof><rights>The Author(s) 2024. corrected publication 2024</rights><rights>The Author(s) 2024. corrected publication 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c314t-f3ac3ca15ecf143ca688be7d38a379a9c82eb5eda0003300a8ea9380608698de3</cites><orcidid>0000-0003-1837-0010 ; 0000-0002-0444-4915 ; 0000-0002-2843-6565 ; 0000-0001-7809-9993</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Huynh, Andy</creatorcontrib><creatorcontrib>Chaudhari, Harshal A.</creatorcontrib><creatorcontrib>Terzi, Evimaria</creatorcontrib><creatorcontrib>Athanassoulis, Manos</creatorcontrib><title>Towards flexibility and robustness of LSM trees</title><title>The VLDB journal</title><addtitle>The VLDB Journal</addtitle><description>Log-structured merge trees (LSM trees) are increasingly used as part of the storage engine behind several data systems, and are frequently deployed in the cloud. As the number of applications relying on LSM-based storage backends increases, the problem of performance tuning of LSM trees receives increasing attention. We consider both nominal tunings—where workload and execution environment are accurately known a priori—and robust tunings—which consider uncertainty in the workload knowledge. This type of workload uncertainty is common in modern applications, notably in shared infrastructure environments like the public cloud. To address this problem, we introduce Endure , a new paradigm for tuning LSM trees in the presence of workload uncertainty. Specifically, we focus on the impact of the choice of compaction policy, size ratio, and memory allocation on the overall performance. Endure considers a robust formulation of the throughput maximization problem and recommends a tuning that offers near-optimal throughput when the executed workload is not the same, instead in a neighborhood of the expected workload. Additionally, we explore the robustness of flexible LSM designs by proposing a new unified design called K-LSM that encompasses existing designs. We deploy our robust tuning system, Endure , on a state-of-the-art key-value store, RocksDB, and demonstrate throughput improvements of up to 5 × in the presence of uncertainty. Our results indicate that the tunings obtained by Endure are more robust than tunings obtained under our expanded LSM design space. This indicates that robustness may not be inherent to a design, instead, it is an outcome of a tuning process that explicitly accounts for uncertainty.</description><subject>Computer Science</subject><subject>Data systems</subject><subject>Database Management</subject><subject>Memory management</subject><subject>Optimization</subject><subject>Robustness</subject><subject>Special Issue Paper</subject><subject>Tuning</subject><subject>Uncertainty</subject><subject>Workload</subject><subject>Workloads</subject><issn>1066-8888</issn><issn>0949-877X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9kE9PwzAMxSMEEmPwBThV4hzmxF2THNHEP2mIA0PiFqWtizqNdsSdYN-eQJG44YPtw3vP1k-IcwWXCsDMODVjJWiUAFYX0h2ICbjcSWvMy6GYKCgKaVMdixPmNQBorecTMVv1HyHWnDUb-mzLdtMO-yx0dRb7csdDR8xZ32TLp4dsiER8Ko6asGE6-51T8XxzvVrcyeXj7f3iaikrVPkgGwwVVkHNqWpUnrbC2pJMjTagccFVVlM5pzqkRxABgqXg0EIBtnC2JpyKizF3G_v3HfHg1_0udumkR7A5mlzlOqn0qKpizxyp8dvYvoW49wr8Nxg_gvEJjP8B410y4WjiJO5eKf5F_-P6AgAuZSQ</recordid><startdate>2024</startdate><enddate>2024</enddate><creator>Huynh, Andy</creator><creator>Chaudhari, Harshal A.</creator><creator>Terzi, Evimaria</creator><creator>Athanassoulis, Manos</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0003-1837-0010</orcidid><orcidid>https://orcid.org/0000-0002-0444-4915</orcidid><orcidid>https://orcid.org/0000-0002-2843-6565</orcidid><orcidid>https://orcid.org/0000-0001-7809-9993</orcidid></search><sort><creationdate>2024</creationdate><title>Towards flexibility and robustness of LSM trees</title><author>Huynh, Andy ; Chaudhari, Harshal A. ; Terzi, Evimaria ; Athanassoulis, Manos</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c314t-f3ac3ca15ecf143ca688be7d38a379a9c82eb5eda0003300a8ea9380608698de3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science</topic><topic>Data systems</topic><topic>Database Management</topic><topic>Memory management</topic><topic>Optimization</topic><topic>Robustness</topic><topic>Special Issue Paper</topic><topic>Tuning</topic><topic>Uncertainty</topic><topic>Workload</topic><topic>Workloads</topic><toplevel>online_resources</toplevel><creatorcontrib>Huynh, Andy</creatorcontrib><creatorcontrib>Chaudhari, Harshal A.</creatorcontrib><creatorcontrib>Terzi, Evimaria</creatorcontrib><creatorcontrib>Athanassoulis, Manos</creatorcontrib><collection>SpringerOpen</collection><collection>CrossRef</collection><jtitle>The VLDB journal</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Huynh, Andy</au><au>Chaudhari, Harshal A.</au><au>Terzi, Evimaria</au><au>Athanassoulis, Manos</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Towards flexibility and robustness of LSM trees</atitle><jtitle>The VLDB journal</jtitle><stitle>The VLDB Journal</stitle><date>2024</date><risdate>2024</risdate><volume>33</volume><issue>4</issue><spage>1105</spage><epage>1128</epage><pages>1105-1128</pages><issn>1066-8888</issn><eissn>0949-877X</eissn><abstract>Log-structured merge trees (LSM trees) are increasingly used as part of the storage engine behind several data systems, and are frequently deployed in the cloud. As the number of applications relying on LSM-based storage backends increases, the problem of performance tuning of LSM trees receives increasing attention. We consider both nominal tunings—where workload and execution environment are accurately known a priori—and robust tunings—which consider uncertainty in the workload knowledge. This type of workload uncertainty is common in modern applications, notably in shared infrastructure environments like the public cloud. To address this problem, we introduce Endure , a new paradigm for tuning LSM trees in the presence of workload uncertainty. Specifically, we focus on the impact of the choice of compaction policy, size ratio, and memory allocation on the overall performance. Endure considers a robust formulation of the throughput maximization problem and recommends a tuning that offers near-optimal throughput when the executed workload is not the same, instead in a neighborhood of the expected workload. Additionally, we explore the robustness of flexible LSM designs by proposing a new unified design called K-LSM that encompasses existing designs. We deploy our robust tuning system, Endure , on a state-of-the-art key-value store, RocksDB, and demonstrate throughput improvements of up to 5 × in the presence of uncertainty. Our results indicate that the tunings obtained by Endure are more robust than tunings obtained under our expanded LSM design space. This indicates that robustness may not be inherent to a design, instead, it is an outcome of a tuning process that explicitly accounts for uncertainty.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s00778-023-00826-9</doi><tpages>24</tpages><orcidid>https://orcid.org/0000-0003-1837-0010</orcidid><orcidid>https://orcid.org/0000-0002-0444-4915</orcidid><orcidid>https://orcid.org/0000-0002-2843-6565</orcidid><orcidid>https://orcid.org/0000-0001-7809-9993</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1066-8888
ispartof The VLDB journal, 2024, Vol.33 (4), p.1105-1128
issn 1066-8888
0949-877X
language eng
recordid cdi_proquest_journals_3084374142
source Springer Nature; Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)
subjects Computer Science
Data systems
Database Management
Memory management
Optimization
Robustness
Special Issue Paper
Tuning
Uncertainty
Workload
Workloads
title Towards flexibility and robustness of LSM trees
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T22%3A53%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Towards%20flexibility%20and%20robustness%20of%20LSM%20trees&rft.jtitle=The%20VLDB%20journal&rft.au=Huynh,%20Andy&rft.date=2024&rft.volume=33&rft.issue=4&rft.spage=1105&rft.epage=1128&rft.pages=1105-1128&rft.issn=1066-8888&rft.eissn=0949-877X&rft_id=info:doi/10.1007/s00778-023-00826-9&rft_dat=%3Cproquest_cross%3E3084374142%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c314t-f3ac3ca15ecf143ca688be7d38a379a9c82eb5eda0003300a8ea9380608698de3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=3084374142&rft_id=info:pmid/&rfr_iscdi=true