UNIVERSITY of CALIFORNIA, RIVERSIDE
Department of Computer Science and Engineering

CS236: Database Management Systems
Winter 2015

Instructor: Vassilis J. Tsotras

office: WCH 335

tel: 951-827-2888

e-mail: tsotras@cs.ucr.edu

Lecture: Tuesday/Thursday 12:40 pm - 2:00 pm, WCH 143

Office Hours: Tuesday/Thursday 2:15 – 3:15 pm or by appointment.

TA: Steven Jacobs

e-mail: sjaco002@ucr.edu

TA Office Hours: Wednesday 1:00 – 3:00pm, WCH363

The first part of the course will use the following textbook:

Database Management Systems, by Raghu Ramakrishnan and Johannes Gehrke, McGraw-Hill, 3rd edition, ISBN 0-07-246563-8.

The slides for the various chapters can be found here.

We will first cover Chapters 3, 4 and 5 (quickly) as well as sorting and joins as an introduction (basic undergraduate material).

Here are the slides ch3.pdf,ch4.pdf,ch5.pdf,ch10.pdf,ch13.pdf,ch14a.pdf

Then we will concentrate on:

Indexing (chapters 10 and 28; see also papers on R-trees)

Spatial Queries (see below and section 14.4)

Interesting Book Exercises: 10.1, 10.4, 10.5, 10.9, 14.4, 14.5

Data Intensive Applications (Aggregation)

Top-k Queries

Temporal Databases and Temporal Indexing

Transaction Management (Chapters 16, 17 and 18)

Interesting Book Exercises: 16.3, 17.2, 17.4, 17.6, 17.10, 18.3 - 18.8

Normalization (Chapter 19)

Interesting Book Exercises: 19.2, 19.3, 19.5, 19.7, 19.8, 19.10

XML Query Processing (Chapter 27)

We will cover the following papers:

INDEXING

R-tree indices:
Antonin Guttman: R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference 1984: 47-57, R-tree.pdf

N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An Efficient and Robust Access Method For Points and Rectangles. SIGMOD Conference 1990, rstar.pdf

The Grid File:

J. Nievergelt, H. Hinterberger, K.C. Sevcik. The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. Database Syst. 9(1): 38-71 (1984), grid-file.pdf; see also this summary.

Space Filling Curves:

H.V. Jagadish. Linear clustering of objects with multiple attributes. SIGMOD Conference 1990, hilbert-curve.pdf

Atinder's slides on R-Trees: rtree-slides

Here are slides on R-Trees, grid-file and space filling curves from G. Kollios: Kollios-NTUA-structures-slides.

You can find a framework (implemented by Marios Hadjieleftheriou) to create spatial indices here.

SPATIAL QUERIES

Join Processing:
Leonard D. Shapiro: Join Processing in Database Systems with Large Main Memories. TODS 11(3): 239-264, join.pdf

Donghui's slides on join processing: join-slides

Spatial Joins:

T. Brinkhoff, H-P Kriegel, B. Seeger: Efficient Processing of Spatial Joins using R-trees. Proc. SIGMOD, 1993, r-tree-join.pdf

Ming-Ling Lo, Chinya V. Ravishankar: Spatial Joins using Seeded Trees. SIGMOD Conference 1994: 209-220, seeded.trees.pdf

Ming-Ling Lo, Chinya V. Ravishankar: Spatial Hash-Joins. SIGMOD Conference 1996: 247-258, shj.pdf

Nick Koudas, Kenneth C. Sevcik: Size Separation Spatial Join. SIGMOD Conference 1997: 324-335, ssj.pdf

Donghui's slides on spatial joins: spatial-join-slides

Ravi's slides on seeded-tree joins: seeded-trees-join slides

Nearest Neighbors:

N. Roussopoulos, S. Kelley, F. Vincent: Nearest Neighbor Queries. SIGMOD Conference 1995: 71-79, roussopoulosNN95.pdf

G.R. Hjaltason, H. Samet: Ranking in Spatial Databases. SSD 1995: 83-95, hjaltason95ranking.pdf

NN slides from G. Kollios: slides1 and from Y. Tao: slides2

Skyline Queries:

Stephan Börzsönyi, Donald Kossmann, Konrad Stocker: The Skyline Operator. ICDE 2001: 421-430, skyline-operator.pdf

Jan Chomicki, Parke Godfrey, Jarek Gryz, Dongming Liang: Skyline with Presorting. ICDE 2003:717-719, skyline-presorting.pdf

Dimitris Papadias, Yufei Tao, Greg Fu, Bernhard Seeger: An Optimal and Progressive Algorithm for Skyline Queries. SIGMOD Conference 2003: 467-478, skyline-bbs.pdf

Skyline slides from Y. Tao: skyline slides

DATA INTENSIVE APPLICATIONS

Intro to MapReduce:

Dean, J. and Ghemawat, S. 2008. MapReduce: simplified data processing on large clusters. Commun. ACM 51, 1 (Jan. 2008), 107-113, MapReduce.pdf

The map-reduce slides from Cloudera.

Aggregation for Data Intensive Applications:

Jian Wen, Vinayak R. Borkar, Michael J. Carey, Vassilis J. Tsotras: Revisiting Aggregation for Data Intensive Applications: A Performance Study. CoRR abs/1311.0059 (2013), aggregation.pdf

Here are the slides on aggregation, aggregation-slides

TOP-K QUERIES
R. Fagin. "Combining fuzzy information: an overview." SIGMOD Record, Vol 31,No 2, June 2002, pp. 109-118, fagin-sigrec02.pdf

Here are the Top-k slides

TEMPORAL DATABASES AND INDEXING

Slides on Temporal DBs and Indexing: temporal databases, snapshot index, MVB-Tree.

B. Salzberg and V.J. Tsotras: Comparison of Access Methods for Time-Evolving Data. ACM Comput. Surv. 31(2): 158-221 (1999), tempDB-survey.

V.J. Tsotras, N. Kangerlaris: The Snapshot Index: An I/O-optimal access method for timeslice queries. Inf. Syst. 20(3): 237-260 (1995), SI-index.

B. Becker, S. Gschwind, T. Ohler, B. Seeger, P. Widmayer: An Asymptotically Optimal Multiversion B-Tree. VLDB J. 5(4): 264-275 (1996), MVB-Tree

XML QUERY PROCESSING
S. Al-Khalifa, H.V. Jagadish, N. Koudas, J.M. Patel, D. Srivastava, Y.Wu: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. Proc. ICDE Conf. 2002, structural-joins.pdf

Nicolas Bruno, Nick Koudas, Divesh Srivastava, "Holistic Twig Joins: Optimal XML Pattern Matching", Proc. of ACM SIGMOD Conf. 2002, twig.pdf

Here are the structural join slides and the Holistic Join slides

TRANSACTION MANAGEMENT

Here are most of the transaction-slides

Here are the recovery notes

Class Grading:

The class grade will be: 35% midterm, 35% final, 30% project.