1 2. Constraint Databases Next level of data abstraction: Constraint level – finitely represents by constraints the logical level.

Slides:



Advertisements
Similar presentations
1 First order theories (Chapter 1, Sections 1.4 – 1.5)
Advertisements

B ϋ CHIS MONADIC SECOND ORDER LOGIC Verification Seminar V.Sowjanya Lakshmi ( Subhasree M.
Presented by: Ms. Maria Estrellita D. Hechanova, ECE
The Complex Number System
Linear Representation of Relational Operations Kenneth A. Presting University of North Carolina at Chapel Hill.
Inductive definitions: S is the smallest set that contains some set I of initial elements and is closed for some operations. Two methods to construct S:
CSCI 115 Chapter 6 Order Relations and Structures.
1 541: Relational Calculus. 2 Relational Calculus  Comes in two flavours: Tuple relational calculus (TRC) and Domain relational calculus (DRC).  Calculus.
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Instructor: Hayk Melikya
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
12.1 Systems of Linear Equations: Substitution and Elimination.
1 9. Evaluation of Queries Query evaluation – Quantifier Elimination and Satisfiability Example: Logical Level: r   y 1,…y n  r’ Constraint.
Denoting the beginning
Discrete Mathematics Lecture 4 Harper Langston New York University.
מבנה המחשב + מבוא למחשבים ספרתיים תרגול 1#
© M.E. Fayad SJSU -- CmpE Database Design Dr. M.E. Fayad, Professor Computer Engineering Department, Room #283I College of Engineering San José.
Lattice and Boolean Algebra
Rutgers University Relational Calculus 198:541 Rutgers University.
Ofer Strichman, Technion Deciding Combined Theories.
2.5 Zeros of Polynomial Functions
Linear Functions.
DEDUCTIVE DATABASE.
1 Section 10.1 What Is an Algebra? To most people the word algebra means high school algebra. But there are many kinds of algebra. An algebra consists.
Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
DECIDABILITY OF PRESBURGER ARITHMETIC USING FINITE AUTOMATA Presented by : Shubha Jain Reference : Paper by Alexandre Boudet and Hubert Comon.
DBSQL 3-1 Copyright © Genetic Computer School 2009 Chapter 3 Relational Database Model.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Relational Calculus Chapter 4, Section 4.3.
By : Fridgo Tasman, S.Pd., M.Sc.. A Set is a simply collection of distict objects. The objects can be person, number, food, and something else. Therefore,
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Michaelmas Term 2004 Discrete Mathematics CSC 141 Discrete Mathematics Dr. Corina Sas and Ms. Nelly Bencomo
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 – 7.2 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean.
Chapter 2 Mathematical preliminaries 2.1 Set, Relation and Functions 2.2 Proof Methods 2.3 Logarithms 2.4 Floor and Ceiling Functions 2.5 Factorial and.
Rendezvous of Logic, Complexity and Algebra by Hubie Chen SIGACT News Logic Column 17.
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.
Algebra II Honors Properties Review Chapter 1. We will solve 2x + 4 = 6x – 12 Showing all of the properties used So Let’s go!
CompSci 102 Discrete Math for Computer Science
Week 6 - Friday.  What did we talk about last time?  Solving recurrence relations.
Math 1304 Calculus I 2.3 – Rules for Limits.
A Logic of Partially Satisfied Constraints Nic Wilson Cork Constraint Computation Centre Computer Science, UCC.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesBoolean Algebra.
Mathematical Preliminaries
THE REAL NUMBERS College Algebra. Sets Set notation Union of sets Intersection of sets Subsets Combinations of three or more sets Applications.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/19/2008.
1 First order theories (Chapter 1, Sections 1.4 – 1.5) From the slides for the book “Decision procedures” by D.Kroening and O.Strichman.
Discrete Mathematics Set.
Set Theory Concepts Set – A collection of “elements” (objects, members) denoted by upper case letters A, B, etc. elements are lower case brackets are used.
Database Management Systems, R. Ramakrishnan1 Relational Calculus Chapter 4, Part B.
4.2 Area Definition of Sigma Notation = 14.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesBoolean Algebra.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
Relational Calculus Chapter 4, Section 4.3.
Do Now from 1.2a Find the domain of the function algebraically and support your answer graphically. Find the range of the function.
College Algebra Chapter 3 Polynomial and Rational Functions
Properties of Operations
Commutative Property of Addition
Math 1304 Calculus I 2.3 – Rules for Limits.
Formal Modeling Concepts
MATH Algebra II Analyzing Equations and Inequalities
Linear Systems Chapter 3.
25. Basic matrix operations
Discrete Mathematics CS 2610
MATH CP Algebra II Analyzing Equations and Inequalities
Database Design Dr. M.E. Fayad, Professor
Algebraic Trace Theory

Presentation transcript:

1 2. Constraint Databases Next level of data abstraction: Constraint level – finitely represents by constraints the logical level

2 2.1 Constraints Arithmetic Atomic Constraints Equality: u = v Inequality: u ≠ v Lower bound: u ≥ b Upper bound: – u ≥ b Order: u ≥ v Gap-order: u – v ≥ b where b ≥ 0 Difference: u – v ≥ b

3 Half-Addition: ± u ± v ≥ b where b ≥ 0 Addition: ± u ± v ≥ b Linear: c 1 x 1 + ……+ c n x n ≥ b Polynomial: p( x 1,……..,x n ) ≥ b Note: Instead of ≥ we can also use >

4 Boolean Atomic Constraints Boolean Algebra D – domain, 0 – zero element, 1 – one element. such that the following axioms hold:

5 Commutative: x V y = y V x x Λ y = y Λ x Distributive: x V ( y Λ z ) = ( x V y ) Λ ( x V z ) x Λ ( y V z ) = ( x Λ y ) V ( x Λ z ) Inverse: x V x’ = 1 x Λ x’ = 0 Zero and one element properties: x V 0 = x x Λ 1 = x 0 ≠ 1

6 Boolean equality constraints: T = B 0 Boolean inequality constraints: T ≠ B 0 where T is a Boolean term built from domain elements and operations of the boolean algebra. Example: ( x’ Λ z ) V ( y Λ z ) V ( x Λ y’ Λ z’ ) = B 0

7 Constraint Formulas: each atomic constraint if F and G are formulas, then (F and G) is a formula and (F or G) is a formula. if F is a formula, then (not F) is a formula.

8 Let F(x 1,…,x n ) be a formula with n rows, t = (c 1,…,c n ) a tuple with n constants. t satisfies F (t F) – substituting each x i by c i makes F true.

9 Interpretation of free Boolean algebra: Symbols are interpreted to be concrete operators or values. Example: D – all subsets of 1 Λ – intersection V – union ‘ – complement 0 – emptyset 1 – set of names of all animals {cat, dog, parrot,…} Question: What would be the meaning of the example Boolean constraint under this interpretation ?

10 Constants in constraints are also interpreted Example: Suppose we have the constraint b Λ m = 0 and we interpret b as {canary, parrot, falcon} m as {cat, dog} Question: Is the Boolean constraint true under this interpretation ?

The Constraint Data Model Constraint relation – a finite set of constraint tuples. Constraint tuples – tuples with variables and constraints that restrict the variables. Example: ( i, t : 0 ≤ i, i ≤ 24000, t = 0.15 i ) is a constraint tuple of Taxtable(Income, Tax). It means that the tax is 15% on any income below $24,000.

Data Abstraction Logical level – infinite relation r, tuple t Constraint level – finite relation R, constraint tuple C, t є r iff t |= C for some C є R Physical level – the way the data is actually stored in the computer system