
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Information about a university course, ecs 289f topics in scientific data management, focusing on assignments related to rock classification hierarchies and defining concepts using description logic and first-order logic. Students are required to explain the meaning of parent-child relations in hierarchies, provide examples of domains with multiple hierarchies, and discuss knowledge mining using a database instance.
Typology: Assignments
1 / 1
This page cannot be seen from the preview
Don't miss anything!

ECS 289F Topics in Scientific Data Management Spring 2006 Dr. Bertram LudĀØascher April 18
Due: Tuesday, April 25th (in class, after class)
Problem 1
Consider the rock classification hierarchies (Slide 30, Handout 1):^1 A set of rock-names is hierarchically classified according to different properties (fabric, chemical-composition, texture).
a) For each of the different hierarchies, explain what the parent-child relation between two nodes means. What does a node stand for?
b) Give another example of an (ideally scientific) application domain, in which a set of terms (or names) gives rise to two (or more) different hierarchies. Choose an example, such that a significant amount of terms occur in more than one hierarchy. c) Consider a set of terms T = {t 1 ,... , tn} and two hierarchies isaA/ 2 , isaB/2, i.e., terms T can be classified hierarchically w.r.t. two different organizational aspects A and B. Now consider a database instance I over the schema S = {isaA/ 2 , isaB/ 2 }, i.e., a finite set of facts of the form isaA(tchild, tparent) and isaB(tchild, tparent). Discuss how you might āmine new knowledgeā about T and/or A and B, using I. Use examples from (a) or (b) to illustrate.
Problem 2
Consider the following definitions of concepts:
a) Define HappyFather and HappyMother using description logic (DL) syntax. Use a binary relation hasChild/2 to model the parent-child relationship. b) Same as in (a) but use first-order (FO) logic syntax. Hint: Use the translation rules from DL to FO from class.
Now consider the database schema S = { Person(SSN, N ame, Gender), hasChild(SSN P arent, SSN Child), Rich(SSN ), Happy(SSN ) }
c) Define Man, Woman, HappyFather, and HappyMother as Datalog views over S. Hint: to express a universal statement (such as āparents having only girlsā) you might want to use double negation (e.g. ānot among the parents having no girlsā).
d) Same as in (c), but use SQL views. e) Give a database instance I of S having a happy father and mother, and an unhappy father and unhappy mother. Try to make I as small as possible.
(^1) The original article will also be available via the class page.