Presentation is loading. Please wait.

Presentation is loading. Please wait.

NestedRelations: 1 Nested Relations Flat schemas often have replicated data values in their relations. Nested schemas allow us to collapse some of these.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "NestedRelations: 1 Nested Relations Flat schemas often have replicated data values in their relations. Nested schemas allow us to collapse some of these."— Presentation transcript:

1 NestedRelations: 1 Nested Relations Flat schemas often have replicated data values in their relations. Nested schemas allow us to collapse some of these replicated data values. NrBeds RoomNr (NrBeds ( RoomNr )* )* 2 1 2 1 2 2 2 2 3 3 1 4 1 4 1 5 5

2 NestedRelations: 2 Redundancy in Nested Schemes The redundancy definition is the same as for flat relations. If a hidden value can be uniquely determined or if a value change causes a constraint violation, the value is redundant. (NrBeds (RoomNr (View)* )* )* 2 1 Sea Forest City 2 Sea Forest 3 City (View (RoomNr NrBeds)* )* Sea 1 2 2 2 Forest 1 2 2 2 City 1 2 3 2

3 NestedRelations: 3 NNF: Redundancy Free Nested Schemas Input: a canonical, acyclic, binary hypergraph H. Output: a set of nested schemas with no potential redundancy. Repeat Mark an unmarked node in H as the first attribute in a new nested schema. While an unmarked edge is incident on a marked node A: Mark the edge. If A  B: Add B with A; Mark B. If A  B: Add B with A; Mark B if all B’s incident edges are marked. If A  B: Nest B under A; Mark B. Else (A — B): Nest B under A; Mark B if all B’s incident edges are marked. Until all nodes have been marked

4 NestedRelations: 4 Nested Schema Generation Example 1. (NrBeds, (RoomNr, RoomName, Cost, (View)*, (GuestNr, GuestName)* )* )* 2. (RoomNr, RoomName, Cost, NrBeds, (View)*, (GuestNr, GuestName)* )* 3. (GuestNr, GuestName, RoomNr)* (RoomNr, RoomName, Cost, NrBeds (View)* )*

5 NestedRelations: 5 Redundancy Prevention xa1yb2zxa1yb2z (A ( BC )* )* ax1 y1 2 by1 2 z2 This replication... … causes this redundancy.

6 NestedRelations: 6 Generalization for N-ary Relationship Sets “Composite nodes” can be treated as a single node. –(B C (A)* (D)* )* –(D (B C)* )*; (A B C)* Or, n-ary edges (n  3) can be converted to an object set and n binary relationship sets. NNF, basically: –Schemes should be constructed along hypergraph paths. –Schemes should not violate the natural 1-many hierarchical structure.

Download ppt "NestedRelations: 1 Nested Relations Flat schemas often have replicated data values in their relations. Nested schemas allow us to collapse some of these."

Similar presentations

Some Properties of SSA Mooly Sagiv. Outline Why is it called Static Single Assignment form What does it buy us? How much does it cost us? Open questions.

Some Properties of SSA Mooly Sagiv. Outline Why is it called Static Single Assignment form What does it buy us? How much does it cost us? Open questions.
Depth-First Search1 Part-H2 Depth-First Search DB A C E.

Depth-First Search1 Part-H2 Depth-First Search DB A C E.
Compiler Construction Sohail Aslam Lecture 26. 2 Finite Automaton of Items Then for every item A →  X  we must add an  -transition for every production.

Compiler Construction Sohail Aslam Lecture Finite Automaton of Items Then for every item A →  X  we must add an  -transition for every production.
Graphs III (Trees, MSTs) (Chp 11.5, 11.6)

Graphs III (Trees, MSTs) (Chp 11.5, 11.6)
Designing Indexing Structure for Discovering Relationships in RDF Graphs Stanislav Bartoň.

Designing Indexing Structure for Discovering Relationships in RDF Graphs Stanislav Bartoň.
Graphs By JJ Shepherd. Introduction Graphs are simply trees with looser restrictions – You can have cycles Historically hard to deal with in computers.

