Final Exam
May 4th, 8:00am-10am, Stuart Building room 104
The exam will be 120 minutes long. It is closed book and closed notes. Questions will be both multiple-choice and full text questions. These topics have already been covered in the homework assignments. Topics covered will be:
- Datalog
- Write datalog queries
- Translate from datalog to SQL or relational algebra
- Constraints
- Write constraints as first-order logical formulas.
- Translate constraints into first-order logical formulas. For example, given a functional dependency translate it into its first-order representation.
- Translate constraints into denial constraints
- Write denial constraints
- Query Equivalence and Containment
- Find containment mappings between queries to determine their containment relationships.
- Create Schema Matching
- Determine schema matches based on simple schema-based matches such as edit distance with threshold or Jacard with threshold.
- Create Schema Mappings
- Create schema mappings using the Clio algorithm based on a schema with constraints and a set of correspondences (schema matches).
- Be able to translate from st-tgds into GLAV mappings written as query containment constraints.
- Virtual data integration
- Find maximally contained rewritings to answer a query with a given set of views using the bucket algorithm.
- Be able to apply query answering with view to translate a query over a global schema into queries over local schema.
- Data Exchange
- Create transformations written in SQL based on a set of st-tgds.
The exam is available here. You can find the solutions here.