MDE 515: Database Management Systems

Timing Data:
Tuesday, 15:00-18:00

Location:
Deprt. of Informatics and Telecoms,
Univ. of Athens,
Aithousa  Z,  Informatics Builds.

Instructor:
A. Delis,
Informatics Building,  Room A37
tel: 210 727.5212
e-mail: ad +at- di dot uoa dot gr

Prerequisites:

  • Basic knowledge of Databases, Algorithms, and Operating Systems.
  • Ease in programming (in the Unix environment).
  • Excellent knowledge of  either  C, C++ or Java.
    • References:
  • 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.
    • Slides: set1, set2, set3, set4, set5, set6, set7, set8, set9, set10, set11, set12.

    note1.

    Projects:
    Project I: ps, pdf.
  • Demostration dates: Thur. 19/1 and Fri. 20/1

    • Project II: ps, pdf.
    ¤ There is also the alternative project: ps, pdf.

    B+Tree Algorithms: insertion and deletion
    Papers:
  • 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.

  • Carey, M. J. and Muhanna, W. A. 1986. 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

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

  • L. Witold, Linear hashing: A new tool for file and table addressing, Proc. 6th Conference on Very Large Databases, 1980. (an related note on Linear Hashing by D. Zhang 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 the 2004 IEEE Int. Conf. on Data Engineering (ICDE).

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

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

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