| Person in charge: | Antoni Urpi Tubella (urpi |
| Others: | Maria Carme Quer Bosor (cquer Maria Jose Casañ Guerrero (mjcasany |
| Credits | Dept. | Type | Requirements |
|---|---|---|---|
| 9.0 (7.2 ECTS) | LSI |
|
PRED
- Prerequisite for DIE , DCSYS PS - Prerequisite for DCSFW |
| Person in charge: | Antoni Urpi Tubella (urpi |
| Others: | Maria Carme Quer Bosor (cquer Maria Jose Casañ Guerrero (mjcasany |
This subject aims to teach students to structure and use the data saved in external memory devices by using databases, and to give them a grounding in the physical fundamentals to designing databases.
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 | ||
|---|---|---|---|---|---|---|---|---|---|---|
| 6,0 | 0 | 0 | 0 | 0 | 6,0 | 0 | 12,0 | |||
|
Three fields. The database concept. DBMS: Objectives and Architecture. Models, Users, Languages and ABD.
|
||||||||||
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
|---|---|---|---|---|---|---|---|---|---|---|
| 2,0 | 0 | 0 | 0 | 0 | 2,0 | 0 | 4,0 | |||
|
Objectives and Origin. Data Structure. Operations. Integrity rules.
|
||||||||||
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
|---|---|---|---|---|---|---|---|---|---|---|
| 10,0 | 4,0 | 4,0 | 0 | 4,0 | 14,0 | 0 | 36,0 | |||
|
Data: Tables. Constraints. Views.
Control: Procedures, triggers, privileges and roles. |
||||||||||
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
|---|---|---|---|---|---|---|---|---|---|---|
| 4,0 | 2,0 | 0 | 0 | 0 | 6,0 | 0 | 12,0 | |||
|
Point of departure: conceptual design (or specification) in UML.
Design logic: transformation in the relational model. |
||||||||||
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
|---|---|---|---|---|---|---|---|---|---|---|
| 4,0 | 1,0 | 2,0 | 0 | 2,0 | 5,0 | 0 | 14,0 | |||
|
Definition and properties of transactions. ACID.
Transaction interference. Serialisability. Recoverability. Concurrence control with S,X reserves. SQL isolation levels. Recovery. |
||||||||||
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
|---|---|---|---|---|---|---|---|---|---|---|
| 12,0 | 3,0 | 0 | 0 | 0 | 15,0 | 0 | 30,0 | |||
|
DB storage: Logical, virtual and physical levels.
Implementation of access by position, value, and various other values. B+, static dispersion, dynamic dispersion. |
||||||||||
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | 12,0 | 4,0 | 12,0 | 0 | 0 | 28,0 |
|
T | P | L | Alt | Ext. L | Stu | A. time | Total | ||
|---|---|---|---|---|---|---|---|---|---|---|
| 6,0 | 0 | 0 | 0 | 0 | 6,0 | 0 | 12,0 |
| Total per kind | T | P | L | Alt | Ext. L | Stu | A. time | Total |
| 45,0 | 13,0 | 22,0 | 8,0 | 26,0 | 58,0 | 0 | 172,0 | |
| Avaluation additional hours | 4,0 | |||||||
| Total work hours for student | 176,0 | |||||||
Theory Classes: 3 hours per week.
Classes of problems: 1 hour per week.
Students will work in pairs in the classes of problems. Solutions to the problems will be submitted at the end of the class. There will be 10 sessions of problems.
Split lab classes: block of two hours a week, with computers, in weeks 3,4,6,7,8,10,11,12,13.
There will be 4 sessions in which students will individually tackle an exercise, which will be submitted at the end of the class.
Group lab classes: block of two hours a week (computers not required) in weeks 1,2,5,8.
The course grade is calculated as follows:
- 70% Final exam
- 20% Lab classes (the average of all the grades awarded for lab sessions)
- 10% Problems (the average of all the grades awarded for lab sessions)
Without continuous assessment, the grade will be weighted thus: 75% exam+25% lab.
This formula will used if it yields a higher grade than that provided by the one based on continuous assessment.
Learn the data structure employed in internal memory.
Ability to assess these data structures.
Ability to produce Java programmes of medium complexity.
Course: PRED