• January 4, 2016 The exam of the March/April 2016 session will be held on April 5, 2016 at 4pm.
• May 26, 2015 The rules for the exam and the dates of the exams have been posted in this page (see below).

• Architectures for information integration
• Distributed data management
• Data federation
• Data exchange and data warehousing
• ETL (Extraction, Transformation and Loading), data cleaning and data reconciliation
• Data integration
• Ontology-based data integration

• Before the beginning of the lectures, students are invited to (re)study the basic notions of propositional and first-order logic. For this purpose, students may use the material they used in previous courses, or have a look at:
  • Introduction to propositional logic (paper)
  • Introduction to first-order logic (paper)
  • FOL and conjunctive queries (from the material of "Metodi Formali per il Software e i Servizi", by Giuseppe De Giacomo)

The lecture notes can be downloaded from the course page in Moodle

The following are the rules for the exam. There are three possibilities for the exam:

• Study a tool for data integration or data federation, or data exchange, and then make a presentation (in English), where the characteristics of the tool are described, the position of the tool in the spectrum of information integration principles illustrated in the course, is discussed, and a demo of the tool is presented. For a picture of the available tools for data integration, the student should search on the web. Here is an incomplete list of possible tools: Karma, IBM Infosphere, Oracle data integrator, CloverETL, Pentaho, TEIID, Talend, Jitterbit, Adeptia, Open Refine etc.
• Choose a set of data sources with data relevant for a certain phenomenon (for example, data taken from open data published on-line, or data taken from a database or from an xls file known by the student), and develop a data integration or data exchange application using such data sources (and using any tool selected by the student). This work can be carried out in a group of at most two students.
• Study a paper on information integration, and then discuss the paper in a 15 minutes presentation (in English), again, including a part for positioning the work in the context of the spectrum of the principles illustrated in the course. Here is a (non exhaustive) list of papers that can be considered (use Google to find the papers and download them):
  • 1. Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi. Rewriting of Regular Expressions and Regular Path Queries. In J. Comput. Syst. Sci. 64(3):443-465, 2002
  • 2. Alon Y. Levy, Alberto O. Mendelzon, Yehoshua Sagiv, Divesh Srivastava. Answering Queries Using Views. PODS 1995: 95-104
  • 3. Rachel Pottinger, Alon Halevy. MiniCon: A scalable algorithm for answering queries using views.The VLDB Journal” The International Journal on Very Large Data Bases, Volume 10, Issue 2-3 (September 2001)
  • 4. Oliver M. Duschka, Michael R. Genesereth, Alon Y. Levy. Recursive Query Plans for Data Integration. J. Log. Program. 43(1): 49-73 (2000)
  • 5. Philippe Adjiman, Philippe Chatalic, Francois Goasdou, Marie-Christine Rousset, Laurent Simon. Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web. Journal of Artificial Intelligence Research (JAIR) 25: 269-314 (2006)
  • 6. Xin Luna Dong, Alon Y. Halevy, Cong Yu. Data integration with uncertainty. VLDB J. 18(2): 469-500 (2009)
  • 7. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. Composing schema mappings: Second-order dependencies to the rescue. ACM Trans. Database Syst. 30(4): 994-1055 (2005)
  • 8. Andrea Calì, Domenico Lembo, Riccardo Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. PODS 2003: 260-271
  • 9. Jens Bleiholder, Felix Naumann. Data fusion. ACM Comput. Surv. 41(1): (2008)
  • 10. Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki. Consistent Query Answers in Inconsistent Databases. PODS 1999: 68-79
  • 11. George Konstantinidis, José Luis Ambite. Scalable query rewriting: a graph-based approach, SIGMOD '11 Proceedings of the 2011 international conference on Management of data.
  • 12. Hector Gonzalez, Alon Y. Halevy, Christian S. Jensen, Anno Langen, Jayant Madhavan, Rebecca Shapley, Warren Shen, Jonathan Goldberg-Kidon. Google fusion tables: web-centered data management and collaboration. SIGMOD Conference 2010: 1061-1066
  • 13. Mary Roth, Wang-Chiew Tan: Data Integration and Data Exchange: It's Really About Time. CIDR 2013
  • 14. Bogdan Alexe, Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan: Characterizing schema mappings via data examples. ACM Trans. Database Syst. 36(4): 23 (2011)
  • 15. Anastasios Kementsietsidis, Marcelo Arenas, Renée J. Miller: Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues. SIGMOD Conference 2003: 325-336

In all the above three cases, once the student has chosen the topic, (s)he should send an email message to prof. Lenzerini with the description of the topic, and wait for confirmation, or a request to change the topic, if the topic (tool, paper, or use case) is already taken. Also once the student has decided on the date for the exam, (s)he should send an email message to prof. Lenzerini with the indication of the date. Here are the dates for March/April 2016 (the exam will be held in the office of Prof. Lenzerini), which is only for "fuori corso" students:

• April 5, 2016 at 4pm

• First exam: June 2015
• Second exam: July 2015
• Third exam: September 2015
• First special session: October 2015
• Fourth exam: January 2016
• Fifth exam: February 2016
• Second special session: April 2016

• When: during the period (March - May, 2015),
• Where: via Ariosto 25, Roma
• Schedule (lecture will be on Thursday, with the addition of Wednesday only in some of the weeks):
  
  

  Week	Wednesday (8:30am - 10:00am) classroom B2	Thursday (8:30am -10:00am) classroom A2
  01 (Mar 2)	Lectures 1,2 - Introduction to information integration - Propositional logic: syntax and semantics	Lectures 3,4 - Propositional logics: algorithms for logical implication and satisfiability
  02 (Mar 9)	Lectures 5,6 - First-order logic: syntax and semantics	Lectures 7,8 - The relationship between First-order logic and databases
  03 (Mar 16)	--------	Lectures 9,10 - Logic for expressing integrity constraints
  04 (Mar 23)	--------	Lectures 11,12 - Types of information integration systems
  05 (Mar 30)	Lectures 13,14 - Logical formalization of information integration systems	--------
  06 (Apr 6)	--------	--------
  07 (Apr 13)	Lectures 15,16 - Types of mapping assertions: GAV	Lectures 17,18 - Types of mapping assertions: LAV
  08 (Apr 20)	Lectures 19,20 - Algorithms for query answering in GAV without axioms	--------
  09 (Apr 27)	Lectures 21,22 - Algorithms for data exchange in LAV without axioms	--------
  10 (May 4)	--------	Lectures 23,24 - Algorithms for query answering in LAV without axioms
  11 (May 11)	Lectures 25,26 (at 9am) - Algorithms for query answering with axioms	Lectures 27,28 (at 9am) - Ontology-based data integration
  12 (May 18)

• Academic year 2013/2014
• Academic year 2012/2013
• Academic year 2011/2012
• Academic year 2010/2011
• Academic year 2009/2010
• Academic year 2008/2009