LOSSLESS DECOMPOSITION Prof. Sin-Min Lee Department of Computer Science San Jose State University.

Slides:

Advertisements

Similar presentations

Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 16 Relational Database Design Algorithms and Further Dependencies.

Advertisements

Prof. Amr Goneid, AUC1 Analysis & Design of Algorithms (CSCE 321) Prof. Amr Goneid Department of Computer Science, AUC Part R4. Disjoint Sets.

Lossless Decomposition Anannya Sengupta CS 157A Prof. Sin-Min Lee.

Announcements Read 6.1 – 6.3 for Wednesday Project Step 3, due now Homework 5, due Friday 10/22 Project Step 4, due Monday Research paper –List of sources.

LOSSLESS DECOMPOSITION Prof. Sin-Min Lee Department of Computer Science San Jose State University.

More Set Definitions and Proofs 1.6, 1.7. Ordered n-tuple The ordered n-tuple (a1,a2,…an) is the ordered collection that has a1 as its first element,

1 Conjunctions of Queries. 2 Conjunctive Queries A conjunctive query is a single Datalog rule with only non-negated atoms in the body. (Note: No negated.

METU Department of Computer Eng Ceng 302 Introduction to DBMS Further Dependencies by Pinar Senkul resources: mostly froom Elmasri, Navathe and other books.

Lossless Decomposition (2) Prof. Sin-Min Lee Department of Computer Science San Jose State University.

Generalized Derangements Anthony Fraticelli Missouri State University REUJuly 30, 2009 Advisor: Dr. Les Reid.

CS Algorithm : Decomposition into 3NF  Obviously, the algorithm for lossless join decomp into BCNF can be used to obtain a lossless join decomp.

Lossless Decomposition (2) Prof. Sin-Min Lee Department of Computer Science San Jose State University.

Multivalued Dependency Prof. Sin-Min Lee Department of Computer Science.

RELATIONAL ALGEBRA (III) Prof. Sin-Min LEE Department of Computer Science.

Sequential Circuits Problems(II) Prof. Sin-Min Lee Department of Mathematics and Computer Science Algorithm = Logic + Control.

DATABASE DESIGN Functional Dependencies. Overview n Functional Dependencies n Normalization –Functional dependencies –Normal forms.

Normal Form Design addendum by C. Zaniolo. ©Silberschatz, Korth and Sudarshan7.2Database System Concepts Normal Form Design Compute the canonical cover.

Multivalued Dependency Prof. Sin-Min Lee Department of Computer Science.

Instruction set architecture Problems Prof. Sin-Min Lee Department of Mathematics and Computer Science.

Lossless Decomposition By Chi-Shu Ho For CS157A Prof. Sin-Min Lee.

Lossless Decomposition Prof. Sin-Min Lee Department of Computer Science San Jose State University.

Decomposition Liangsheng Deng Section 2 11/15/2005.

Cs3431 Normalization Part II. cs3431 Attribute Closure : Example Consider R (A, B, C, D, E) with FDs A  B, B  C, CD  E Does A  E hold ? (Is A  E.

METU Department of Computer Eng Ceng 302 Introduction to DBMS Relational Database Design Algorithms by Pinar Senkul resources: mostly froom Elmasri, Navathe.

1 times table 2 times table 3 times table 4 times table 5 times table

Trees and Tree Traversals Prof. Sin-Min Lee Department of Computer Science San Jose State University.

On Balanced Index Sets of Disjoint Union Graphs Sin-Min Lee Department of Computer Science San Jose State University San Jose, CA 95192, USA Hsin-Hao Su.

Announcements Read 5.8 – 5.13 for Monday Project Step 3, due Monday 10/18 Homework 4, due Friday 10/15 – by (or turn in Monday in class)

Copyright © 2007 Ramez Elmasri and Shamkant B. Navathe Slide DESIGNING A SET OF RELATIONS (2) Goals: Lossless join property (a must). Dependency.

BCNF & Lossless Decomposition Prof. Sin-Min Lee Department of Computer Science.

CS 235: User Interface Design September 22 Class Meeting Department of Computer Science San Jose State University Fall 2014 Instructor: Ron Mak

Partitions of Integers Prof. Sin-Min Lee Department of Computer Science San Jose State University.

Copyright © 2007 Ramez Elmasri and Shamkant B. Navathe Chapter 11 Relational Database Design Algorithms and Further Dependencies.

Database System Concepts, 6 th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com Chapter 2: Introduction.

1 CSE 480: Database Systems Lecture 18: Normal Forms and Normalization.

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

Tables Learning Support

N-ary Relations & Their Applications. 2 n-ary Relations Let A 1, A 2, …, A n be sets. An n-ary relation on these sets is a subset of A 1 x A 2 x … x A.

Huffman code and Lossless Decomposition Prof. Sin-Min Lee Department of Computer Science.

Thinking Mathematically Venn Diagrams and Subsets.

Copyright © 2007 Ramez Elmasri and Shamkant B. Navathe Slide

Copyright © 2007 Ramez Elmasri and Shamkant B. Navathe Slide

1 ALGEBRAIC TOPOLOGY SIMPLICAL COMPLEX ALGEBRAIC TOPOLOGY SIMPLICAL COMPLEX Tsau Young (‘T. Y.’) Lin Institute of Data Science and Computing and Computer.

Copyright © 2007 Ramez Elmasri and Shamkant B. Navathe Slide

Functional Dependency

Database Design Dr. M.E. Fayad, Professor

The Closure of a set of Attributes

Nondeterministic Finite Automata

Dependency Preservation

Multivalued Dependencies & Fourth Normal Form

Decomposition of relational schemes

Relational Data Base Design in Practice

Appendix C: Advanced Normalization Theory

Normalization cs3431.

Chapter 2: Intro to Relational Model

Relational Database Design

Chapter 2: Intro to Relational Model

CSC 4170 Theory of Computation Finite Automata Section 1.1.

Third Normal Form.

Relational Database Theory

Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28

Appendix C: Advanced Relational Database Design

3 times tables.

6 times tables.

Chapter 28: Advanced Relational Database Design

Database Design Dr. M.E. Fayad, Professor

Presentation transcript:

LOSSLESS DECOMPOSITION Prof. Sin-Min Lee Department of Computer Science San Jose State University

Definition of Decomposition A decomposition of a relation R is a set of relations { R1, R2,…, Rn } such that each Ri is a subset of R and the union of all of the Ri is R

Example of Decomposition From R( A B C ) we can have two subsets as: R1( A C ) and R2( B C ) if we union R1 and R2 we will get R R = R1 U R2

Definition of Lossless Decompotion A decomposition {R1, R2,…, Rn} of a relation R is called a lossless decomposition for R if the natural join of R1, R2,…, Rn produces exactly the relation R.

Example R( A1, A2, A3, A4, A5 ) R1( A1, A2, A3, A5 ); R2( A1, A3, A4 ); R3( A4, A5 ) are subsets of R. We have FD1: A1 --> A3 A5 FD2: A2 A3 --> A2 FD3: A5 --> A1 A4 FD4: A3 A4 --> A2

A1 A2 A3 A4 A5 a(1) a(2) a(3) b(1,4) a(5) a(1) b(2,2) a(3) a(4) b(2,5) b(3,1) b(3,2) b(3,3) a(4) a(5)

By FD1: A1 --> A3 A5 we have a new result table A1 A2 A3 A4 A5 a(1) a(2) a(3) b(1,4) a(5) a(1) b(2,2) a(3) a(4) a(5) b(3,1) b(3,2) b(3,3) a(4) a(5)

By FD2: A2 A3 --> A4 we don’t have a new result table because we don’t have any equally elements. Therefore, the result doesn’t change.

By FD3: A5 --> A1 A4 we have a new result table A1 A2 A3 A4 A5 a(1) a(2) a(3) a(4) a(5) a(1) b(2,2) a(3) a(4) a(5) b(3,1) b(3,2) b(3,3) a(4) a(5)

By FD4: A3 A4 --> A2 we get a new result table A1 A2 A3 A4 A5 a(1) a(2) a(3) a(4) a(5) b(3,1) b(3,2) b(3,3) a(4) a(5) tuple1 and tuple2 are lossless because they have all a(I)