{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:37Z","timestamp":1750306657638,"version":"3.41.0"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T00:00:00Z","timestamp":1417996800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Cloud-TM project"},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["PEst-OE\/EEI\/LA0021\/2013"],"award-info":[{"award-number":["PEst-OE\/EEI\/LA0021\/2013"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Auton. Adapt. Syst."],"published-print":{"date-parts":[[2015,1,14]]},"abstract":"<jats:p>This article addresses the problem of self-tuning the data placement in replicated key-value stores. The goal is to automatically optimize replica placement in a way that leverages locality patterns in data accesses, such that internode communication is minimized. To do this efficiently is extremely challenging, as one needs not only to find lightweight and scalable ways to identify the right assignment of data replicas to nodes but also to preserve fast data lookup. The article introduces new techniques that address these challenges. The first challenge is addressed by optimizing, in a decentralized way, the placement of the objects generating the largest number of remote operations for each node. The second challenge is addressed by combining the usage of consistent hashing with a novel data structure, which provides efficient probabilistic data placement. These techniques have been integrated in a popular open-source key-value store. The performance results show that the throughput of the optimized system can be six times better than a baseline system employing the widely used static placement based on consistent hashing.<\/jats:p>","DOI":"10.1145\/2641573","type":"journal-article","created":{"date-parts":[[2014,12,16]],"date-time":"2014-12-16T13:39:54Z","timestamp":1418737194000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["A\n            <scp>uto<\/scp>\n            P\n            <scp>lacer<\/scp>"],"prefix":"10.1145","volume":"9","author":[{"given":"Jo\u00e3o","family":"Paiva","sequence":"first","affiliation":[{"name":"INESC-ID, Instituto Superior T\u00e9cnico, Universidade de Lisboa, Portugal"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Ruivo","sequence":"additional","affiliation":[{"name":"Red Hat, Inc., London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Romano","sequence":"additional","affiliation":[{"name":"INESC-ID, Instituto Superior T\u00e9cnico, Universidade de Lisboa, Portugal"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu\u00eds","family":"Rodrigues","sequence":"additional","affiliation":[{"name":"INESC-ID, Instituto Superior T\u00e9cnico, Universidade de Lisboa, Portugal"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,12,8]]},"reference":[{"volume-title":"Proceedings of the 14th Middleware (Middleware'13)","author":"Ahmad M.","key":"e_1_2_1_1_1","unstructured":"M. Ahmad , B. Kemme , I. Brondino , M. Pati\u00f1o-Mart\u00ednez , and R. Jim\u00e9nez-Peris . 2013. Transactional failure recovery for a distributed key-value store . In Proceedings of the 14th Middleware (Middleware'13) . Springer, Berlin, China, 267--286. M. Ahmad, B. Kemme, I. Brondino, M. Pati\u00f1o-Mart\u00ednez, and R. Jim\u00e9nez-Peris. 2013. Transactional failure recovery for a distributed key-value store. In Proceedings of the 14th Middleware (Middleware'13). Springer, Berlin, China, 267--286."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.10.007"},{"volume-title":"Proceedings of the 4th Conference on USENIX Symposium on Internet Technologies and Systems (USITS'03)","author":"Amza C.","key":"e_1_2_1_3_1","unstructured":"C. Amza , A. Cox , and W. Zwaenepoel . 2003. Conflict-aware scheduling for dynamic content applications . In Proceedings of the 4th Conference on USENIX Symposium on Internet Technologies and Systems (USITS'03) . USENIX Association, Berkeley, CA. C. Amza, A. Cox, and W. Zwaenepoel. 2003. Conflict-aware scheduling for dynamic content applications. In Proceedings of the 4th Conference on USENIX Symposium on Internet Technologies and Systems (USITS'03). USENIX Association, Berkeley, CA."},{"key":"e_1_2_1_4_1","unstructured":"B. Ban and V. Blagojevic. 2002. Reliable Group Communication with JGroups 3.x. Technical Report. Red Hat Inc. Retrieved from http:\/\/www.jgroups.org.  B. Ban and V. Blagojevic. 2002. Reliable Group Communication with JGroups 3.x. Technical Report. Red Hat Inc. Retrieved from http:\/\/www.jgroups.org."},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"C. Bauer and G. King. 2006. Java Persistence with Hibernate. Manning Publications.   C. Bauer and G. King. 2006. Java Persistence with Hibernate. Manning Publications.","DOI":"10.3139\/9783446413825.fm"},{"volume-title":"Pattern Recognition and Machine Learning (Information Science and Statistics)","author":"Bishop C.","key":"e_1_2_1_6_1","unstructured":"C. Bishop . 2006. Pattern Recognition and Machine Learning (Information Science and Statistics) . Springer-Verlag , New York . C. Bishop. 2006. Pattern Recognition and Machine Learning (Information Science and Statistics). Springer-Verlag, New York."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800200.806177"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04)","author":"Chazelle B.","key":"e_1_2_1_10_1","unstructured":"B. Chazelle , J. Kilian , R. Rubinfeld , and A. Tal . 2004. The Bloomier filter: An efficient data structure for static support lookup tables . In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04) . Society for Industrial and Applied Mathematics. B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal. 2004. The Bloomier filter: An efficient data structure for static support lookup tables. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04). Society for Industrial and Applied Mathematics."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2011.60"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13174-011-0053-8"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454167"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 10th Symposium on Operating Systems Design and Implementation (OSDI'12)","author":"Corbett J.","year":"2012","unstructured":"J. Corbett and others. 2012 . Spanner: Google's globally-distributed database . In Proceedings of the 10th Symposium on Operating Systems Design and Implementation (OSDI'12) . USENIX Association, Berkeley, CA, 251--264. J. Corbett and others. 2012. Spanner: Google's globally-distributed database. In Proceedings of the 10th Symposium on Operating Systems Design and Implementation (OSDI'12). USENIX Association, Berkeley, CA, 251--264."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465370"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920853"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294281"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2371536.2371559"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347107"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/356876.356883"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/74850.74871"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.233"},{"key":"e_1_2_1_24_1","first-page":"4","article-title":"Data access pattern analysis and prediction for object-oriented applications","volume":"10","author":"Garbatov S.","year":"2011","unstructured":"S. Garbatov and J. Cachopo . 2011 . Data access pattern analysis and prediction for object-oriented applications . INFOCOMP Journal of Computer Science 10 , 4 (December 2011), 1--14. S. Garbatov and J. Cachopo. 2011. Data access pattern analysis and prediction for object-oriented applications. INFOCOMP Journal of Computer Science 10, 4 (December 2011), 1--14.","journal-title":"INFOCOMP Journal of Computer Science"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2480362.2480453"},{"volume-title":"Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02)","author":"Jim\u00e9nez-Peris R.","key":"e_1_2_1_26_1","unstructured":"R. Jim\u00e9nez-Peris , M. Pati\u00f1o Mart\u00ednez , and G. Alonso . 2002. Non-intrusive, parallel recovery of replicated data . In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02) . IEEE, Los Alamitos, CA, 150--159. R. Jim\u00e9nez-Peris, M. Pati\u00f1o Mart\u00ednez, and G. Alonso. 2002. Non-intrusive, parallel recovery of replicated data. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02). IEEE, Los Alamitos, CA, 150--159."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.879344"},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1081\/SQA-120034110","article-title":"CUSUM test for parameter change based on the maximum likelihood estimator","volume":"23","author":"Sangyeol L.","year":"2004","unstructured":"L. Sangyeol and L. Taewook . 2004 . CUSUM test for parameter change based on the maximum likelihood estimator . Sequential Analysis: Design Methods and Applications 23 , 2 (2004), 239 -- 256 . L. Sangyeol and L. Taewook. 2004. CUSUM test for parameter change based on the maximum likelihood estimator. Sequential Analysis: Design Methods and Applications 23, 2 (2004), 239--256.","journal-title":"Sequential Analysis: Design Methods and Applications"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2006.171"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.250099"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170042"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/IGCC.2011.6008602"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.50"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"H. Liu and H. Motoda. 1998. Feature Selection for Knowledge Discovery and Data Mining. Kluwer Academic Norwell MA.   H. Liu and H. Motoda. 1998. Feature Selection for Knowledge Discovery and Data Mining. Kluwer Academic Norwell MA.","DOI":"10.1007\/978-1-4615-5689-3"},{"key":"e_1_2_1_36_1","unstructured":"F. Marchioni and M. Surtani. 2012. Infinispan Data Grid Platform. PACKT Publishing.  F. Marchioni and M. Surtani. 2012. Infinispan Data Grid Platform. PACKT Publishing."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_27"},{"volume-title":"Machine Learning","author":"Mitchell T.","key":"e_1_2_1_38_1","unstructured":"T. Mitchell . 1997. Machine Learning . McGraw-Hill , New York . T. Mitchell. 1997. Machine Learning. McGraw-Hill, New York."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213844"},{"volume-title":"Proceedings of the 13th Middleware (Middleware'12)","author":"Peluso S.","key":"e_1_2_1_40_1","unstructured":"S. Peluso , P. Romano , and F. Quaglia . 2012a. SCORe: A scalable one-copy serializable partial replication protocol . In Proceedings of the 13th Middleware (Middleware'12) . Springer-Verlag, New York, 456--475. S. Peluso, P. Romano, and F. Quaglia. 2012a. SCORe: A scalable one-copy serializable partial replication protocol. In Proceedings of the 13th Middleware (Middleware'12). Springer-Verlag, New York, 456--475."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2012.55"},{"volume-title":"Programs for Machine Learning. Morgan Kaufmann","author":"Quinlan J. Ross","key":"e_1_2_1_42_1","unstructured":"J. Ross Quinlan . 1993. C4.5 : Programs for Machine Learning. Morgan Kaufmann , San Francisco, CA . J. Ross Quinlan. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco, CA."},{"key":"e_1_2_1_43_1","unstructured":"RedHat\/JBoss. 2013. Non Blocking State Transfer V2. Retrieved from https:\/\/github.com\/infinispan\/infinispan\/wiki\/Non-Blocking-State-Transfer-V2.  RedHat\/JBoss. 2013. Non Blocking State Transfer V2. Retrieved from https:\/\/github.com\/infinispan\/infinispan\/wiki\/Non-Blocking-State-Transfer-V2."},{"key":"e_1_2_1_44_1","volume-title":"Technical Report 7. INESC-ID.","author":"Romano P.","year":"2014","unstructured":"P. Romano , M. Little , F. Quaglia , L. Rodrigues , and V. Ziparo . 2014 . Cloud-TM: Transactional, Object-oriented , Self-tuning Cloud Data Store . Technical Report 7. INESC-ID. P. Romano, M. Little, F. Quaglia, L. Rodrigues, and V. Ziparo. 2014. Cloud-TM: Transactional, Object-oriented, Self-tuning Cloud Data Store. Technical Report 7. INESC-ID."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/PRDC.2011.21"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.26"},{"volume-title":"Proceedings of the 11th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS'11)","author":"Vila\u00e7a R.","key":"e_1_2_1_47_1","unstructured":"R. Vila\u00e7a , R. Oliveira , and J. Pereira . 2011. A correlation-aware data placement strategy for key-value stores . In Proceedings of the 11th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS'11) . Springer-Verlag, 214--227. R. Vila\u00e7a, R. Oliveira, and J. Pereira. 2011. A correlation-aware data placement strategy for key-value stores. In Proceedings of the 11th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS'11). Springer-Verlag, 214--227."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998582.1998623"},{"key":"e_1_2_1_49_1","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques","author":"Witten I.","year":"2005","unstructured":"I. Witten and E. Frank . 2005 . Data Mining: Practical Machine Learning Tools and Techniques , Second Edition (Morgan Kaufmann Series in Data Management Systems). Morgan Kaufmann , San Francisco, CA. I. Witten and E. Frank. 2005. Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems). Morgan Kaufmann, San Francisco, CA."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2435204.2435205"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.27"},{"key":"e_1_2_1_52_1","unstructured":"V. Ziparo F. Cottefoglie D. Calisi M. Zaratti F. Giannone and P. Romano. 2013. D4.3 - Prototype of pilot application I. In Cloud-TM Project. Retrieved from http:\/\/cloudtm.ist.utl.pt\/.  V. Ziparo F. Cottefoglie D. Calisi M. Zaratti F. Giannone and P. Romano. 2013. D4.3 - Prototype of pilot application I. In Cloud-TM Project. Retrieved from http:\/\/cloudtm.ist.utl.pt\/."}],"container-title":["ACM Transactions on Autonomous and Adaptive Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2641573","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2641573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:56:18Z","timestamp":1750229778000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2641573"}},"subtitle":["Scalable Self-Tuning Data Placement in Distributed Key-Value Stores"],"short-title":[],"issued":{"date-parts":[[2014,12,8]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,1,14]]}},"alternative-id":["10.1145\/2641573"],"URL":"https:\/\/doi.org\/10.1145\/2641573","relation":{},"ISSN":["1556-4665","1556-4703"],"issn-type":[{"type":"print","value":"1556-4665"},{"type":"electronic","value":"1556-4703"}],"subject":[],"published":{"date-parts":[[2014,12,8]]},"assertion":[{"value":"2014-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}