Wright State University CORE Scholar
Computer Science & Engineering Syllabi College of Engineering & Computer Science
Fall 2012
CS 4700/6700: Introduction to Database Management Systems
Soon M. Chung Wright State University - Main Campus, [email protected]
Follow this and additional works at: https://corescholar.libraries.wright.edu/cecs_syllabi
Part of the Computer Engineering Commons, and the Computer Sciences Commons
Repository Citation Chung, S. M. (2012). CS 4700/6700: Introduction to Database Management Systems. . https://corescholar.libraries.wright.edu/cecs_syllabi/343
This Syllabus is brought to you for free and open access by the College of Engineering & Computer Science at CORE Scholar. It has been accepted for inclusion in Computer Science & Engineering Syllabi by an authorized administrator of CORE Scholar. For more information, please contact library[email protected]. Topics:
Text Grading: design Office are
Description: Prerequisite: Entity Instructor
Class:
-
- - -
Final
There
Project The
1st
dis
(937)775-5
CS
Book:
Midterm
cussed.
Query Relational Transaction Processing, Entity-Relationship Inde Relational 6th SQL ER Relational
File
hour:
M. Relationship final
methods,
40%
DBMS
-
(2) (1)
(3)
470
is
submi
i
edition, W.
to
s
A:[85,100],
x
orga
no
:
paper-review sma programming rep011
R.
a -
Extendible
0 paper-review,
Dr.
{ {
Relational
(12/12,
Processing programming
/67
*use
{
F.
M.
SQL
Survey
CS
homework,
design description
written
Elmasri
119,
relational
papers
15 ni
ll t
3:35-4:30
So
00
formal
the
W.
zations and data
DB
3100
%
database
e-ma
(around Addison
o
queries
soo
Introduction
n Mn
and
(10/5,
4:45-5:45
W.
topic
Design
5%,
model
presentation
reviewed
of
B:[75,85),
n
a for
Data
hashing
il
mapping
2:45-4:45
nd
. C . .c DB
and
and
relational
database
(Chap
project
for logical
but hun
documentation
of
programming, and
pm
files
model
F),
25
design
and
hun S.
Wesley, language
Strnctures
design
problem
Optimization
(Chap
Theory short
archltecture
hashing
solutions
g@wrigh
pages
B
at
2nd
a
Concurrency
g,
p.m.
results
(Chap
.
(Ref.
6%,
6)
list
154
Navathe,
(Sec.
403 (Chap
and
C:[65,75),
To
and
language
pm)
questions. Midterm
7%,
models
3)
2010.
concepts at of
in
technical
Russ
and
(C,
Database
Sec.
(Chap
4%,
Russ
18)
SQL
physical
8%, 403
at
double 9.1)
t.
and
of
discussion
7)
ed
C++,
or
Normalization
least
5%, (Chap
some
Fundamenta
ER
Center
17.8.3)
Russ,
(Ch. u,
discussion
Center
Algorithms,
for
programming
DB
(Chap
15
Control
17)
D:[55,65),
,
http://www.cs.
quality
design
correctness
space) and
5
Java,
%
Management
exerc
design.
aspects 19)
selected
1,
or
(11/2,
simu
9%
4,
2)
operat
by
etc.),
and
5)
i
i 6%,
8%,
s
7%
se
appointment.
} l
lation
s due
F:
Select F),
or
(Ch.
of
questions
Recovery
papers
ing
of
[0,55
Relati
using
are
}
15%,
equivalent.
datab
on Database
Project
wright.edwschung
principles
using
15
presented.
Systems,
one
the
)
discussion
,
o
MS-Access by
ase
16)
nal
l
by wi
(Ch.
ast
a
10/17.
30%,
Schema
high-level
ll
management
Systems,
J0/17.
class,
be
of
21, 22, 21,
Fall
Physical
provided.
database
5%
or
12/12.
20
5%,
some
},
1
23)
2
database
syste
systems
other
m
s.
DBMS •
•
• •
6. 4.
• 7.
3.
5. The 8.
2.
1.
Write Print
create Insert
Add discussion. Convert Entity-Relationship
pickup
DB
dents
tion,
A http://www.cs. The
query ER
Try
queries Your including
Your
out
design
sample some
the
most
design,
discussion
an
DBMS
final
the
in
ER
outputs,
the
guideline
relations
application
can
our
ER
meaningful
of
more
results.
design
and
report
the
relation
functionality
involve
class,
design
wright.edurschung/cs6700.htm
implementation and
than
section
typical
using
model
should
into
should
discussion.
such
problem.
to
4
schemas
more
SQL
for
the
relations
CS
MS
an
SQL
can
design.
as
include
equivalent
and
relations.
include
4700/6700
queries
Access,
than
your
include
commands
petformance,
and
using
project
is
one
comments
the
okay.
some
and
Oracle, instances,
anything
Relational
description
relations.
DB
can
run
to
relationships,
Design
MS
see
be
against
or
future
on
performed
that
some
query
how
DB
the
In
of
Project
you
the
work,
Access
they
general,
logical
schema.
other
the
desc1iptions
sample
want
so
problem,
work.
by
etc.
DBMS.
that
DB
the
to
a
relations.
relational
share
following
design,
IS
some
data
and
with
of
SQL
requirements,
given
implementa
DB
steps:
your
other
queries,
design
SQL
stu
at
2. 2.
Reference: Reference:
Note: Note:
1. 1.
utilization utilization
utilization utilization
3. 3.
Simulation Simulation
2. 2.
1. 1.
315-344. 315-344.
R. R.
access access
Section Section
hash hash
erated erated
The The
Generate Generate
directory directory
Each Each
Fagin, Fagin,
want. want.
You You
hash hash
values, values,
of of
of of
data data
of of
method method
integer integer
17.8.3 17.8.3
can can
the the
the the
Extendible Extendible
J. J.
entry entry
up up
value value
bucket bucket
Nievergelt, Nievergelt,
data data
directory directory
display display
use use
to to
value. value.
of of
for for
stores stores
of of
10
buckets= buckets=
any any
the the
(block) (block)
dynamic dynamic
4 4
the the
hash hash
followings: followings:
Hashing. Hashing.
CS CS
text text
programming programming
= =
a a
hash-key hash-key
pointer pointer
N. N.
------
number number
4700/6700 4700/6700
book. book.
values values
can can
Pippenger, Pippenger,
------
number number
files, files,
number number
store store
to to
attribute attribute
of of
(to (to
ACM ACM
a a
entries entries
data data
Programming Programming
of of
language, language,
40 40
simulate simulate
of of
and and
records records
Trans. Trans.
records records
bucket. bucket.
data data
of of
H. H.
in in
each each
the the
buckets buckets
R. R. number number
up up
on on
and and
that that
and and
Strong, Strong,
directory directory
record record
to to
Database Database
can can
Project Project
you you
10
is is
of of
4 4
dynamically dynamically
be be
can can
is is
Extendible Extendible
records), records),
total total
stored stored
given given
Systems, Systems,
plot plot
records records
as as
in in
the the
and and
all all
a a
Hashing: Hashing:
allocated. allocated.
4(3), 4(3),
outputs outputs
randomly randomly
for for
the the
every every
1979, 1979,
data data
A A
if if
Each Each
buckets buckets
gen
fast fast
you you
pp. pp.
10 2 2 CS 4700/6700 Paper Review Project
1. Choose a topic and select at least 5 relevant technical papers. High-quality journal papers are pre ferred. 2. Summarize and compare the papers, and then add your o\vn discussion. 3. Submit the working title and the list of candidate papers. (due 10/17) 4. Submit the report and the papers you studied. (due 12/12) 5. Size of the report is around 30 pages in double-space.
Possible Topics
• Database models •Database access mechanism (such as indexing, hashing, etc) • Query optiinization • Concurrency control and recovery • Parallel algorithn1s for query processing • Performance evaluation of DBMS • Parallel database systems • Distributed database • Multidatabases (federated databases) • Expert database • Logic and database • Multimedia database •Object-Oriented database • Image database • Engineering database • CAD/CAM database • Text retrieval system • Data mining • Data \Varehousing • Other relevant topics
Reference Sources - IEEE Trans. on Software Engineering - IEEE Trans. on Knowledge and Data Engineering - Computer (IEEE Computer Magazine) - Communications of ACM - ACM Trans. on Database Systems - ACM Trans. on Knowledge Discovery from Data - ACM Trans. on Information Systems - Information Systems - Multimedia Systems (Journal by ACM and Springer International) - IEEE Multimedia (Magazine by IEEE) - Data and Knowledge Engineering (Journal) - Data Mining and Knowledge Discovery (Journal) - Knowledge and Information Systems (Journal) - Proc. of IEEE Int'! Conf. on Data Engineering - Proc. of ACM Con[ on Management of Data (SIGMOD Conference) refer to the volumes of SIGMOD RECORD - Proc. of ACM Symp. on Principles of Database Systems (PODS) - Proc. of Very Large Data Bases (VLDB) Conference - IEEE Trans. on Parallel and Distributed Systems - ACM Computing Surveys - Proc. of Int'! Conf. on Knowledge Discovery and Data Mining - Proc. of IEEE Int'! Conf. on Data Mining and Others