CODE 65920 ACADEMIC YEAR 2024/2025 CREDITS 9 cfu anno 2 INGEGNERIA INFORMATICA 8719 (L-8) - GENOVA SCIENTIFIC DISCIPLINARY SECTOR ING-INF/05 LANGUAGE Italian TEACHING LOCATION GENOVA SEMESTER 1° Semester TEACHING MATERIALS AULAWEB OVERVIEW The course provides basic skills on the design of information systems and on the conceptual, logical and physical structure of relational databases AIMS AND CONTENT LEARNING OUTCOMES Introduction to Relational Databases and their life cycle, design tools, languages for the creation-querying, manipulation of centralized databases. AIMS AND LEARNING OUTCOMES Entity/Relationship Model - the expected results are the ability to generate an Entity/relationship model starting from a verbal description of a management information system Classic DB models in particular the relational model the expected results are the ability to translate an E/R diagram into a relational schema Algebraic foundations of the relational model - the expected results are the ability to manipulate relational algebraic expressions and the knowledge of the characteristic algebraic operators the SQL language the expected results are the ability to learn the language instructions to write queries in SQL and to translate algebraic expressions into SQL queries Normalization theory up to 4NF. - the expected results are the ability to learn the theoretical foundations of the relational model, the concepts of functional dependence and the theory of normalization up to 4NF The OODB and ORDB object models. the expected results are the ability to understand the differences between classic and object oriented models and the ability to convert a relational schema into an object-oriented one linear index structures the expected results are the ability to understand the concept of index and taxonomies, insert, delete and search operations in linear indexes Tree indexes B+ the expected results are the ability to understand the concept of searching through tree structures the properties of tree indexes, particularly B+ and the operations of inserting, deleting and searching tree indexes B+ Hash Indexes The expected results are the ability to understand the concept of Hash function and its application to information search the properties of static and dynamic Hash indexes and operations of insert, delete and search in Hash indexes PREREQUISITES Knowledge of the fundamentals of programming and notions of mathematical analysis TEACHING METHODS Frontal lessons in the classroom with aids SYLLABUS/CONTENT The course will focus on fundamental aspects of transactional systems, on specific programming languages, on information integrity theories. In the first part, database design issues will be addressed both from a conceptual and logical point of view, the Entity/Relationship models will be presented, as well as the classic DB models, in particular the relational model. In the second part, the algebraic foundations of the relational model, the SQL language and the theory of normalization up to 4NF will be presented. In the third part we will analyze the embedded languages for DB access, ODBC, JDBC, the object models OODB and ORDB. In the last part, the issues relating to physical data storage, linear index structures, B+ tree and Hash will be explored RECOMMENDED READING/BIBLIOGRAPHY Lecture notes on Aulaweb, A. Sielberschatz et al. “Database System Concepts” ed. McGraw Hill Please note that the provided learning materials meet more common accessibility criteria, however they can be arranged in different formats, if needed, to improve their ease-of-use, according to each students' specific needs. TEACHERS AND EXAM BOARD MAURO COCCOLI Ricevimento: On lectures' days, at the Savona Universtity Campus. On appointment, at the Department DIBRIS in Genoa. On appointment, via Teams. ANTONIO BOCCALATTE Exam Board ANTONIO BOCCALATTE (President) MASSIMO PAOLUCCI MAURO COCCOLI (President Substitute) LESSONS LESSONS START https://corsi.unige.it/8719/p/studenti-orario Class schedule The timetable for this course is available here: Portale EasyAcademy EXAMS EXAM DESCRIPTION Written test consisting of a conceptual design of a database using an entity relationship diagram and the writing of some queries in relational algebra and sql language and oral test in which the theoretical and practical aspects of the program will be analyzed in detail through questions. The written tests are scheduled, the oral tests are agreed with the teacher and can only be carried out after the written test has been completed. ASSESSMENT METHODS Acquire familiarity with the basic issues related to transactional systems with particular reference to conceptual modeling, E/R diagrams; to traditional logical models particularly relational; to the SQL language also embedded in procedural languages; to the normalization process up to 4NF; to index structures. FURTHER INFORMATION Students with disabilities or learning disorders are allowed to use specific modalities and supports that will be determined on a case-by-case basis in agreement with the Delegate of the Engineering courses in the Committee for the Inclusion of Students with Disabilities. Students are invited to contact the teacher of this course and copy the Delegate. [https://unige.it/en/commissioni/comitatoperlinclusionedeglistudenticondisabilita.html] Agenda 2030 - Sustainable Development Goals Gender equality Decent work and economic growth Industry, innovation and infrastructure Reduce inequality Responbile consumption and production