Basi di Dati e Sistemi Informativi I Prof. John Mylopoulos
Dr. Paolo Giorgini
CONTENUTI
L'obiettivo del corso e' quello di fornire agli studenti concetti, approcci e tecniche in data base management systems (DBMS). Il corso sara' diviso in due parti: lezioni teoriche in aula e sviluppo di un progetto in laboratorio. |
TESTI
DI RIFERIMENTO
Paolo Atzeni, Stefano Ceri, Stefano Paraboschi and Riccardo Torlone. Database Systems. McGraw-Hill, 1999. |
MATERIALE DEL
CORSO
Tutte le slides del corso, (slides a.a. 2000-2001), Esercizi e soluzioni, Esercizi Capitolo 3 - book (pdf,ps ), Slides esercitazioni pubblicazioni db su web (1) (2) |
PRENOTAZIONE ESAME - click here |
PROVE E PROGETTI Progetto e Sviluppo di un DB accessibile online per la vendita di parti per computer (pdf,ps) |
SEMINARI
Tue, the 13th of Nov at 14:00 Faculty of Science, "AULA SEMINARI DI MATEMATICA" Gabriel Kuper - Bell Laboratories TITLE: "Subsumption and XML Type Systems" ABSTRACT: XML is becoming a standard format for data exchange on the Web. As opposed to traditional database systems, XML documents do not have to conform to a predefined schema. There has been much discussion recently on the design of a type system that supports the portability and flexibility of XML. Such type systems depart from traditional typing frameworks in several ways, among them the use of regular expressions to describe the structure of a document, and the fact that documents can be typed in multiple ways according to the demands of the application. Since XML data is used (validated, stored, queried, etc) with respect to different types, understanding the relationship between these types provides important information for manipulating the data. In this talk, we describe a notion of "subsumption" for XML types that is designed to capture such relationships. Subsumption relies on a syntactic mapping between types: while stronger than type inclusion, it captures the most important applications of type inclusion. I will present various results about subsumption. The main result is that type schemas form a lattice with respect to subsumption: the greatest lower bound in this lattice is useful for designing storage structures for XML databases. I also present a proposal for integrating integrity constraints (keys, foreign keys) with XML: our proposal makes use of our results on type systems, and is much simpler than the current proposed standard. |
INFORMAZIONI
Per informazioni rivolgersi a:Paolo Giorgini |