CSC 2508H : Advanced Database Management systems

Readings: 

Books:

• Readings in Database Systems, Fourth Edition. Edited by M. Stonebraker and J. Hellerstein.
• The Benchmark handbook for database and transaction processing systems, Second Edition. Edited by J. Gray.
• Database Management Systems, by R. Ramakrishnan.

Technical papers:

• PhD Comics
• Grad school
  

Note: entries in (*) are required reading for the course. The rest is important supplementary material

Introduction: The Roots

• Chapter 1 from Readings in Database Systems (*).
  
• In the beginning: An RDBMS history.
  
• Astrahan, N. et. al.,, System R: Relational Approach to Database Management, ACM TODS, 1 (2), 1976 (*)
  
• Chamberlin, D., et. al., A History and Evaluation of System R. CACM 24 (10) 1981.
  
• Stonebraker, M. et. al., The Design and Implementation of Ingres, ACM TODS, 1 (3) , 1976
  
• Stonebraker, M., Retrospection on A Database Management System ACM TODS, 5 (2) 1980 (*)
• System R page from SIGMOD anthology. System R web page; the article 'The 1995 SQL Reunion: People, Projects and Politics' is interesting reading.
  
• Links to commerial and experimental DB's.
• Food for thought: reading
  

Query Processing

• Background: Read chapters on query processing from Ramakrishnan's text (chapters 12,14) (*)
• G. Graefe. Query evaluation Techniques for Large Databases, ACM Computing Surveys, 25 (2) 1993 (*)
• Shapiro L., Join Processing in Database Systems with Large Memories, ACM TODS 11 (3) Sept 1986 (*) [summary]
  
• DeWitt et. al., An Evaluation of non-equijoin algorithms, VLDB 1991
  
• Graefe G., Dynamic Query Evaluation Plans: Some course corrections? IEEE Database Engineering 23 (2) June 2000
• Graefe G., The value of merge join and hash join in SQL Server. VLDB Sept 1999.
• IEEE Database engineering Special Issue on Query Processing in Commercial Database Systems, 16 (4) Dec 1993.
• Food for thought:reviewing
  

Query Optimization

• Background: Read chapter 15 from Ramakrishnan's text (*)
  
• Selinger et. al., Access Path Selection in a Relational Database management system, ACM SIGMOD 1979 (*). [summary]
  
• Chaudhuri S, An Overview of Query Optimization in Relational Systems ACM PODS 1998 (*)
• Stillger et. al., LEO: DB2's Learning Optimizer, VLDB 2001.
  
• Ioannidis Y et., al., Randomized Algorithms for Optimizing large Join Queries, ACM SIGMOD 1990.
• Jagadish et. al., Optimal Histograms with Quality Guarantees, VLDB 1998
• P. Gassner et. al., Query Optimization in the IBM DB2 Family, Data Engineering Bulleting 16 (4) 1993
  
• B. Babcock and S. Chaudhuri. Towards a Robust Query Optimizer: A Practical and Principled Approach. SIGMOD 2005 (*).
  
• Bruno N and S. Chaudhuri, Exploiting Statistics on Query Expressions for Optimization, SIGMOD 2002.
  
• R. Cole and G. Graefe, Optimization of Dynamic Query Evaluation Plans, SIGMOD 1994.
• Pirahesh et. al., Extensible Rule Based Query Rewrite Optimization in Starburst. SIGMOD 1992.
  
• Poosala et. al., Improved Histograms for selectivity estimation of range predicates, SIGMOD 1996.
  
• Ioannidis's writeup on query optimization.
• Chatterji et. al., On the complexity of approximate query optimization, PODS 2002.
• Food for thought: experiments
  

Buffer Management

• Chou H and DeWitt D., An Evaluation of Buffer Management Strategies for Relational Database systems VLDB 1985 (*) [summary]
  
• O' Neil et. al.,  The LRU-k Replacement Algorithm for Database Disk Buffering SIGMOD 1993 (*)
• Johnson et. al., 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm, VLDB 1994
• Stonebraker M., Operating Systems Support for Database Management CACM 24 (7) 1981
• Food for thought:grad school
  

Disks

• Background: Read chapter 11 from Silberschatz's text.
  
• Ruemmler et. al., An Introduction to Disk Drive Modelling, IEEE Computer 27 (3) 1994 (*) [summary]
  
• Gray et. al., The Five minute rule ten years later and other computer storage rules of thumb ACM SIGMOD Record 1997 (*)
• Voruganti et. al., Land Below a DBMS. ACM SIGMOD Record, Vol 33, No 1, March 2004. (*)
• Grochowski et. al., Technological Impact of Magnetic Disk Drives on Storage systems, IBM Sys Journal, Vol 42, No 2 2003 (*)
• M. Lesk, How much information is there in the world?
• Conversation with Jim Gray, ACM Queue magazine Vol 1, No 4, June 2003.
  
• Magnetic recording and information storage
  
• Anderson et. al., More than an interface - SCSI vs. ATA. Proceedings of FAST March 2003.
  
• Gray et. al., Rules of thumb in data engineering IEEE conference 2000
• Food for thought: grad school
  

Access methods

• Background: Read Chapter  28 from Ramakrishnan's text.
  
• O. Gunther et. al., Multidimensional access methods, ACM Computing Surveys 1998 (*)
  
• A. Guttman R-trees: A Dynamic index Structure for Spatial Searching, SIGMOD 1985 (*)
  
• The R* Trees: An Efficient and robust access method for points and rectangles, SIGMOD 1990 (*)
  
