|
|
|
Additional Material
Supplement Textbook
Universal Caching
- UC Caching
Self-tuning caching: the Universal Caching algorithm
Ganesh Santhanakrishnan, Ahmed Amer and Panos K. Chrysanthis
Software—Practice and Experience, 36:1179–118, 2006
Disk Scheduling
- TraQIOS
Optimizing I/O-Intensive Transactions in Highly Interactive Applications
Mohamed A. Sharaf, Panos K. Chrysanthis, Alexandros Labrinidis, and Cristiana Amza,
SIGMOD, June 2009.
Solid State Drives
- Design Tradeoffs for SSD Performance
- QMD
QMD: Exploiting Flash for Energy Efficient Disk Arrays
Sean M. Snyder, Shimin Chen, Panos K. Chrysanthis, and Alexandros Labrinidis
Proc. of Seventh International Workshop on Data Management on New Hardware, 2011.
Row & Column Stores
Indexing
- Additional material on B-trees
(remember the difference between B+ trees and B trees)
- Original paper on R-trees
R-Trees: A Dynamic Index Structure for Spatial Searching
Antonin Guttman, SIGMOD, June 1984
- Original paper on k-D trees
Multidimensional binary search trees used for associative searching
Communications of the ACM, September 1975
- Survey paper on Quadtrees
The Quadtree and Related Hierarchical Data Structures
by Hanan Samet, ACM Computing Surveys, June 1984
- LSM Tree (Index and file)
References
Atomic Commit Protocols
- Survey paper on Atomic Commit Protocols
Recovery and Performance of Atomic Commit Processing in Distributed Database Systems by Panos K. Chrysanthis, George Samaras and Yousef J. Al-Houmaily,
Chapter 13, Recovery Mechanisms in Database Systems, Vijay Kumar (Editor) and Meichun Hsu (Editors), Prentice Hall, 1997.
- Original paper on Presume Any ACP
Atomicity with Incompatible Presumptions by Yousef J. Al-Houmaily and Panos K. Chrysanthis, ACM PODS, 1999
- Original paper on Paxos
Paxos Made Simple, Leslie Lamport,
2001
|
|
