MDE 515: Database Management Systems
Informatics Builds, Classroom Z.
A. Delis, Room A37,
e-mail: ad +at- di dot uoa dot gr
Grading Policy: Homeworks 15%, 2 Projects 50%, Final 35%
Basic knowledge of Databases, Algorithms, and Operating Systems.
Ease in programming (in the Unix environment).
Working knowledge of either
Syllabus for the class.
P.A. Bernstein, V. Hatzilacos and N. Goodman,
Concurrency Control and Recovery in Database Systems,
Addison Wesley Publishing Company, Reading, MA, 1987.
A. Silberschatz, H.F. Korth and S. Sudarshani,
Database System Concepts,
5th or 6th Edition,
McGraw-Hill, NY, NY 2006.
J. Gray and A. Reuter,
Transaction Processing: Concepts and Techniques,
Morgan Kaufmann Publishers, San Fransisco, CA, 1993.
Projects & Final:
↦ Demostration Dates: 8/12 & 9/12.
(altenative) ↦ Demostration Dates: 22/2 & 23/2.
Final Examination: ↦
E. Meijer and G. Bierman,
A co-Relational Model of Data for Large Shared Data Banks,
ACM Queue Magazine, vol. 9, no. 3, March 2011.
Technical Report, 900 839 0750, CS, Univ. of Wisconsin, Madison, WI, 1995 based on
"G.K. Zipf, Human Hehavior and the Principle of Least Effort, Addison-Wesley, Reading, MA, 1949".
D. A. Patterson, G. Gibson and R. H. Katz,
Case for Redundant Arrays of Inexpensive Disks (RAID),
Proc. of ACM SIGMOD Int. Conf. on Management of Data pp. 109-116,
Chigago, IL, June 1987
J.N. Gray, R.A. Lorie, G.R. Putzolu and I.L. Traiger,
"Granularity of Locks and Degrees of Consistency in a Shared Database"
IFIP Working Conference on Modelling of Database Management Systems,
Freudenstadt, Germany, December 1975.
H. T. Kung and J. Robinson,
"On Optimistic Methods for Concurrency Control",
ACM Transactions on Database Systems, vol. 6, no. 2, pp. 213-226, 1981.
ACM Computing Surveys, vol. 11 , no. 2, June 1979.
Deletion in B+-trees.
ACM SIGMOD RECORD, vol.24, no.1, pp. 33-38, 1995.
Operating system support for database management
Communications of the ACM,
vol. 24 no. 7, July 1981.
M.J. Carey and W.A. Muhanna,
The performance of multiversion concurrency control algorithms.
ACM Trans. Comput. Syst. vol. 4, no. 4 Sep. 1986.
D. P. Reed,
Implementing atomic actions on decentralized data.
ACM Trans. Comput. Syst. vol. 1, no. 1, Feb. 1983
Multidimensional binary search trees used for associative searching,
Communications of the ACM, vol. 19. no. 9, pp. 509-517, Sept. 1975.
R. Fagin, J. Nievergelt, N. Pippenger, H.R. Strong,
Extendible hashing--a fast access method for dynamic files,
ACM Transaction on Database Systems, vol. 4, no. 3, pp 315-344, September 1979.
Linear hashing: A new tool for file and table addressing,
Proc. 6th Conference on Very Large Databases, 1980.
note on Linear Hashing by D. Zhang et al.)
Join Processing in Database Systems with Large Memories,
ACM Transactions on Database Systems, vol.11, pp. 239-264, 1986.
H.Chou and D.DeWitt,
An Evaluation of Buffer Management Strategies
for Relational Database Systems,
Proceedings of the VLDB Conf. pp.127-141, 1985.
Simple, Robust and Highly Concurrent B-trees with Node Deletion,
Proc. of IEEE Int. Conf. on Data Engineering (ICDE), Boston, MA, March 2004.
ACM Computing Surveys, pp. 103--114, 1996.
R-trees: A Dynamic Index Structure for Spatial Searching,
Proceedings of the ACM SIGMOD Conf., pp. 47-57, 1984.
M. Sharaf, P.K. Chrysanthis, A. Labrinidis, and K. Pruhs,
Algorithms and Metrics for Processing
Multiple Heterogeneous Continuous Queries,
ACM Trans. on Database Systems, vol. 32, no. 1, pp. 1-43, March 2008.
ACM Trans. on Database Systems, vol. 13, no. 1, pp. 23-52, March 1988.