Carnegie Mellon University
15-826 Multimedia Databases and Data Mining
Spring 2006 - C. Faloutsos

Midterm exam study guide

Preliminaries

• All aids allowed, EXCEPT laptop (due to its wireless connection)
• Duration: 1h 20 minutes
• Place: in class, during class time, 3:00-4:20pm, on Tu 2/28.
• Material: everything covered, up to and including the lecture of Thu, 2/23.

Required text

• [Textbook] C. Faloutsos Searching Multimedia Databases by Content, Kluwer Academic Press, 1996. Evaluation draft ( internal to CMU - gzipped postscript).

Recommended text

• [HK] Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2000.
• [PTVF] William H. Press Saul A. Teukolsky William T. Vetterling Brian P. Flannery Numerical Recipes in C Cambridge University Press, 1992, 2nd Edition. On-line evaluation copy
• Undergraduate DB textbook, for those who took a db class too long ago:
  • Raghu Ramakrishnan, Johannes Gehrke, "Database Management Systems," McGraw-Hill 2002 (3rd ed).

Foils:

A. Multimedia Indexing

• Primary key access methods
  • Litwin, W., (1980), Linear Hashing: A New Tool for File and Table Addressing, VLDB, Montreal, Canada, 1980.
  • Textbook, chapters 2-3
• Secondary key and spatial access methods
  • A. Guttman R-Trees: a Dynamic Index Structure for Spatial Searching, Proc. ACM SIGMOD, June 1984, pp. 47-57, Boston, Mass.
  • J. Orenstein, Spatial Query Processing in an Object-Oriented Database System, Proc. ACM SIGMOD, May, 1986, pp. 326-336, Washington D.C..
  • Textbook, chapters 4 and 5.
• Fractals
  • Ibrahim Kamel and Christos Faloutsos, Hilbert R-tree: An improved R-tree using fractals Proc. of VLDB Conference, Santiago, Chile, Sept. 12-15, 1994, pp. 500-509.
  • Christos Faloutsos and Ibrahim Kamel, Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension, Proc. ACM SIGACT-SIGMOD-SIGART PODS, May 1994, pp. 4-13, Minneapolis, MN.

Last modified 02/20/06 by Christos Faloutsos