Person in charge: | (-) |
Others: | (-) |
Credits | Dept. | Type | Requirements |
---|---|---|---|
7.5 (6.0 ECTS) | ESSI |
|
BD
- Prerequisite for DIE , DCSYS , DCSFW ES1 - Prerequisite for DIE , DCSYS , DCSFW |
Person in charge: | (-) |
Others: | (-) |
In the preceding course "Databases" some DB models have been studied, particularly the Relational Model, and some languages related to SQL and Relational Algebra. In this course it is intended to learn how to make the logical design of a RDB (Relational DB) for Information Systems, discussing the problems and the multiplicity that this implies. The resulting logical schema will be implemented using some relational system, analyzing its difficulties and limitations. Finally we will study the characteristics for a good physical design of the RDB, and particularly these optimization and tuning parameters that are the most common in the market's relational systems.
Estimated time (hours):
T | P | L | Alt | Ext. L | Stu | A. time |
Theory | Problems | Laboratory | Other activities | External Laboratory | Study | Additional time |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
3,0 | 0 | 1,0 | 0 | 0 | 1,0 | 0 | 5,0 | |||
1.1 DB design in a corporate IS.
1.2 Stages in the design of a database. 1.3 Design alternatives. |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
5,0 | 0 | 1,0 | 0 | 1,0 | 5,0 | 0 | 12,0 | |||
3.1 Data storage
3.2 Multidimensional databases (OLAP tools)
|
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
4,0 | 0 | 8,0 | 0 | 9,0 | 4,0 | 0 | 25,0 | |||
4.1 Script creation
4.2 Implementation of integrity restrictions 4.3 Surrogates 4.4 Definition and load deadlock 4.5 Horizontal and vertical partitioning 4.6 Aggregation 4.7 Views materialization
|
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
12,0 | 0 | 4,0 | 0 | 4,0 | 16,0 | 0 | 36,0 | |||
5.1 Semantic optimisation
5.2 Syntatic optimisation 5.3 Access paths 5.4 Sorting and projection algorithms 5.5 Join algorithms 5.6 Middle results estimation 5.7 Advanced indexing techniques
|
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
---|---|---|---|---|---|---|---|---|---|---|
9,0 | 0 | 6,0 | 0 | 8,0 | 9,0 | 0 | 32,0 | |||
6.1 Introduction
6.2 Monitors and query plan 6.3 Work load 6.4 Transactions 6.5 Security 6.6 Files and system parameters
|
Total per kind | T | P | L | Alt | Ext. L | Stu | A. time | Total |
44,0 | 0 | 26,0 | 0 | 27,0 | 50,0 | 0 | 147,0 | |
Avaluation additional hours | 3,0 | |||||||
Total work hours for student | 150,0 |
The course comprises theory and lab classes.
Theory: The theory classes comprise the teacher's explanations and constitute the main part of the course.
Laboratory: Mainly, the lab classes will be dedicated to the practice (with and without computer) of the concepts introduced in the theory classes, by means of markable exercices that will be done during the class time. Some tools will be used for the design and administration of RDB, and to practice on a specific DBMS (Oracle).
Final mark = 70% min(10,P) + 20% E + 10%C
E = final exam grade
P = weighted average grade of questionnaires and 11 lab sessions
C = peer evaluation
Calculation of P:
1) Multiply the grade from activity by a weight equal to 1, 2, 4 or 8 (depending on the content of the corresponding activity)
2) Divide the sum of these values by the sum of weights assigned minus 8
Calculation of C: students will have multiple partners during the semester and they will evaluate them at the end. Based on these evaluations, the teacher will assign a grade.
Exam: students may or may not choose some of the questions depending on their participation int the proposal of questions during the semester.
A prerequisite is that students must have taken the "Databases (BD)" and "Software Engineering 1 (ES1)" courses.