References - Transaction Processing - page 367

Ricardo Jiménez-Peris, Marta Patiño-Martínez, Gustavo Alonso, and Bettina Kemme. Are
quorums an alternative for data replication? ACM Trans. Database Syst. , 28(3):257-294, 2003.
Ryan Johnson, Ippokratis Pandis, Radu Stoica, Manos Athanassoulis, and Anastasia Ailamaki.
Aether: A scalable approach to logging. Proc. of the VLDB Endowment , 3(1):681-692, 2010.
Ryan Johnson, Ippokratis Pandis, Radu Stoica, Manos Athanassoulis, and Anastasia Ailamaki.
Scalability of write-ahead logging on multicore and multisocket hardware. VLDB J. , 21(2):

239-263, 2012.
Theodore Johnson and Dennis Shasha. B-trees with inserts and deletes: Why free-at-empty is
better than merge-at-half. J. Comput. Syst. Sci. , 47(1):45-76, 1993.
Martin V. Jørgensen, René B. Rasmussen, Simonas Šaltenis, and Carsten Schjønning. Fb-tree:
aB C -tree for flash-based SSDs. In IDEAS 2011, Proc. of the 15th Internat. Database
Engineering and Applications Symp. , pages 34-42. ACM, 2011.
Michael Kifer, Arthur Bernstein, and Philip M. Lewis. Database Systems: An Application-Oriented
Approach. Second Edition . Pearson Addison-Wesley, 2006.
Donald E. Knuth. The Art of Computer Programming, Volume III: Sorting and Searching . Addison-
Wesley, 1973.
Marcel Kornacker, C. Mohan, and Joseph M. Hellerstein. Concurrency and recovery in generalized
search trees. In Proc. of the 1997 ACM SIGMOD Internat. Conf. on Management of Data , pages
62-72. ACM Press, 1997.
Yat-Sang Kwong and Derick Wood. A new method for concurrency in B-trees. IEEE Trans.

Software Eng. , 8(3):211-222, 1982.
Leslie Lamport. The part-time parliament. ACM Trans. Database Syst. , 16(2):133-169, 1998.
Butler W. Lampson and Howard E. Sturgis. Crash recovery in a distributed data storage system.
Technical report, Computer Science Laboratory, Xerox, Palo Alto Research Center, 1976.
Vladimir Lanin and Dennis Shasha. A symmetric concurrent b-tree algorithm. In Proc. of the Fall
Joint Computer Conference , pages 380-389. IEEE Computer Society, 1986.
Philip L. Lehman and S. Bing Yao. Efficient locking for concurrent operations on b-trees. ACM
Trans. Database Syst. , 6(4):650-670, 1981.
Justin J. Levandoski, David B. Lomet, and Sudipta Sengupta. The Bw-tree: A B-tree for
new hardware platforms. In ICDE 2013, Proc. of the 29th IEEE Internat. Conf. on Data
Engineering , pages 302-313. IEEE Computer Society, 2013.
Yinan Li, Bingsheng He, Qiong Luo, and Ke Yi. Tree indexing on flash disks. In ICDE 2009, Proc.
of the 25th Internat. Conf. on Data Engineering , pages 1303-1306. IEEE Computer Society,
2009.
Yinan Li, Bingsheng He, Jun Yang, Qiong Luo, and Ke Yi. Tree indexing on solid state drives.
Proc. of the VLDB Endowment , 3(1):1195-1206, 2010.
Timo Lilja, Riku Saikkonen, Seppo Sippu, and Eljas Soisalon-Soininen. Online bulk deletion. In
ICDE 2007, Proc. of the 23rd IEEE Internat. Conf. on Data Engineering , pages 956-965. IEEE
Computer Society, 2007.
Yi Lin, Bettina Kemme, Ricardo Jiménez-Peris, Marta Patiño-Martínez, and José Enrique
Armendáriz-Iñigo. Snapshot isolation and integrity constraints in replicated databases. ACM
Trans. Database Syst. , 34(2), 2009.
David Lomet. Advanced recovery techniques in practice. In Vijay Kumar and Meichun Hsu,
editors, Recovery Mechanisms in Database Systems , pages 697-710. Prentice Hall, 1998.
David B. Lomet. MLR: A recovery method for multi-level systems. In Proc. of the 1992 ACM
SIGMOD Internat. Conf. on Management of Data , pages 185-194. ACM Press, 1992.
David B. Lomet. Key range locking strategies for improved concurrency. In VLDB 1993, Proc. of
the 19th Internat. Conf. on Very Large Data Bases , pages 655-664. Morgan Kaufmann, 1993.
David B. Lomet. The evolution of effective B-tree: Page organization and techniques: A personal
account. SIGMOD Record , 30(3):64-69, 2001.
David B. Lomet. Simple, robust and highly concurrent B-trees with node deletion. In ICDE 2004,
Proc. of the 20th Internat. Conf. on Data Engineering , pages 18-28. IEEE Computer Society,
2004.