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/22.
• Material: everything covered, up to and including the lecture of Tue, 2/15.
  

Required text

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

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. (postscript here)
• 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, (postscript here)
• Text and LSI
• Textbook, chapter 6.1 and 6.2.