A Logical Formulation of PRMs. Example Institute(InstId,Type) Researcher(RID,Area,Salary,InstID) Paper(PaperId,Topic) Author(RId,PaperID) Cites(PaperId1,PaperId2)

Slides:



Advertisements
Similar presentations
The transformation of an ER or EER model into a relational model
Advertisements

SQL: The Query Language Part 2
Convert ER to Relational Database Entity relation Entity relation Attributes attributes Attributes attributes Primary key primary key Primary key primary.
Transform an ER Model into a Relational Database Schema
Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
1 CMSC 471 Fall 2002 Class #6 – Wednesday, September 18.
Relational Database Design UNIT II 1. 2 Advantages of Using Database Systems Centralized control of a firm’s data Redundancy can be reduced (avoid keeping.
CPSC 121: Models of Computation Unit 6 Rewriting Predicate Logic Statements Based on slides by Patrice Belleville and Steve Wolfman.
1 Logic Programming School of Informatics, University of Edinburgh Transformations Specification-Program An introduction to moving between Prolog and First.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 SQL: Queries, Programming, Triggers Chapter 5 Modified by Donghui Zhang.
Relational Schemas and Predicate Logic: Notation.
CS 355 – Programming Languages
Mapping an ERD to a Relational Database To map an ERD to a relational database, five rules are defined to govern how tables are constructed. 1)Rule for.
Computability and Complexity 9-1 Computability and Complexity Andrei Bulatov Logic Reminder (Cnt’d)
A Probabilistic Framework for Information Integration and Retrieval on the Semantic Web by Livia Predoiu, Heiner Stuckenschmidt Institute of Computer Science,
Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.
NaLIX: A Generic Natural Language Search Environment for XML Data Presented by: Erik Mathisen 02/12/2008.
Relational Data Mining in Finance Haonan Zhang CFWin /04/2003.
Statistical Relational Learning for Link Prediction Alexandrin Popescul and Lyle H. Unger Presented by Ron Bjarnason 11 November 2003.
Relational Model Stores data as tables –Each column contains values about the same attribute –Each column has a distinct name –Each row contains values.
Oregon State University – CS539 PRMs Learning Probabilistic Models of Link Structure Getoor, Friedman, Koller, Taskar.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 6 The Relational Algebra and Relational Calculus.
Database Systems More SQL Database Design -- More SQL1.
Testing a program Remove syntax and link errors: Look at compiler comments where errors occurred and check program around these lines Run time errors:
Database Constraints. Database constraints are restrictions on the contents of the database or on database operations Database constraints provide a way.
Chapter 2 Modeling and Finding Abnormal Nodes. How to define abnormal nodes ? One plausible answer is : –A node is abnormal if there are no or very few.
Chapter 3: Methods of Inference
Learningcomputer.com SQL Server 2008 – Entity Relationships in a Database.
Chapter 9 Integrity. Copyright © 2004 Pearson Addison-Wesley. All rights reserved.9-2 Topics in this Chapter Predicates and Propositions Internal vs.
Chris Luszczek Biol2050 week 3 Lecture September 23, 2013.
Advanced SQL Murat Kantarcioglu Adapted from Silberchatz et al. slides.
The Relational Model: Relational Calculus
Dr. Matthew Iklé Department of Mathematics and Computer Science Adams State College Probabilistic Quantifier Logic for General Intelligence: An Indefinite.
M Taimoor Khan Course Objectives 1) Basic Concepts 2) Tools 3) Database architecture and design 4) Flow of data (DFDs)
Compiler Chapter# 5 Intermediate code generation.
10/17/2012ISC471/HCI571 Isabelle Bichindaritz 1 Technologies Databases.
CSE314 Database Systems The Relational Algebra and Relational Calculus Doç. Dr. Mehmet Göktürk src: Elmasri & Navanthe 6E Pearson Ed Slide Set.
IS 475/675 - Introduction to Database Design
EXAMPLE. Subclasses and Superclasses Entity type may have sub-grouping that need to be represented explicitly. –Example: Employee may grouped into.
1 How to decide Query Containment under Constraints using a Description Logic Ian Horrocks, Ulrike Sattler, Sergio Tessaris, and Stephan Tobies presented.
Database Management COP4540, SCS, FIU Structured Query Language (Chapter 8)
Chapter 3 Part II Describing Syntax and Semantics.
SQL LANGUAGE and Relational Data Model TUTORIAL Prof: Dr. Shu-Ching Chen TA: Hsin-Yu Ha.
For Monday Finish chapter 19 No homework. Program 4 Any questions?
For Wednesday Read 20.4 Lots of interesting stuff in chapter 20, but we don’t have time to cover it all.
NULL VALUES CHAPTER 5 (6/E) CHAPTER 8 (5/E) 1. LECTURE OUTLINE  Dealing with null values Three-valued logic Effects in WHERE clauses IS NULL Effects.
Learning Statistical Models From Relational Data Lise Getoor University of Maryland, College Park Includes work done by: Nir Friedman, Hebrew U. Daphne.
1 Reasoning with Infinite stable models Piero A. Bonatti presented by Axel Polleres (IJCAI 2001,
1-1 An Introduction to Logical Programming Sept
Arithmetic in Binary. Addition A “Rule of Addition” is a statement of the form: = 8 How many such rules are there in Decimal?
Lecture 03 Constraints. Example Schema CONSTRAINTS.
DATA MODELING AND DATABASE DESIGN DATA MODELING AND DATABASE DESIGN Part 2.
Database System Concepts, 6 th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com Chapter 4: Intermediate.
Database System Concepts, 6 th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com Module 8: Entity-Relationship.
Logic Programming (Control and Backtracking). Contents Logic Programming –sans Control –with Backtracking Streams.
Ch 05. Basic Symbols ( manino ). Cardinalities Cardinality Notation.
CSC314 DAY 8 Introduction to SQL 1. Chapter 6 © 2013 Pearson Education, Inc. Publishing as Prentice Hall SQL OVERVIEW  Structured Query Language  The.
Murali Mani Constraints. Murali Mani Keys: Primary keys and unique CREATE TABLE Student ( sNum int, sName varchar (20), dept char (2), CONSTRAINT key.
1 The Relational Data Model David J. Stucki. Relational Model Concepts 2 Fundamental concept: the relation  The Relational Model represents an entire.
Probabilistic Reasoning Inference and Relational Bayesian Networks.
IT 5433 LM3 Relational Data Model. Learning Objectives: List the 5 properties of relations List the properties of a candidate key, primary key and foreign.
Chapter 6: Integrity (and Security)
Chapter 7: Entity-Relationship Model
February 7th – Exam Review
Module 8 – Database Design Using the E-R Model
Probabilistic Horn abduction and Bayesian Networks
More SQL: Complex Queries, Triggers, Views, and Schema Modification
Mapping an ERD to a Relational Database
Topic - DML - Select statement
Presentation transcript:

A Logical Formulation of PRMs

Example Institute(InstId,Type) Researcher(RID,Area,Salary,InstID) Paper(PaperId,Topic) Author(RId,PaperID) Cites(PaperId1,PaperId2)

Types of Uncertainty intra-relational dependency –a researcher’s salary depends on their research area inter-relational dependency –a researcher’s salary depends on the type of institute they work at reference uncertainty –a paper’s author is more likely to be a research in the same area as the paper exists uncertainty –a citation between two papers is more likely to exist if they are on the same topic identity uncertainty –the authors of two distinct papers are more likely to be the same individual if the author names are similar and if the co-authors are the same

Keys

DependsOn Predicates Examples: –DependsOn 1 (Salary; Area)  Researcher(RId,Salary,Area,InstId) –DependsOn 1 (Salary; Area, Type)  Researcher(RId,Salary,Area,InstId), Institute(InstId,Type)

Rules for DependsOn The set of DependsOn predicates occur only in the heads of clauses The body of a DependsOn clause may contain extensional predicates, built-in predicates Every descriptive attribute A must appear as the first argument of a DependsOn predicate If there is more than one DependsOn predicate for a particular attribute, require for each corresponding key, only one DependsOn matches.

Aggregates A researcher’s salary depends on the number of publications they have: –Count RID Author;PaperId (RId,CntPapers) –this takes the Author relation, Author(RId,PaperId) groups by RId and takes the count Equivalent to –select RId,count(PaperId) as CntPapersfrom Author group by RId More general form: –Aggr key predicate;Aggr-Variable-List (Key,AggrVal)

Syntax Predicates – ordinary predicates, aggregates, DependsOn Clauses – Key Constraints, DependsOn Clauses CPDs

Semantics Attribute Uncertainty –Background theory provides instantiations for both the primary key and foreign keys through a set of partially instantiated extensional predicates

A Sample KB Researcher-Inst(101) Researcher-Inst(102) Researcher-Institute- Inst(101,201) Researcher-Institute- Inst(102,201) Institute-Inst(201) Paper-Inst(301) Author-Inst(101,301) Author-Inst(102,301) Paper-Inst(302) Author-Inst(101,302) Cites-Inst( )

Intensional Predicates to Introduce RVs  Area, Salary Researcher(RId,Area,Salary,InstId)  Researcher-Institute-Inst(RId,InstId)  Type Institute(InstId,Type)  Institute-Inst(InstId)

Dependency Graph Convert each numbered DependsOn statement to a general binary relation  –DependsOn(A i ;….,A,,…)  … –Let V i and V, be instantiations – we add V i < V, We require < to be acyclic

Reference Uncertainty Paper(PaperId,Topic), Venue(VenueId,Area), PublishedIn(PaperId,VenueID) Paper-Inst(301), Paper-Inst(302), Venue- Inst(stoc), Venue-Inst(focs), Venue-Inst(icse), Venue-Inst(pldi), Venue-Inst(isca)  Venue PublishedIn(301,Venue)  Venue PublishedIn(302,Venue) VenueKeys = { VenueId |  VenueId Venue- Inst(VenueId)} VenueKeys = {stoc,focs,icse,pldi,isca}

FKDependsOn FKDependsOn(VenueId;Area;Topic)  PublishedIn(PaperId,VenueId), Paper(PaperId,Topic),Venue(VenueId,Area) General form: –FKDependsOn(variable; ; ) Once a partition is chosen for a variable, the key is chosen uniformly from that partition.

Ensuring Coherence We require that the parents and the variables that define the partition come before the fk variable in the dependency graph Also, any dependencies based on the fk must occur after the fk is determined.

Existence Uncertainty CiteExists(PaperId1,PaperId2,Exists) Cites(PaperId1,PaperId2)  CiteExists(PaperId1,PaperId2,True) DependsOn(Exists;Topic1,Topic2)  CiteExists(PaperId1,PaperId2,Exists), Paper(PaperId1,Topic1), Paper(PaperId2,Topic2)