Graphs By JJ Shepherd. Introduction Graphs are simply trees with looser restrictions – You can have cycles Historically hard to deal with in computers.
FUNDAMENTAL PROBLEMS AND ALGORITHMS Graph Theory and Combinational © Giovanni De Micheli Stanford University.

FUNDAMENTAL PROBLEMS AND ALGORITHMS Graph Theory and Combinational © Giovanni De Micheli Stanford University.
Chapter 10 - 1 Design Objectives Obtain the theoretically “best” design (normalize) –Remove redundancy and update anomalies –Remove nulls –Minimize the.

Chapter Design Objectives Obtain the theoretically “best” design (normalize) –Remove redundancy and update anomalies –Remove nulls –Minimize the.
P and NP Sipser 7.2-7.3 (pages 256-270). CS 311 Fall 2008 2 Polynomial time P = ∪ k TIME(n k ) … P = ∪ k TIME(n k ) … TIME(n 3 ) TIME(n 2 ) TIME(n)

P and NP Sipser (pages ). CS 311 Fall Polynomial time P = ∪ k TIME(n k ) … P = ∪ k TIME(n k ) … TIME(n 3 ) TIME(n 2 ) TIME(n)
Binary Decision Diagrams. ROBDDs Slide 2 Example Directed acyclic graph non-terminal node terminal node What function is represented by the graph?

Binary Decision Diagrams. ROBDDs Slide 2 Example Directed acyclic graph non-terminal node terminal node What function is represented by the graph?
XNF: 1 XML and NNF A Standard Form for XML Documents (XNF) Properties –As few hierarchical trees as possible –No redundant data values in any tree Method.

XNF: 1 XML and NNF A Standard Form for XML Documents (XNF) Properties –As few hierarchical trees as possible –No redundant data values in any tree Method.
Chapter 2 - 1 Abstraction Concrete: directly executable/storable Abstract: not directly executable/storable –automatic translation (as good as executable/storable)

Chapter Abstraction Concrete: directly executable/storable Abstract: not directly executable/storable –automatic translation (as good as executable/storable)
FDImplication: 1 Functional Dependencies (FDs) Let r(R) be a relation and let t  r, then the restriction of t to X  R, written t[X], is the projection.

FDImplication: 1 Functional Dependencies (FDs) Let r(R) be a relation and let t  r, then the restriction of t to X  R, written t[X], is the projection.
Graphs and Trees This handout: Trees Minimum Spanning Tree Problem.

Graphs and Trees This handout: Trees Minimum Spanning Tree Problem.
Mappings & Normal Form Guarantees. Can Mappings of Diagrams Yield Normalized Schemas? “Yes”—but only if canonical. Most (?) diagrams are canonical. Mappings.

Mappings & Normal Form Guarantees. Can Mappings of Diagrams Yield Normalized Schemas? “Yes”—but only if canonical. Most (?) diagrams are canonical. Mappings.
OSM—Normalize Then Map. ER Model Instance Type  RackRate Room Date  Guest Rate Discount Date  Discount Rate = (1 – Discount/100)  RackRate includes.

OSM—Normalize Then Map. ER Model Instance Type  RackRate Room Date  Guest Rate Discount Date  Discount Rate = (1 – Discount/100)  RackRate includes.
Chapter 10 - 1 Nested Schemes Flat schemes often have replicated data values. Nested schemes allow us to collapse some of these replicated data values.

Chapter Nested Schemes Flat schemes often have replicated data values. Nested schemes allow us to collapse some of these replicated data values.
Information Resources Management February 13, 2001.

Information Resources Management February 13, 2001.
Producing XML Documents with Guaranteed “Good” Properties David W. Embley Brigham Young University Wai Y. Mok University of Alabama in Huntsville Sponsored.

Producing XML Documents with Guaranteed “Good” Properties David W. Embley Brigham Young University Wai Y. Mok University of Alabama in Huntsville Sponsored.
1 Regular Grammars Generate Regular Languages. 2 Theorem Regular grammars generate exactly the class of regular languages: If is a regular grammar then.

1 Regular Grammars Generate Regular Languages. 2 Theorem Regular grammars generate exactly the class of regular languages: If is a regular grammar then.

Similar presentations

Ads by Google