Carnegie Mellon University
15-826 Multimedia Databases and Data Mining
Spring 2010 - C. Faloutsos
Midterm Study Guide
Preliminaries
- All aids allowed, EXCEPT wireless devices (laptops, PDAs etc).
- Pocket calculators: strongly recommended
- Duration: 1h 20 minutes
- Place: in class, during class time, 3:00-4:20pm, on Tu
2/23 (as announced).
- Extra office hour: Mo 2/22, 3-4pm, by instructor
Notice:
Several of the links are internal to CMU.Required text
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
All the material covered, up to and including
the lecture of Thu 2/18. Specifically:
1. Foils:
- From the course schedule, all the
foils, up to and including '170_fractals2.pdf'. Notice that
the file names for the foils are numbered in increasing order.
2. Multimedia Indexing
- Primary key access methods
- 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.
- 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.
(
gzipped postscript)
- 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.
- Textbook, chapters 4 and 5.
- Fractals
Last modified: 02/15/2010, by Christos Faloutsos