References - Transaction Processing - page 365

Feng Chen, David A. Koufaty, and Xiaodong Zhang. Understanding intrinsic characteristics and
system implications of flash memory based solid state drives. In Proc. of the Eleventh Internat.
Joint Conf. on Measurement and Modeling of Computer Systems, SIGMETRICS/Performance ,
pages 181-192. ACM Press, 2009.
Jianjun Chen, Chris Douglas, Michi Mutsuzaki, Patrick Quaid, Raghu Ramakrishnan, Sriram Rao,
and Russell Sears. Walnut: a unified cloud object store. In Proc. of the 2012 ACM SIGMOD
Internat. Conf. on Management of Data , pages 743-754. ACM Press, 2012.
Douglas Comer. The ubiquitous b-tree. ACM Comput. Surv. , 11(2):121-137, 1979.
Sudipto Das, Divyakant Agrawal, and Amr El Abbadi. G-store: a scalable data store for
transactional multi key access in the cloud. In SoCC'10, Proc. of the 1st ACM Symp. on Cloud
Computing , pages 163-174, 2010.
David J. DeWitt, Randy H. Katz, Frank Olken, Leonard D. Shapiro, Michael Stonebraker, and
David A. Wood. Implementation techniques for main memory database systems. In Proc. of
the 1984 ACM SIGMOD Internat. Conf. on Management of data , pages 1-8. ACM Press, 1984.
David J. DeWitt, Philippe Futtersack, David Maier, and Fernando Vélez. A study of three
alternative workstation-server architectures for object oriented database systems. In VLDB
1990, Proc. of the 16th Internat. Conf. on Very Large Data Bases , pages 107-121, 1990.
Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, and Irving L. Traiger. On the notions of
consistency and predicate locks. Technical report, IBM Research Laboratory, San Jose, Nov.
1974.
Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, and Irving L. Traiger. The notions of consistency
and predicate locks in a database system. Commun. ACM , 19(11):624-633, 1976.
Georgios Evangelidis, David B. Lomet, and Betty Salzberg. The hB-Pi-tree: A multi-attribute
index supporting concurrency, recovery and node consolidation. VLDB J. , 6(1):1-25, 1997.
Alan Fekete, Dimitrios Liarokapis, Elizabeth J. O'Neil, Patrick E. O'Neil, and Dennis Shasha.
Making snapshot isolation serializable. ACM Trans. Database Syst. , 30(2):492-528, 2005.
Michael J. Franklin, Michael J. Zwilling, C. K. Tan, Michael J. Carey, and David J. DeWitt. Crash
recovery in client-server EXODUS. In Proc. of the 1992 ACM SIGMOD Internat. Conf. on
Management of Data , pages 165-174. ACM Press, 1992.
Michael J. Franklin, Björn Thór Jónsson, and Donald Kossmann. Performance tradeoffs for client-
server query processing. In Proc. of the 1996 ACM SIGMOD Internat. Conf. on Management
of Data , pages 149-160. ACM Press, 1996.
Michael J. Franklin, Michael J. Carey, and Miron Livny. Transactional client-server cache
consistency: Alternatives and performance. ACM Trans. Database Syst. , 22(3):315-363, 1997.
Ada Wai-Chee Fu and Tiko Kameda. Concurrency control of nested transactions accessing B-
trees. In Proc. of the Eighth ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database
Systems , pages 270-285. ACM Press, 1989.
Seth Gilbert and Nancy A. Lynch. Brewer's conjecture and the feasibility of consistent, available,
partition-tolerant web services. SIGACT News , 33(2), 2002.
Goetz Graefe. Sorting and indexing with partitioned B-trees. In CIDR 2003, Proc. of the First

Biennial Conf. on Innovative Data Systems Research , 2003a.
Goetz Graefe. Partitioned B-trees—a user's guide. In BTW 2003, Datenbanksysteme für Business,
Technologie und Web, Tagungsband der 10. BTW-Konferenz , pages 668-671, 2003b.
Goetz Graefe. Write-optimized B-trees. In VLDB 2004, Proc. of the 30th Internat. Conf. on Very
Large Data Bases , pages 672-683. Morgan Kaufmann, 2004.
Goetz Graefe. A survey of B-tree locking techniques. ACM Trans. Database Syst. , 35(3):16:1-26,
2010.
Goetz Graefe. Modern B-tree techniques. Foundations and Trends in Databases , 3(4):203-402,
2011.
Goetz Graefe. A survey of B-tree logging and recovery techniques. ACM Trans. Database Syst. ,
37(1):1:1-35, 2012.
Goetz Graefe, Hideaki Kimura, and Harumi A. Kuno. Foster B-trees. ACM Trans. Database Syst. ,
37(3):17:1-29, 2012.