Beruflich Dokumente
Kultur Dokumente
SYSTEMS
E0 261
Jayant Haritsa
Computer Science and Automation
Indian Institute of Science
JAN 2010 INTRODUCTION Slide 1
db@iisc
E0 261 (AUG)
Database Management Systems
Jayant Haritsa
E0 361 (JAN)
Topics in Databases
Jayant Haritsa
• R. C. Hansdah (CSA)
– Object Databases, Distributed Databases
• M. Narasimha Murthy (CSA)
– Data
D t Mining,
Mi i Document
D t Databases
D t b
• Willingness
Willi tto work
khhard
d
• Exams: Mid-term
Mid term and Final (OB
(OB-OT)
OT)
• Projects:
– Range from implementation-intensive
• e.g. implement a mini-RDBMS [approx 5K code]
to topic-intensive
• e.g.
e g understand and implement Apriori data mining algorithm
to research-intensive
• e.g. design an efficient suffix-tree
suffix tree disk layout technique
– Demo / Reports / PPT presentations
– Will be done in p
pairs
JAN 2010 INTRODUCTION Slide 9
GRADING SCHEME
Mid-term: 30
Final: 40
Project: 30
• Set of research p
papers
p ((available online))
– some are papers arising out of your seniors course projects!
• Web-site:
dsl serc iisc ernet in/~course/DBMS/DBMS html
dsl.serc.iisc.ernet.in/~course/DBMS/DBMS.html
• All lectures in PPT – their PDF versions will
be on the Web-site after each class
• Course
C N
Newsgroup
news.csa.iisc.ernet.in/csa.courses.e0.261
• Timings:
MW 11.00 – 12.30
R 11
11.30
30 – 12.30
12 30
• Please don’t
don t get up when I come into class
– right way to show respect is by working hard
• NO CELLPHONES IN CLASS
2001: 13 [ S – 2, A – 3, B – 4, C – 2, D – 2 ]
2002: 18 [ S – 4, A – 6, B – 4, C – 3, D – 1 ]
2003: 16 [ S – 1,
1 A – 6,
6 B – 3,
3 C – 2,
2 D –33, F – 1 ]
2004: 10 [ S – 2, A – 6, B – 2 ]
2005: 21 [ S – 2, A – 7, B – 4, C – 6, D – 2 ]
2006: 24 [ S – 4,
4 A – 7,
7 B – 4,
4 C – 7,
7 D–2]
2007: 16 [ S –1, A – 4, B – 5, C – 5, D – 1 ]
2008: 18 [ S –2, A – 5, B – 5, C – 4, D – 2 ]
• D
Design
i off database
d b engines
i h llots off really,
has ll
really interesting intellectual problems with
practical
ti l applications
li ti
– theory, algorithms, data structures, experiments,
protot pes
prototypes
• Turing
T i awards:
d
– 1981: Edgar Codd (relational data model)
– 1999: Jim Gray (transaction model)
• Ullman,
Ull Silb
Silberschatz,
h t P Papadimitrou,
di it …
• Declarative Access
– state what you want, not how to get it
• On-the-Fly Questions
– askk new questions
ti without
ith t writing
iti new programs
• Multiple
p Views
– see only appropriate subset of the database
• PEACE OF MIND
– changes to the database are immune to failures
• Sri Sri Ravishankar of the information world!
• XML Databases
• Bio Databases
Bio-Databases
• High-dimensional
High dimensional Databases
• Small-device Databases
• Multilingual Databases