Database Systems


  • [GUW01] Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer D. Widom. Database Systems: The Complete Book. October, 2001.

Relational Model and Implementation Techniques

  • [ABC+76] M. M Astrahan, M. W. Blasgen, D. D. Chamber- lin, K. P. Eswaran, J. N. Gray, P. P. Griffiths, W. F. King, R. A. Lorie, P. R. McJones, J. W. Mehl, G. R. Putzolu, I. L. Traiger, B. W. Wade, and V. Watson. System R: Relational approach to database management. ACM Transactions on Database Systems, 1(2):97-137, June 1976.
  • [C+81] D.D. Chamberlin A History and Evaluation of System R. Communications of the ACM 24:10 (1981), 632-646.
  • [S81] M. Stonebraker. Operating System Support for Database Management. Communications of the ACM, 24(7):412-418, July 1981.
  • [SAC+79] P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. Access path selection in a relational database management system. In SIGMOD, 1979.

Transaction/Buffer Management

  • [GLP75] Jim Gray, Raymond A. Lorie, and Gianfranco R. Putzulo. Granularity of locks and degrees of consistency in a shared database. In 1st International Conference on VLDB, pages 428–431, September 1975. Reprinted in Readings in Database Systems, 3rd edition.
  • [LY81] Lehman, P., Yao, S.B. Efficient Locking for Concurrent Operations on B-trees. ACM Transactions on Database Systems/, Vol 6, No 4, December 1981.
  • [SS86] G. M. Sacco and M. Schkolnick. Buffer management in relational database systems. ACM TODS, 11(4), pages 473-498, Dec. 1986.
  • [A+85] Anon et Al. A Measure of Transaction Processing Power. Tech Report: TR-85.2. HP Labs Technical Reports February 1985.

Data Quality and Integration

  • [EPV07] A.K. Elmagarmid, G.I. Panagiotis, S.V. Verykios. Duplicate Record Detection: A survey. IEEE TKDE 19 (2007), no. 1
  • [KSS06] N. Koudas, S. Sarawagi and D. Srivastava. Record Linkage: Similarity measures and algorithms. SIGMOD 2006
  • [RB01] E. Rahm, P. A. Bernstein. A survey of approaches to automatic schema matching. The VLDB Journal, Volume 10 , Issue 4, 2001
  • [CFG+07] G. Cong, W. Fan, F. Geerts, X. Jia, and S. Ma. Improving data quality: consistency and accuracy. VLDB 2007

Data Mining

  • [AS94] R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In 20th VLDB Conference, 1994.
  • [B02] Pavel Berkhin. Survey Of Clustering Data Mining Techniques. Accrue Software Research Paper, (2002).
  • [G] Bart Goethals. Survey on Frequent Pattern Mining. HIIT Basic Research Unit, Department of Computer Science, University of Helsinki, Helsinki, Finland.

High Dimensional Indexing

  • [KAS98] K. V. R. Kanth, D. Agrawal, and A. Singh. Dimensionality reduction for similarity searching in dynamic databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 166–176, Seattle, Washington, June 1998.
  • [CPZ97] Paolo Ciaccia, Marco Patella, Pavel Zezula. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. VLDB 1997: 426-435.
  • [BKS+90] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. Proceedings of ACM SIGMOD Int'l. Conf. on Management of Data, pp. 322-331, 1990.
  • [HNP95] J. Hellerstein, J. Naughton, and A. Pfeifer. Generalized search trees for database systems. In Proceedings of the 21st International Conference on Very Large Databases, pages 562-573, 1995.
  • [AI01] Walid G. Aref, Ihab F. Ilyas. SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees. Journal of Intelligent Information Systems (JIIS), Volume 17, Number 1, November 2001.


  • [CDF+94] Michael J. Carey, David J. DeWitt, Michael J. Franklin, Nancy E. Hall, Mark L. McAuliffe, Jeffrey F. Naughton, Daniel T. Schuh, Marvin H. Solomon, C. K. Tan, Odysseas G. Tsatalos, Seth J. White, Michael J. Zwilling. Shoring Up Persistent Applications. SIGMOD Conference 1994: 383-394.

Nearest Neighbor Queries

  • [RKV95] Roussopoulos, N., Kelly, S., Vincent, F. Nearest Neighbor Queries. SIGMOD, 1995.

Additional Papers

  • [S86] Leonard Shapiro. Join Processing in Database Systems with Large Main Memories. ACM TODS Sept. 1986.
  • [V01] J. S. Vitter. External Memory Algorithms and Data Structures: dealing with massive data. ACM Computing Surveys 33(2), 2001.
  • [AW89] Nabil R. Adam and John C. Wortmann. Security-Control Methods for Statistical Databases: A Comparative Study. ACM Computing Surveys, Vol. 21, No. 4, pp. 515—556, Dec. 1989.
  • [THP04] Sandeep Tata, Richard Hankins, and Jignesh Patel. Practical Suffix Tree Construction. VLDB 2004.
  • [SAB+05] Mike Stonebraker, Daniel Abadi, Adam Batkin, Xuedong Chen, Mitch Cherniack, Miguel Ferreira, Edmond Lau, Amerson Lin, Sam Madden, Elizabeth O'Neil, Pat O'Neil, Alex Rasin, Nga Tran and Stan Zdonik. C-Store: A Column Oriented DBMS. VLDB 2005.
  • [BMW05] Shivnath Babu, Kamesh Munagala, Jennifer Widom, and Rajeev Motwani. Adaptive Caching for Continuous Queries. ICDE 2005.

Information Retrieval


  • [LZ01] John Lafferty and Chengxiang Zhai. Document language models, query models, and risk minimization for information retrieval. Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'01 )
  • [S02] Fabrizio Sebastiani. Machine learning in automated text categorization. ACM Computing Surveys (CSUR) 34 (1), 2002.
  • [BNJ03] Blei, D. M., Ng, A. Y. and Jordan, M. I. Latent dirichlet allocation. Journal of Machine Learning Research. 3, 2003.
  • [C00] Jamie Callan. Distributed information retrieval. In W. B. Croft, editor, Advances in Information Retrieval. Kluwer Academic Publishers, 2000.
  • [JSZ06] Rong Jin, Luo Si and Cheng Xiang Zhai. A study of mixture models for collaborative filtering. Information Retrieval 9 (3), 2006
Back to top
qual_2.txt · Last modified: 2011/06/21 20:32 by bala
CC Attribution-Share Alike 3.0 Unported = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0