• Webber et. al., A Quantitative Analysis and Performance Study of Similarity Search Methods in High dimensional Spaces, VLDB 1998
• H. Hinterberger, J. Nievergelt and K. C. Sevcik, The Grid File: An Adaptable Symmetric multikey file structure, TODS 1984 (*) [summary].
  
• Ciaccia, et. al., M-tree: An Efficient Access Method for Similarity Search in High Dimensional Spaces, VLDB 1997
• B. Blum. Space Time Tradeoffs in Hash Coding with Allowable Errors. CACM 13 (7) 422-426, 1970
• C. Y. Chan, et. al., Bitmap index Design and Evaluation, SIGMOD 1998.
• Food for thought: grad school
  

Distributed Database Systems

• Background: Read Chapter 22 from Ramakrishnan's text.
  
• Williams et. al., R*: An Overview of the architecture TR RJ3325 1981
  
• Stonebraker et. al., Mariposa: A Wide Area Distributed Database, VLDB Journal 1996 (*)
  
• Sidell et. al., Data Replication in Mariposa, ICDE Conference 1996
• D. Kossman, The State of the Art in Distributed Query Processing, ACM Comp Surveys 2001 (*).
• Food for thought: research
  

Parallel Database Systems

• Background: Read Chapter 22 from ramakrishnan's text.
  
• DeWitt, et. al., The GAMMA Database Machine Project, IEEE TKDE 1990 (*)
• DeWitt et. al., Parallel Database Systems: The Future of High Performance Processing, CACM 1992 (*)
• Sloan, A Practical Implementation of the database machine teradata, HPTS 1992
• Food for thought: OOPSLA writing  ,  SOSP writing , SIGCOMM writing , (sorry no SIGMOD guide yet.. :-) )
  

Object Relational & Object Oriented Databases

• Background: Atkinson M et. al., The Object Oriented Database Systems Manifesto, SIGMOD 1989 (*)
• Background: Read Chapter 9 from Silberschatz's text.
  
• Lamb et. al., The ObjectStore system, CACM 1991 (*)
• Stonebraker, Inclusion of New Types in Relational Database Systems IEEE Conference on Data Engineering, 1986
• L. Haas, et. al., Starburst mid flight: As the dust clears. IEEE Transactions on Knowledge and Data Engineering, 2 (1) 143-160 , 1990 (*).
• (Historical Perspective) -- New Direction in DBMS (Interview) DBMS Online.
• Food for thought: sins of authors
  

Benchmarking

• Anon et. al., A Measure of Transaction Processing Power, Datamation 31 (7) 1985 (*)
  
• Eisenberg et. al., Standards in Practice, SIGMOD Record, 1998
• J. Gray Benchmark Handbook Chapters 1 and 3 (*)
• R. Othayoth and Meikel Poess. The Making of TPC-DS. VLDB 2006 (*)
• Gray et. al., Quickly Generating a Billion Record synthetic databases, SIGMOD 1994.
  
• Stephens et. al., Mudd: A Multidimensional Data Generator, WOSP 2004.
  
• Poess et. al., TPC-DS: Taking Decision Support Benchmarking to the  next level, SIGMOD 2002.
  
•  Poess M and J. Stephens, Generating Thousand Benchmark Queries in Seconds, VLDB 2004.
• Food for thought: writing/presenting
  

Main Memory Database Systems

• Molina et. al., Main Memory Database Systems : an overview TKDE 1992 (*)
• Bohannon et. al., The Architecture of the Dali main memory storage manager, Journal of Multimedia Tools and Applications, 1997 (*)

Advanced, Adaptive & Online Query Processing/Optimization

• Hellerstein et. al., Online Aggregation, SIGMOD 1997 (*)
  
• Haas et. al., Ripple Joins for Online Aggregation, SIGMOD 1999 (*)
  
• Hellerstein, et. al., Adaptive Query Processing: Technology in Evolution CACM 1993
• Avnur et. al., Eddies: Contineously Adaptive Query Processing, SIGMOD 2000 (*)
  
• Desphande et. al., An Initial Study of the Overhead of eddies, SIGMOD Record  33, 2004
• Kabra et. al., Efficient Mid Query Reoptimization of sub optimal query execution plans, SIGMOD 1998
  
• Markl et. al., Robust Query Processing Through Progressive Optimization, SIGMOD 2004.
• S. Babu P. Bizzaro. Adaptive Query Processing in the Looking Glass, CIDR 2005. (*)
  
• T. Sellis, Multiple Query Optimization, TODS 1988 (*).
• Dalvi et. al., Pipelining in Multi-Query Optimization, PODS 2001.
• Food for thought: talks , more talks
  

Data Warehousing & OLAP

• Gray, et. al., Data Cube: A Relational Aggregation Operator Generalizing Group-by, Cross Tab and Sub totals, Data Mining and Knowledge Discovery 1997 (*)
  
• Chaudhuri C and U. Dayal., An Overview of Data Warehousing and OLAP Technology, SIGMOD Record March 1997.(*)
  
• Agrawal et. al., On the Computation of Multidimensional Aggregates, VLDB 1996
  
• Beyer et. al., Bottom Up Computation of Sparse and Iceberg Data Cubes, SIGMOD 1999
  
• Harynarayan et. al., Implementing Data Cubes efficiently, SIGMOD 1996 (*)
  

Supplementary Texts

• Silberschatz et. al., Database Systems Concepts, 4th edition. 2001.
  
• P. O'Neil, Database: Principles, Programming, Performance, MK 1994
• Korth et. al., Database Systems Concepts, MG Hill 1991
• Gray et. al., Transaction processing: Concepts and Techniques, MK 1993