[1] BERNSTEIN P A, GOODMAN N. Concurrency control in distributed database systems[J]. ACM Computing Surveys, 1981, 13(2): 185-221.
[2] STONEBRAKER M. The traditional RDBMS wisdom is (almost certainly) all wrong[EB/OL]. (2013-05-30) [2021-06-28]. https://slideshot.epfl.ch/play/suri_stonebraker.
[3] PAVLO A, CURINO C, ZDONIK S B. Skew-aware automatic database partitioning in shared-nothing, parallel OLTP sys-tems[C]//Proceedings of the 2012 ACM SIGMOD Interna-tional Conference on Management of Data, Scottsdale, May 20-24, 2012. New York: ACM, 2012: 61-72.
[4] ELMORE A J, ARORA V, TAFT R, et al. Squall: fine-grained live reconfiguration for partitioned main memory databases[C]//Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, May 31-Jun 4, 2015. New York: ACM, 2015: 299-313.
[5] POLYCHRONIOU O, SEN R, ROSS K A. Track join: dis-tributed joins with minimal network traffics[C]//Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, Snowbird, Jun 22-27, 2014. New York: ACM, 2014: 1483-1494.
[6] BINNIG C, CROTTY A, GALAKATOS A, et al. The end of slow networks: it??s time for a redesign[J]. Proceedings of the VLDB Endowment, 2015, 9(7): 528-539.
[7] KALIA A, KAMINSKY M, ANDERSEN D G. Design gui-delines for high performance RDMA systems[C]//Procee-dings of the 2016 USENIX Annual Technical Conference, Denver, Jun 22-24, 2016. Berkeley: USENIX Association, 2016: 437-450.
[8] KALIA A, KAMINSKY M, ANDERSEN D G. Using RDMA efficiently for key-value services[C]//Proceedings of the 2014 ACM SIGCOMM, Chicago, Aug 17-22, 2014. New York: ACM, 2014: 295-306.
[9] ZAMANIAN E, BINNIG C, KRASKA T, et al. The end of a myth: distributed transactions can scale[J]. Proceedings of the VLDB Endowment, 2017, 10(6): 685-696.
[10] DRAGOJEVI? A, NARAYANAN D, HODSON O, et al. FaRM: fast remote memory[C]//Proceedings of the 11th USENIX Symposium on Networked Systems Design and Implemen-tation, Seattle, Apr 2-4, 2014. Berkeley: USENIX Associa-tion, 2014: 401-414.
[11] WEI X D, DONG Z Y, CHEN R. Deconstructing RDMA-enabled distributed transactions: hybrid is better![C]//Procee-dings of the 13th USENIX Symposium on Operating Systems Design and Implementation, Carlsbad, Oct 8-10, 2018. Ber-keley: USENIX Association, 2018: 233-251.
[12] BARTHELS C, MüLLER I, TARANOV K, et al. Strong consistency is not hard to get: two-phase locking and two-phase commit on thousands of cores[J]. Proceedings of the VLDB Endowment, 2019, 12(13): 2325-2338.
[13] YOON D Y, CHOWDHURY M, MOZAFARI B. Distributed lock management with RDMA: decentralization without star-vation[C]//Proceedings of the 2018 ACM SIGMOD Interna-tional Conference on Management of Data, Houston, Jun 10-15, 2018. New York: ACM, 2018: 1571-1586.
[14] SHAMIS A, RENZELMANN M, NOVAKOVIC S, et al. Fast general distributed transactions with opacity[C]//Pro-ceedings of the 2019 ACM SIGMOD International Con-ference on Management of Data, Amsterdam, Jun 30-Jul 5, 2019. New York: ACM, 2019: 433-448.
[15] KALIA A, KAMINSKY M, ANDERSEN D G. FaSST: fast, scalable and simple distributed transactions with two-sided (RDMA) datagram RPCs[C]//Proceedings of the 12th USENIX Symposium on Operating Systems Design and Im-plementation, Savannah, Nov 2-4, 2016. Berkeley: USENIX Association, 2016: 185-201.
[16] WEI X D, SHI J X, CHEN Y Z, et al. Fast in-memory tran-saction processing using RDMA and HTM[C]//Proceedings of the 25th Symposium on Operating Systems Principles, Monterey, Oct 4-7, 2015. New York: ACM, 2015: 87-104.
[17] CHEN Y Z, WEI X D, SHI J X, et al. Fast and general distributed transactions using RDMA and HTM[C]//Procee-dings of the 11th European Conference on Computer Sys-tems, London, Apr 18-21, 2016. New York: ACM, 2016: 1-17.
[18] HARDING R, AKEN D V, PAVLO A, et al. An evaluation of distributed concurrency control[J]. Proceedings of the VLDB Endowment, 2017, 10(5): 553-564. |