Skip to content

Latest commit

 

History

History
234 lines (112 loc) · 13 KB

README.md

File metadata and controls

234 lines (112 loc) · 13 KB
Raw

Database Research Paper Reading List

This includes a list of classic papers of database research in different fields. The original papers are included in the book: Readings in Database Systems Fourth Edition, MIT Press, January 2005, ISBN: 9780262693141.

Data Models and DBMS Architecture

  1. What Goes Around Comes Around
    Michael Stonebraker, Joseph M. Hellerstein.

  2. Anatomy of a Database System
    Joseph M. Hellerstein, Michael Stonebraker.

Query Processing

  1. Access Path Selection in Relation Database Management System
    Patricia G. Selinger, Morton M. Astrahan, Donald D. Chamberlin, Donald D. Chamberlin, Raymond A. Lorie, Thomas G. Price, Proc. SIGMOD Conference, 1979, 23-34.

  2. Join Processing in Datebase Systems with Large Main Memories
    Leonard D. Shapiro,11(3), 1986, 239-264.

  3. Parallel Database Systems: The Future of High Performance Database Systems.
    David J. DeWitt, Jim Gray, Commun. ACM, 35(6), 1992, 85-98.

  4. Encapsulation of Parallelism in the Volcano Query Processing System
    Goetz Graefe, Proc. SIGMOD Conference, 1990, 102-111.

  5. AlphaSort: A Cache-Sensitive Parallel External Sort
    Chris Nyberg, Tom Barclay, Zarka Cvetanovic,Jim Gray, David B. Lomet, VLDB J., 4(4), 1995, 603-627.

  6. R* Optimizer Validation and Performance Evaluation for Distributed Queries
    Lothar F. Mackert, Guy M. Lohman, Proc. VLDB, 1986, 149-159.

  7. Mariposa: A Wide-Area Distributed Database System
    Michael Stonebraker, Paul M. Aoki, Witold Litwin, Carl Staelin, Adam Sah, Andrew Yu, VLDB J., 5(1), 1996, 48-63.

Data Storage and Access Methods

  1. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles.
    Norbert Beckmann, Hans-Peter Kriegel,Ralf Schneider,Bernhard Seeger, Proc. SIGMOD Conference, 1990, 322-331.

  2. Operating System Support for Database Management.
    Michael Stonebraker, Commun. ACM, 24(7), 1981, 412-418.

  3. The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb.
    Jim Gray, Goetz Graefe, SIGMOD Record, 26(4), 1997, 63-68.

  4. A Case for Redundant Arrays of Inexpensive Disks (RAID)
    Randy H. Katz, David A. Patterson, Garth A. Gibson, Proc. SIGMOD Conference, 1988, 109-116.

Transaction Management

  1. Granularity of Locks and Degrees of Consistency in a Shared Data Base.
    Jim Gray, Raymond A. Lorie, Gianfranco R. Putzolu, Irving L. Traiger, IBM, September, 1975.

  2. On Optimistic Methods for Concurrency Control.
    H. T. Kung, John T. Robinson, Proc. VLDB, 1979, 351.

  3. Concurrency Control Performance Modeling: Alternatives and Implications
    Michael J. Carey, Miron Livny, ACM Trans. Database Syst., 12(4), 1987, 609-654.

  4. Efficient Locking for Concurrent Operations on B-Trees.
    Philip L. Lehman, Bing Yao, ACM Trans. Database Syst., 6(4), 1981, 650-670.

  5. ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging
    C. Mohan, Donald J. Haderle, Bruce G. Lindsay, Hamid Pirahesh, Peter M. Schwarz, ACM Trans. Database Syst., 17(1), 1992, 94-162.

  6. Transaction Management in the R* Distributed Database Management System
    C. Mohan, Bruce G. Lindsay, Ron Obermarck, ACM Trans. Database Syst., 11(4), 1986, 378-396.

  7. The Dangers of Replication and a Solution
    Jim Gray, Pat Helland, Patrick E. O'Neil, Dennis Shasha, Proc. SIGMOD Conference, 1996, 173-182.

Extensible Systems

  1. Inclusion of New Types in Relational Data Base Systems
    Michael Stonebraker, Proc. ICDE, 1986, 262-269.

  2. Generalized Search Trees for Database Systems
    Joseph M. Hellerstein, Jeffrey F. Naughton, Avi Pfeffer, Proc. VLDB, 1995, 562-573.

  3. Grammar-like Functional Rules for Representing Query Optimization Alternatives
    Guy M. Lohman, Proc. SIGMOD Conference, 1988, 18-27.

