References 397
[29] G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman,
A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels, “Dynamo:
Amazon’s highly available key-value store,” Symposium on Operating Systems
Principles, pp. 205–220, 2007.
[30] D. J. DeWitt, J. F. Naughton, and J. Burger, “Nested loops revisited,” Parallel
and distributed Information Systems, pp. 230–242, 1993.
[31] K. P. Eswaran, J. Gray, R. A. Lorie, and I. L. Traiger, “The notions of consis-
tency and predicate locks in a database system,” Communications of ACM,
vol. 19, no. 11, pp. 624–633, 1976.
[32] A. Fekete, D. Liarokapis, E. J. O’Neil, P. E. O’Neil, and D. Shasha, “Making
snapshot isolation serializable,” ACM Transactions on Database Systems,
vol. 30, no. 2, pp. 492–528, 2005.
[33] P. M. Fernandez, “Red Brick warehouse: A read-mostly RDBMS for open SMP
platforms,” Special Interest Group on Management of Data, p. 492, 1994.
[34] C. Freedman blog of October 07, 2008, retrieved August 16, 2011, at http://
blogs.msdn.com/craigfr/archive/2008/10/07/random-prefetching.aspx.
[35] P. Gassner, G. M. Lohman, K. B. Schiefer, and Y. Wang, “Query optimization
in the IBM DB2 family,” IEEE Data Engineerring on Bulletin, vol. 16, no. 4,
pp. 4–18, 1993.
[36] G. H. Gonnet, L. D. Rogers, and J. A. George, “An algorithmic and complexity
analysis of interpolation search,” Acta Informatica, vol. 13, pp. 39–52, 1980.
[37] N. K. Govindaraju, J. Gray, R. Kumar, and D. Manocha, “GPUTeraSort: High
performance graphics co-processor sorting for large database management,”
Special Interest Group on Management of Data, pp. 325–336, 2006.
[38] G. Graefe, “Options in physical database design,” Special Interest Group on
Management of Data Record, vol. 22, no. 3, pp. 76–83, 1993.
[39] G. Graefe, “Query evaluation techniques for large databases,” ACM Comput-
ing Surveys, vol. 25, no. 2, pp. 73–170, 1993.
[40] G. Graefe, “Iterators, schedulers, and distributed-memory parallelism,”
Software: Practice and Experience, vol. 26, no. 4, pp. 427–452, 1996.
[41] G. Graefe, “Per-
˚
Ake Larson: B-tree indexes and CPU caches,” International
Conference on Data Engineering , pp. 349–358, 2001.
[42] G. Graefe, “Executing nested queries,” Database Systems for Business, Tech-
nology and Web, pp. 58–77, 2003.
[43] G. Graefe, “Sorting and indexing with partitioned B-Trees,” Classless Inter
Domain Routing, 2003.
[44] G. Graefe, “Write-optimized B-trees,” International Journal on Very Large
Data Bases, pp. 672–683, 2004.
[45] G. Graefe, “B-tree indexes, interpolation search, and skew,” DaMoN,p.5,
2006.
[46] G. Graefe, “Implementing sorting in database systems,” ACM Computing
Surveys, vol. 38, no. 3, 2006.
[47] G. Graefe, “Efficient columnar storage in B-trees,” Special Interest Group on
Management of Data Record, vol. 36, no. 1, pp. 3–6, 2007.
[48] G. Graefe, “Hierarchical locking in B-tree indexes,” Database Systems for
Business, Technology and Web, pp. 18–42, 2007.