252-0834-00L Information Systems for Engineers
| Semester | Autumn Semester 2018 |
| Lecturers | G. Fourny |
| Periodicity | yearly recurring course |
| Language of instruction | English |
Courses
| Number | Title | Hours | Lecturers | |||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 252-0834-00 V | Information Systems for Engineers | 2 hrs |
| G. Fourny | ||||||||||||||||||
| 252-0834-00 U | Information Systems for Engineers | 1 hrs |
| G. Fourny |
Catalogue data
| Abstract | This course provides the basics of relational databases from the perspective of the user. We will discover why tables are so incredibly powerful to express relations, learn the SQL query language, and how to make the most of it. The course also covers support for data cubes (analytics). After this course, you will be ready for Big Data for Engineers. |
| Learning objective | After visiting this course, you will be capable to: 1. Explain, in the big picture, how a relational database works and what it can do in your own words. 2. Explain the relational data model (tables, rows, attributes, primary keys, foreign keys), formally and informally, including the relational algebra operators (select, project, rename, all kinds of joins, division, cartesian product, union, intersection, etc). 3. Perform non-trivial reading SQL queries on existing relational databases, as well as insert new data, update and delete existing data. 4. Design new schemas to store data in accordance to the real world's constraints, such as relationship cardinality 5. Explain what bad design is and why it matters. 6. Adapt and improve an existing schema to make it more robust against anomalies, thanks to a very good theoretical knowledge of what is called "normal forms". 7. Understand how indices work (hash indices, B-trees), how they are implemented, and how to use them to make queries faster. 8. Access an existing relational database from a host language such as Java, using bridges such as JDBC. 9. Explain what data independence is all about and didn't age a bit since the 1970s. 10. Explain, in the big picture, how a relational database is physically implemented. 11. Know and deal with the natural syntax for relational data, CSV. 12. Explain the data cube model including slicing and dicing. 13. Store data cubes in a relational database. 14. Map cube queries to SQL. 15. Slice and dice cubes in a UI. And of course, you will think that tables are the most wonderful object in the world. |
| Content | Using a relational database ================= 1. Introduction 2. The relational model 3. Data definition with SQL 4. The relational algebra 5. Queries with SQL Taking a relational database to the next level ================= 6. Database design theory 7. Databases and host languages 8. Databases and host languages 9. Indices and optimization 10. Database architecture and storage Analytics on top of a relational database ================= 12. Data cubes Outlook ================= 13. Outlook |
| Literature | - Lecture material (slides). - Book: "Database Systems: The Complete Book", H. Garcia-Molina, J.D. Ullman, J. Widom (It is not required to buy the book, as the library has it) |
| Prerequisites / Notice | For non-CS/DS students only, BSc and MSc Elementary knowledge of set theory and logics Knowledge as well as basic experience with a programming language such as Pascal, C, C++, Java, Haskell, Python |
Performance assessment
| Performance assessment information (valid until the course unit is held again) | |
Performance assessment as a semester course | |
| In examination block for | Bachelor's Degree Programme in Computational Science and Engineering 2016; Version 27.03.2018 (Examination Block G2) Bachelor's Programme in Computational Science and Engineering 2012; Version 13.12.2016 (Examination Block G2) |
| ECTS credits | 4 credits |
| Examiners | G. Fourny |
| Type | session examination |
| Language of examination | English |
| Repetition | The performance assessment is offered every session. Repetition possible without re-enrolling for the course unit. |
| Mode of examination | written 120 minutes |
| Additional information on mode of examination | Working on the exercises is rewarded in the sense of ETH's continuous performance assessment with up to 0.25 bonus points. In principle, it is expected that students solve all exercises. In order to control this, the assignments will be collected in 3 weeks of the semester, announced in advance. Those who successfully solve ast least 2 of these 3 weeks of assignments get 0.25 extra points at the exam. |
| Written aids | none. |
| If the course unit is part of an examination block, the credits are allocated for the successful completion of the whole block. This information can be updated until the beginning of the semester; information on the examination timetable is binding. | |
Learning materials
| Main link | Course webpage |
| Recording | All lectures are recorded |
| Only public learning materials are listed. | |
Groups
| No information on groups available. |
Restrictions
| There are no additional restrictions for the registration. |
