Presentation is loading. Please wait.

Presentation is loading. Please wait.

Design Algorithm Essentials 1.Combine functional edges with the same tail object set(s) into a scheme. (The tail object set(s) and any others in a 1-1.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Design Algorithm Essentials 1.Combine functional edges with the same tail object set(s) into a scheme. (The tail object set(s) and any others in a 1-1."— Presentation transcript:

1 Design Algorithm Essentials 1.Combine functional edges with the same tail object set(s) into a scheme. (The tail object set(s) and any others in a 1-1 correspondence are keys.) 2.Each nonfunctional edge is a scheme. (All object sets constitute the key.) 3. Each stand-alone object set is a scheme. (The lone object set is a key.) A B C A B C A B C AA ABA B A B C A B C A B C A B C D D A B C D

2 B&B Example – Canonical

3 B&B Example – Generated Database Scheme Room(RoomNr, RoomName, NrBeds, Cost) Guest(GuestNr, GuestName, StreetNr, City) Reservation(GuestNr, RoomNr, ArrivalDate, NrDays) Room[RoomNr]  Reservation[RoomNr] Guest[GuestNr] = Reservation[GuestNr]

4 B&B Example – ORM Diagram

5 B&B Example – ORM Hypergraph

6 B&B Example – Congruent

7 B&B Example – Canonical

8 B&B Example – Generated Database Scheme Room(RoomNr, RoomName, NrBeds, Cost) Guest(GuestNr, GuestName, StreetNr, City) Reservation(GuestNr, RoomNr, ArrivalDate, NrDays) Room[RoomNr]  Reservation[RoomNr] Guest[GuestNr] = Reservation[GuestNr]

Download ppt "Design Algorithm Essentials 1.Combine functional edges with the same tail object set(s) into a scheme. (The tail object set(s) and any others in a 1-1."

Similar presentations

L ECTURE 3 T HEORY OF AUTOMATA. E QUIVALENT R EGULAR E XPRESSIONS Definition Two regular expressions are said to be equivalent if they generate the same.

L ECTURE 3 T HEORY OF AUTOMATA. E QUIVALENT R EGULAR E XPRESSIONS Definition Two regular expressions are said to be equivalent if they generate the same.
Minimum Spanning Trees (MSTs) Prim's Algorithm For each vertex not in the tree, keep track of the lowest cost edge that would connect it to the tree This.

Minimum Spanning Trees (MSTs) Prim's Algorithm For each vertex not in the tree, keep track of the lowest cost edge that would connect it to the tree This.
Chapter 3 - 1 Secondary Storage Rough Speed Differentials –nanoseconds: retrieve data in main memory –microseconds: retrieve from disk cache or under a.

Chapter Secondary Storage Rough Speed Differentials –nanoseconds: retrieve data in main memory –microseconds: retrieve from disk cache or under a.
FIGURES FOR CHAPTER 19 STATE MACHINE DESIGN WITH SM CHARTS

FIGURES FOR CHAPTER 19 STATE MACHINE DESIGN WITH SM CHARTS
Chapter 4.5 Notes: Prove Triangles Congruent by ASA and AAS Goal: You will use two more methods to prove congruences.

Chapter 4.5 Notes: Prove Triangles Congruent by ASA and AAS Goal: You will use two more methods to prove congruences.
Day 2 I can understand the concept of congruent figures. I can accurately identify the corresponding parts of figures. Find the number of triangles in.

Day 2 I can understand the concept of congruent figures. I can accurately identify the corresponding parts of figures. Find the number of triangles in.
Chapter 4: Congruent Triangles Objective: To recognize congruent triangles and their corresponding parts. Key Vocabulary: Congruent Triangles.

Chapter 4: Congruent Triangles Objective: To recognize congruent triangles and their corresponding parts. Key Vocabulary: Congruent Triangles.
Mrs. Rivas ∠

Mrs. Rivas ∠
Parallel Line Proof. Parallel Line Proof The idea behind a proof is that you begin with information that is given to you as part of the problem and you.

Parallel Line Proof. Parallel Line Proof The idea behind a proof is that you begin with information that is given to you as part of the problem and you.
NestedRelations: 1 Nested Relations Flat schemas often have replicated data values in their relations. Nested schemas allow us to collapse some of these.

NestedRelations: 1 Nested Relations Flat schemas often have replicated data values in their relations. Nested schemas allow us to collapse some of these.
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.
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.
A 1 A 2 A 3 A 4 B 1 2 4 6 8 20 B 2 2 4 6 8 20 B 3 2 4 6 8 20 6 12 18 24.

A 1 A 2 A 3 A 4 B B B
FileOrg: 1 Secondary Storage Rough Speed Differentials –nanoseconds: retrieve data in main memory –microseconds: retrieve from under a read head –milliseconds:

FileOrg: 1 Secondary Storage Rough Speed Differentials –nanoseconds: retrieve data in main memory –microseconds: retrieve from under a read head –milliseconds:
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.
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.

Similar presentations

Ads by Google