Carnegie Mellon University
15-826 Multimedia Databases and Data Mining
Fall 2019 - C. Faloutsos

 Midterm Study Guide

Preliminaries - IMPORTANT

• No aids allowed, except
  
• a standard, 8'' x 11.5'' page with your notes - use both sides, and
  
• Pocket calculators: strongly recommended (logarithms)
• Photo id: please bring one
• Material to be examined:  all lecture foils, and all required papers / book-chapters listed below.
  

Additional info:

• Drill questions: are at http://www.cs.cmu.edu/~christos/courses/826-resources/REVIEW-QUESTIONS/
  
• Duration: 1h 20 minutes
• Place: in class, during class time, 1:30-2:50, on We 10/16 (as announced).
• Office hours by instructor:
• 3-4pm on Mo 10/14(extra)
  
• 3-4pm  on Tue 10/15 (usual)
  

Notice:

Required text

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

Recommended text

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

MATERIAL TO BE EXAMINED

1. Foils:

• From the course schedule, all the foils, up to and including  the lecture of '220_text2.pdf' (inversion and signature files). Notice that the file names for the foils are numbered in increasing order.
  
• Attention: also included:  SQL,  B-trees,  hashing
  
• Excluded: the graph mining foils ('420-GraphMining_patterns.pdf', '425_GraphMining_anomalies_ph1.pdf')
  

2. Multimedia Indexing

• Primary key access methods
  • Litwin, W., (1980), Linear Hashing: A New Tool for File and Table Addressing, VLDB, Montreal, Canada, 1980.
  • MM Textbook, chapters 2-3
• Secondary key and spatial access methods
  • Jon Louis Bentley, Multidimensional binary search trees used for associative searching, Comm. of the ACM  (CACM), Volume 18 ,  Issue 9, pp. 509-517,  (September 1975)
  • 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.
  • Roberto F. Santos Filho, Agma Traina, Caetano Traina Jr., and Christos Faloutsos: Similarity search without tears: the OMNI family of all-purpose access methods ICDE, Heidelberg, Germany, April 2-6 2001. (New 10/13: will NOT be in the midterm exam)
    
  • MM-Textbook, chapters 4 and 5.
• Fractals
  
  • 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. (and gzipped postscript)
  • Alberto Belussi and Christos Faloutsos, Estimating the Selectivity of Spatial Queries Using the `Correlation' Fractal Dimension Proc. of VLDB, p. 299-310, 1995 (and gzipped postscript )
  • Bernd-Uwe Pagel, Flip Korn and Christos Faloutsos, Deflating the Dimensionality Curse using Multiple Fractal Dimensions, ICDE 2000, San Diego, CA, Feb. 2000. (NEW: 9/30 - replaces the one above it)
  • Power laws, lognormals etc: M. E. J. Newman, Power laws, Pareto distributions and Zipf's law Contemporary Physics 46, 323-351 (2005) (local pdf copy)
• Text and LSI
• MM-textbook, chapter 6.1-4
  

Last modified: Oct. 13, 2019, by Christos Faloutsos