Database Evolution

  1. AutoAdmin 'What-if' Index Analysis Utility
    Surajit Chaudhuri, Vivek R. Narasayya, Proc. SIGMOD Conference, 1998, 367-378.

  2. Applying Model Management to Classical Meta Data Problems
    Philip A. Bernstein, Proc. CIDR, 2003.

  3. Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates C. Mohan, Inderpal Narang, Proc. SIGMOD Conference, 1992, 361-370.

Data Warehousing

  1. An Overview of Data Warehousing and OLAP Technology
    Umeshwar Dayal, SIGMOD Record, 26(1), 1997, 65-74.

  2. Improved Query Performance with Variant Indexes Patrick E. O'Neil, Dallan Quass, Proc. SIGMOD Conference, 1997, 38-49.

  3. Data Cube: A Relational Aggregation Operator Generalizing Group-by, Cross-Tab, and Sub Totals.
    Jim Gray, Surajit Chaudhuri, Adam Bosworth, Andrew Layman, Don Reichart, Murali Venkatrao, Hamid Pirahesh, Data Min. Knowl. Discov., 1(1), 1997, 29-53.

  4. An Array-Based Algorithm for Simultaneous Multidimensional Aggregates
    Yihong Zhao, Prasad Deshpande, Jeffrey F. Naughton, Proc. SIGMOD Conference, 1997, 159-170.

  5. Deriving Production Rules for Constraint Maintainance
    Stefano Ceri, Jennifer Widom, Proc. VLDB, 1990, 566-577.

  6. Informix under CONTROL: Online Query Processing
    Joseph M. Hellerstein, Vijayshankar Raman, Data Min. Knowl. Discov., 4(4), 2000, 281-314.

  7. DynaMat: A Dynamic View Management System for Data Warehouses
    Yannis Kotidis, Nick Roussopoulos, Proc. SIGMOD Conference, 1999, 371-382.

Data Mining

  1. BIRCH: An Efficient Data Clustering Method for Very Large Databases
    Tian Zhang, Raghu Ramakrishnan, Miron Livny, Proc. SIGMOD Conference, 1996, 103-114.

  2. SPRINT: A Scalable Parallel Classifier for Data Mining
    John C. Shafer, Rakesh Agrawal, Manish Mehta, Proc. VLDB, 1996, 544-555.

  3. Fast Algorithms for Mining Association Rules in Large Databases.
    Rakesh Agrawal, Ramakrishnan Srikant, Proc. VLDB, 1994, 487-499.

  4. Efficient Evaluation of Queries with Mining Predicates
    Vivek R. Narasayya, Sunita Sarawagi, Surajit Chaudhuri, Proc. ICDE, 2002, 529-.

Web Services and Databases

  1. Combining Systems and Databases: A Search Engine Retrospective
    Eric A. Brewer.

  2. The Anatomy of a Large-Scale Hypertextual Web Search Engine
    Lawrence Page, Sergey Brin, Computer Networks, 30(1-7), 1998, 107-117.

  3. The BINGO! System for Information Portal Generation and Expert Web Search
    Sergej Sizov, Martin Theobald, Stefan Siersdorfer, Gerhard Weikum, Jens Graupmann, Michael Biwer, Patrick Zimmer, Proc. CIDR, 2003.

  4. Data Management in Application Servers
    Dean Jacobs.

  5. Querying Semi-Structured Data
    Serge Abiteboul, Proc. ICDT, 1997, 1-18.

  6. DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
    Roy Goldman, Jennifer Widom, Proc. VLDB, 1997, 436-445.

  7. NiagaraCQ: A Scalable Continuous Query System for Internet Databases
    Jianjun Chen, David J. DeWitt, Feng Tian, Yuan Wang, Proc. SIGMOD Conference, 2000, 379-390.

Stream-Based Data Management

  1. Scalable Trigger Processing
    Eric N. Hanson, Chris Carnes, Lan Huang, Mohan Konyala, Lloyd Noronha, Sashi Parthasarathy, J. B. Park, Albert Vernon, Proc. ICDE, 1999, 266-275.

  2. The Design and Implementation of a Sequence Database System
    Praveen Seshadri, Miron Livny, Raghu Ramakrishnan, Proc. VLDB, 1996, 99-110.

  3. Eddies: Continuously Adaptive Query Processing
    Ron Avnur, Joseph M. Hellerstein, SIGMOD Conference, 2000, 261-272.

  4. Monitoring Streams - A New Class of Data Management Applications
    Donald Carney, Ugur Çetintemel, Mitch Cherniack, Christian Convey, Sangdon Lee, Greg Seidman, Michael Stonebraker, Nesime Tatbul, Stanley B. Zdonik, Proc. VLDB, 2002, 215-226.

Some source from © 2005, Joseph M. Hellerstein. http://redbook.cs.berkeley.edu/bib4.html