---

M149 Database Management Systems - Fall'24

---

Class Coordinates:

• Meeting time: Mon at 18:00-21:00, Classroom Z
  
• Discussion Forum at Piazza
• Link of the course to e-class

---

Prerequisites:

• Basic knowledge of Databases, Algorithms, and Operating Systems.
• Ease in programming (in the Linux/Unix environment).
• Strong knowledge of either Java or Python.
• Syllabus for the class.

---

Instructor:

• Alex Delis,
• A37, tel: 210 727 5212,
• Office Hours: Wed 17:30-19:00
• e-mail: ad -at*- di -dot+ uoa +dot- gr

---

Announcements:

• 26/10: The mp4 of the Fri (25/10) Session is posted (section Exams & Projects).
• 22/10: The class of 28/10 will occur on Friday 01/11 @18:00 in Z.
• 22/10: Project I is available (see below).
• 21/10: There is going to be a Webex session (https://uoa.webex.com/meet/ad) on Friday 25/10/24 at 18:00 where Project I will be presented.
• 17/10: Monday (21/10) class will take place as scheduled @18:00 in Z.
• 16/10: Homework 1 is out (see below).
• 25/09: Students from Interdisciplinary Postgraduate Degrees are not part of this Section (M149) in Fall 2024. Please, contact your program(s) to find out specifics for your classes.

---

References:

1. A. Silberschatz, H.F. Korth and S. Sudarshani, Database System Concepts, 7th Edition, McGraw-Hill, NY, NY 2020.
2. P.A. Bernstein, V. Hatzilacos and N. Goodman, Concurrency Control and Recovery in Database Systems, Addison Wesley Publishing Company, Reading, MA, 1987.
3. J. Gray and A. Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufmann Publishers, San Fransisco, CA, 1991.

---

Slides:

• Slides - F24
• Material Covered So Far

---

Exams and Projects:

• Project I: Due 09/12/24.

---

Homework Assignments:

• Homework 1: due 23/10
• A Quick Guide on How to Write Summaries

---

Papers:

• 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.


• Rick Cattell, Scalable SQL and NoSQL data stores SIGMOD Record vol. 39, no. 4, pp. 12-27, 2010.


• V. Poosala, Zipf's Law, 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, A 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.


• D. Comer, Ubiquitous B-Tree ACM Computing Surveys, vol. 11 , no. 2, June 1979.


• J. Jannink, Deletion in B+-trees. ACM SIGMOD RECORD, vol.24, no.1, pp. 33-38, 1995.


• M. Stonebraker, 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.


• 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.


• D. P. Reed, Implementing atomic actions on decentralized data. , ACM Trans. Comput. Syst. vol. 1, no. 1, Feb. 1983


• J. Bentley, 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.


• W. Litwin, Linear hashing: A new tool for file and table addressing, Proc. 6th Conference on Very Large Databases, 1980. (a related chapter on Linear Hashing by D. Zhang et al. and a tech-note by J. Chronis et al. )


• L. Shapiro, 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.


• D. Lomet, Simple, Robust and Highly Concurrent B-trees with Node Deletion, Proc. of IEEE Int. Conf. on Data Engineering (ICDE), Boston, MA, March 2004.


• Y. Ioannidis, Query Optimization, ACM Computing Surveys, pp. 103--114, 1996.


• A. Guttman, 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.


• T. Sellis Multiple-query optimization, ACM Trans. on Database Systems, vol. 13, no. 1, pp. 23-52, March 1988.

---

Misc:
Go2Link

---

ad[-*AT*-]di.uoa.gr