FLEXMVCC: Uma abordagem flexível para protocolos de controle de concorrência multi-versão
Resumo
Diferentes protocolos de controle de concorrência impactam o desempenho do banco de dados, dependendo do perfil da carga de trabalho. Sem conhecimento prévio desta carga e suas mudanças, a decisão na escolha de um protocolo se torna desafiadora. Para tanto, criamos o FLEXMVCC, que integra dois protocolos de controle de concorrência multi-versão compatíveis, um otimista e um pessimista, capaz de se adaptar conforme as mudanças na carga de trabalho. Experimentos preliminares mostram que a troca entre protocolos é viável e representa um ganho de desempenho em relação aos protocolos estáticos.
Referências
Cooper, B. F., Silberstein, A., Tam, E., Ramakrishnan, R., and Sears, R. (2010). Benchmarking cloud serving systems with ycsb. In Proceedings of the 1st ACM Symposium on Cloud Computing, SoCC ’10, pages 143–154, New York, NY, USA. ACM.
Diaconu, C., Freedman, C., Ismert, E., Larson, P.-A., Mittal, P., Stonecipher, R., Verma, N., and Zwilling, M. (2013). Hekaton: Sql server’s memory-optimized oltp engine. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pages 1243–1254. ACM.
Difallah, D. E., Pavlo, A., Curino, C., and Cudre-Mauroux, P. (2013). Oltp-bench: An extensible testbed for benchmarking relational databases. Proc. VLDB Endow., 7(4):277–288.
Harizopoulos, S., Abadi, D. J., Madden, S., and Stonebraker, M. (2008). Oltp through the looking glass, and what we found there. In Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pages 981–992. ACM.
Kung, H.-T. and Robinson, J. T. (1981). On optimistic methods for concurrency control. ACM Transactions on Database Systems (TODS), 6(2):213–226.
Larson, P.-Å., Blanas, S., Diaconu, C., Freedman, C., Patel, J. M., and Zwilling, M. (2011). High-performance concurrency control mechanisms for main-memory databases. Proceedings of the VLDB Endowment, 5(4):298–309.
Narula, N., Cutler, C., Kohler, E., and Morris, R. (2014). Phase reconciliation for contended in-memory transactions. In OSDI, volume 14, pages 511–524.
Pavlo, A., Angulo, G., Arulraj, J., Lin, H., Lin, J., Ma, L., Menon, P., Mowry, T. C., Perron, M., Quah, I., Santurkar, S., Tomasic, A., Toor, S., Aken, D. V., Wang, Z., Wu, Y., Xian, R., and Zhang, T. (2017). Self-driving database management systems. In CIDR. https://www.cidrdb.org.
Shang, Z., Li, F., Yu, J. X., Zhang, Z., and Cheng, H. (2016). Graph analytics through fine-grained parallelism. In Proceedings of the 2016 International Conference on Management of Data, pages 463–478. ACM.
Su, C., Crooks, N., Ding, C., Alvisi, L., and Xie, C. (2017). Bringing modular concurrency control to the next level. In Proceedings of the 2017 ACM International Conference on Management of Data, pages 283–297. ACM.
Tanger, D. (2017). Toward coordination-free and reconfigurable mixed concorrency control. Master’s thesis, University of Chicago.
Tu, S., Zheng, W., Kohler, E., Liskov, B., and Madden, S. (2013). Speedy transactions in multicore in-memory databases. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, pages 18–32. ACM.
Wang, T. and Kimura, H. (2016). Mostly-optimistic concurrency control for highly contended dynamic workloads on a thousand cores. Proceedings of the VLDB Endowment, 10(2):49–60.
Weikum, G. and Vossen, G. (2001). Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery. Elsevier.
Xie, C., Su, C., Littley, C., Alvisi, L., Kapritsos, M., and Wang, Y. (2015). High-performance acid via modular concurrency control. In Proceedings of the 25th Symposium on Operating Systems Principles, pages 279–294. ACM.
Yu, X. (2015). An evaluation of concurrency control with one thousand cores. PhD thesis, Massachusetts Institute of Technology.
Yu, X., Pavlo, A., Sanchez, D., and Devadas, S. (2016). Tictoc: Time traveling optimistic concurrency control. In Proceedings of the 2016 International Conference on Management of Data, pages 1629–1642. ACM.