{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:39:46Z","timestamp":1777106386361,"version":"3.51.4"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2019,6]]},"abstract":"<jats:p>Tuning the buffer size appropriately is critical to the performance of a cloud database, since memory is usually the resource bottleneck. For large-scale databases supporting heterogeneous applications, configuring the individual buffer sizes for a significant number of database instances presents a scalability challenge. Manual optimization is neither efficient nor effective, and even not feasible for large cloud clusters, especially when the workload may dynamically change on each instance. The difficulty lies in the fact that each database instance requires a different buffer size that is highly individualized, subject to the constraint of the total buffer memory space. It is imperative to resort to algorithms that automatically orchestrate the buffer pool tuning for the entire database instances.<\/jats:p>\n          <jats:p>To this end, we design iBTune that has been deployed for more than 10, 000 OLTP cloud database instances in our production system. Specifically, it leverages the information from similar workloads to find out the tolerable miss ratio of each instance. Then, it utilizes the relationship between miss ratios and allocated memory sizes to individually optimize the target buffer pool sizes.<\/jats:p>\n          <jats:p>To provide a guaranteed level of service level agreement (SLA), we design a pairwise deep neural network that uses features from measurements on pairs of instances to predict the upper bounds of the request response times. A target buffer pool size can be adjusted only when the predicted response time upper bound is in a safe limit. The successful deployment on a production environment, which safely reduces the memory footprint by more than 17% compared to the original system that relies on manual configurations, demonstrates the effectiveness of our solution.<\/jats:p>","DOI":"10.14778\/3339490.3339503","type":"journal-article","created":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:50:07Z","timestamp":1565182207000},"page":"1221-1234","source":"Crossref","is-referenced-by-count":75,"title":["iBTune"],"prefix":"10.14778","volume":"12","author":[{"given":"Jian","family":"Tan","sequence":"first","affiliation":[{"name":"Alibaba Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tieying","family":"Zhang","sequence":"additional","affiliation":[{"name":"Alibaba Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifei","family":"Li","sequence":"additional","affiliation":[{"name":"Alibaba Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Chen","sequence":"additional","affiliation":[{"name":"Alibaba Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qixing","family":"Zheng","sequence":"additional","affiliation":[{"name":"Alibaba Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Zhang","sequence":"additional","affiliation":[{"name":"Alibaba Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Honglin","family":"Qiao","sequence":"additional","affiliation":[{"name":"Alibaba Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Shi","sequence":"additional","affiliation":[{"name":"Alibaba Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Cao","sequence":"additional","affiliation":[{"name":"Alibaba Group"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[{"name":"Alibaba Group"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Docker. https:\/\/www.docker.com.  Docker. https:\/\/www.docker.com."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.64"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.649565"},{"key":"e_1_2_1_4_1","volume-title":"Approximation of LRU caches miss rate: Application to power-law popularities. arXiv:1705.10738","author":"Berthet C.","year":"2017","unstructured":"C. Berthet . Approximation of LRU caches miss rate: Application to power-law popularities. arXiv:1705.10738 , 2017 . C. Berthet. Approximation of LRU caches miss rate: Application to power-law popularities. arXiv:1705.10738, 2017."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_2_1_7_1","volume-title":"MAC-M-384","author":"Corbato F. J.","year":"1968","unstructured":"F. J. Corbato . A paging experiment with the multics system. MIT Project MAC Report , MAC-M-384 , 1968 . F. J. Corbato. A paging experiment with the multics system. MIT Project MAC Report, MAC-M-384, 1968."},{"key":"e_1_2_1_8_1","first-page":"12","volume-title":"Proceedings of the 9th International Conference on Peer-to-peer Systems, IPTPS'10","author":"D\u00e1n G.","year":"2010","unstructured":"G. D\u00e1n and N. Carlsson . Power-law revisited: Large scale measurement study of p2p content popularity . In Proceedings of the 9th International Conference on Peer-to-peer Systems, IPTPS'10 , pages 12 -- 12 , Berkeley, CA, USA , 2010 . USENIX Association. G. D\u00e1n and N. Carlsson. Power-law revisited: Large scale measurement study of p2p content popularity. In Proceedings of the 9th International Conference on Peer-to-peer Systems, IPTPS'10, pages 12--12, Berkeley, CA, USA, 2010. USENIX Association."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2903733"},{"issue":"1","key":"e_1_2_1_10_1","first-page":"2","article-title":"Overview of the ransac algorithm","volume":"4","author":"Derpanis K. G.","year":"2010","unstructured":"K. G. Derpanis . Overview of the ransac algorithm . Image Rochester NY , 4 ( 1 ): 2 -- 3 , 2010 . K. G. Derpanis. Overview of the ransac algorithm. Image Rochester NY, 4(1):2--3, 2010.","journal-title":"Image Rochester NY"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 24th International Teletraffic Congress, page 8. International Teletraffic Congress","author":"Fricker C.","year":"2012","unstructured":"C. Fricker , P. Robert , and J. Roberts . A versatile and accurate approximation for lru cache performance . In Proceedings of the 24th International Teletraffic Congress, page 8. International Teletraffic Congress , 2012 . C. Fricker, P. Robert, and J. Roberts. A versatile and accurate approximation for lru cache performance. In Proceedings of the 24th International Teletraffic Congress, page 8. International Teletraffic Congress, 2012."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.130"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.142"},{"key":"e_1_2_1_15_1","first-page":"81","volume-title":"15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18)","author":"Geng Y.","year":"2018","unstructured":"Y. Geng , S. Liu , Z. Yin , A. Naik , B. Prabhakar , M. Rosenblum , and A. Vahdat . Exploiting a natural network effect for scalable, fine-grained clock synchronization . In 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18) , pages 81 -- 94 , Renton, WA , 2018 . USENIX Association. Y. Geng, S. Liu, Z. Yin, A. Naik, B. Prabhakar, M. Rosenblum, and A. Vahdat. Exploiting a natural network effect for scalable, fine-grained clock synchronization. In 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18), pages 81--94, Renton, WA, 2018. USENIX Association."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-6226-1"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3314041"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703732"},{"key":"e_1_2_1_19_1","volume-title":"The Sixth INFORMS Telecommunications Conference","author":"Jelenkovi\u0107 P. R.","year":"2002","unstructured":"P. R. Jelenkovi\u0107 . Least-recently-used caching with Zipfs law requests . In The Sixth INFORMS Telecommunications Conference . Boca Raton, Florida , 2002 . P. R. Jelenkovi\u0107. Least-recently-used caching with Zipfs law requests. In The Sixth INFORMS Telecommunications Conference. Boca Raton, Florida, 2002."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/ep.13018"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_2_1_22_1","volume-title":"Aug.","author":"Krishnan S.","year":"2018","unstructured":"S. Krishnan , Z. Yang , K. Goldberg , J. Hellerstein , and I. Stoica . Learning to Optimize Join Queries With Deep Reinforcement Learning. ArXiv e-prints , Aug. 2018 . S. Krishnan, Z. Yang, K. Goldberg, J. Hellerstein, and I. Stoica. Learning to Optimize Join Queries With Deep Reinforcement Learning. ArXiv e-prints, Aug. 2018."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/301453.301487"},{"key":"e_1_2_1_25_1","volume-title":"ATC (USENIX Annual Technical Conference). USENIX","author":"Li Z. L.","year":"2018","unstructured":"Z. L. Li , M. C.-J. Liang , W. He , L. Zhu , W. Dai , J. Jiang , and G. Sun . Metis: Robustly tuning tail latencies of cloud systems . In ATC (USENIX Annual Technical Conference). USENIX , July 2018 . Z. L. Li, M. C.-J. Liang, W. He, L. Zhu, W. Dai, J. Jiang, and G. Sun. Metis: Robustly tuning tail latencies of cloud systems. In ATC (USENIX Annual Technical Conference). USENIX, July 2018."},{"issue":"3","key":"e_1_2_1_26_1","first-page":"18","article-title":"Classification and regression by randomforest","volume":"2","author":"Liaw A.","year":"2002","unstructured":"A. Liaw , M. Wiener , Classification and regression by randomforest . R news , 2 ( 3 ): 18 -- 22 , 2002 . A. Liaw, M. Wiener, et al. Classification and regression by randomforest. R news, 2(3):18--22, 2002.","journal-title":"R news"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196908"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752942"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1097871.1098137"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170081"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 2017 Conference on Innovative Data Systems Research, CIDR '17","author":"Pavlo A.","year":"2017","unstructured":"A. Pavlo , G. Angulo , J. Arulraj , H. Lin , J. Lin , L. Ma , P. Menon , T. Mowry , M. Perron , I. Quah , S. Santurkar , A. Tomasic , S. Toor , D. V. Aken , Z. Wang , Y. Wu , R. Xian , and T. Zhang . Self-driving database management systems . In Proceedings of the 2017 Conference on Innovative Data Systems Research, CIDR '17 , 2017 . A. Pavlo, G. Angulo, J. Arulraj, H. Lin, J. Lin, L. Ma, P. Menon, T. Mowry, M. Perron, I. Quah, S. Santurkar, A. Tomasic, S. Toor, D. V. Aken, Z. Wang, Y. Wu, R. Xian, and T. Zhang. Self-driving database management systems. In Proceedings of the 2017 Conference on Innovative Data Systems Research, CIDR '17, 2017."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICONS.2008.51"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/954339.954341"},{"key":"e_1_2_1_34_1","volume-title":"Data mining with decision trees: theory and applications","author":"Rokach L.","year":"2008","unstructured":"L. Rokach and O. Z. Maimon . Data mining with decision trees: theory and applications , volume 69 . World scientific, 2008 . L. Rokach and O. Z. Maimon. Data mining with decision trees: theory and applications, volume 69. World scientific, 2008."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2006.18.7.1678"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(02)00226-2"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1182635.1164220"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1152633.1152634"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190650"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219617.3219628"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353452.1353455"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064029"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/505696.505701"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536206.2536219"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2013.80"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908557"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646301"},{"key":"e_1_2_1_48_1","volume-title":"Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67(2):301--320","author":"Zou H.","year":"2005","unstructured":"H. Zou and T. Hastie . Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67(2):301--320 , 2005 . H. Zou and T. Hastie. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67(2):301--320, 2005."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3339490.3339503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:27:16Z","timestamp":1672223236000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3339490.3339503"}},"subtitle":["individualized buffer tuning for large-scale cloud databases"],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":48,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["10.14778\/3339490.3339503"],"URL":"https:\/\/doi.org\/10.14778\/3339490.3339503","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2019,6]]}}}