Presentation is loading. Please wait.

Presentation is loading. Please wait.

CostAnalysis: 1 Cost Analysis Rule-of-Thumb Guidelines As a guide, consider denormalizing if: –redundancy is minimal and update anomalies are not expected.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "CostAnalysis: 1 Cost Analysis Rule-of-Thumb Guidelines As a guide, consider denormalizing if: –redundancy is minimal and update anomalies are not expected."— Presentation transcript:

1 CostAnalysis: 1 Cost Analysis Rule-of-Thumb Guidelines As a guide, consider denormalizing if: –redundancy is minimal and update anomalies are not expected (e.g., StreetNr City State  Zip) –replicated objects are large (e.g., images in View) –join frequencies are very high when compared to updates (e.g., approximate cost in Canadian dollars) Using actual application characteristics, estimate space and time requirements for various possibilities and compare costs.

2 CostAnalysis: 2 Cost Estimation (Space) Case 1: Room(RoomNr, RoomName, NrBeds, Cost) Guest(GuestNr, GuestName, StreetNr, City) Reservation(GuestNr, RoomNr, ArrivalDate, NrDays) vs. Case 2: Room(RoomNr, RoomName, NrBeds, Cost) Reservation(GuestNr, GuestName, StreetNr, City, RoomNr, ArrivalDate, NrDays) vs. Case 3: Guest(GuestNr, GuestName, StreetNr, City) Reservation(GuestNr, RoomNr, ArrivalDate, NrDays, RoomName, NrBeds, Cost) vs. Case 4: Reservation(GuestNr, GuestName, StreetNr, City, RoomNr, ArrivalDate, NrDays, RoomName, NrBeds, Cost) Assume: 5 rooms, 100 reservations, and 80 guests. 5  4 = 20 80  4 = 320 100  4 = 400 740 5  4 = 20 100  7 = 700 720 80  4 = 320 100  7 = 700 1020 100  10 = 1000

3 CostAnalysis: 3 Cost Estimation (Time) Case 1: Room(RoomNr, RoomName, NrBeds, Cost) Guest(GuestNr, GuestName, StreetNr, City) Reservation(GuestNr, RoomNr, ArrivalDate, NrDays) vs. Case 2: Room(RoomNr, RoomName, NrBeds, Cost) Reservation(GuestNr, GuestName, StreetNr, City, RoomNr, ArrivalDate, NrDays) Most important queries/updates: 1. (40%) What rooms are available? 2. (30%) Make a reservation. 3. (10%) Change a reservation. 4. (10%) Cancel a reservation. 5. (the rest) Miscellaneous. Assume indexed on primary keys. 1. Case 1 & 2: Using the Reservation table, retrieve reservations that could overlap the requested date and determine room availability. (Case 1 insignificantly better  the only difference is that Case 1 transfers fewer values in its records.) …

4 CostAnalysis: 4 Semantic Change? Case 1: Room(RoomNr, RoomName, NrBeds, Cost) Guest(GuestNr, GuestName, StreetNr, City) Reservation(GuestNr, RoomNr, ArrivalDate, NrDays) vs. Case 2: Room(RoomNr, RoomName, NrBeds, Cost) Reservation(GuestNr, GuestName, StreetNr, City, RoomNr, ArrivalDate, NrDays) Most important queries/updates:... 2. (30%) Make a reservation.... Assume indexed on primary keys. 2. Case 1: Insert tuple in Reservation (1 read & 1 write) and insert tuple in Guest, if necessary, (1 read and (usually) 1 write). Case 2: Insert tuple in Reservation (1 read & 1 write); check duplicate guest information (read file, or add secondary index). (Developer) Do we really need to check duplicate guest information? (Proprietor) Hmmm, maybe not; it doesn’t matter if it is different. (Developer) Does a guest always need the same guest number? (Proprietor) Not really; there are no guest numbers in our manual system. (Developer) Aha! Great, this really lets us save  watch this.

5 CostAnalysis: 5 Unique GuestNr in Reservation Observe that we have a new set of keys: { {GuestNr}, {RoomNr, ArrivalDate} } And thus a new generated database scheme: Reservation(GuestNr, GuestName, City, Street, RoomNr, ArrivalDate, NrDays) Room(RoomNr, RoomName, NrBeds, Cost)

Download ppt "CostAnalysis: 1 Cost Analysis Rule-of-Thumb Guidelines As a guide, consider denormalizing if: –redundancy is minimal and update anomalies are not expected."

Similar presentations

©Silberschatz, Korth and Sudarshan12.1Database System Concepts Chapter 12: Indexing and Hashing Basic Concepts Ordered Indices B+-Tree Index Files B-Tree.

©Silberschatz, Korth and Sudarshan12.1Database System Concepts Chapter 12: Indexing and Hashing Basic Concepts Ordered Indices B+-Tree Index Files B-Tree.
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.
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.
De-normalize if… Performance is unsatisfactory Table has a low update rate –(sacrifice flexibility) Table has a high query rate –(speed up retrieval)

De-normalize if… Performance is unsatisfactory Table has a low update rate –(sacrifice flexibility) Table has a high query rate –(speed up retrieval)
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)
PowerPoint Presentation for Dennis & Haley Wixom, Systems Analysis and Design Copyright 2000 © John Wiley & Sons, Inc. All rights reserved. Slide 1 Key.

PowerPoint Presentation for Dennis & Haley Wixom, Systems Analysis and Design Copyright 2000 © John Wiley & Sons, Inc. All rights reserved. Slide 1 Key.
Chapter 16-17 Physical Database Design Methodology Software & Hardware Mapping Logical Design to DBMS Physical Implementation Security Implementation Monitoring.

Chapter Physical Database Design Methodology Software & Hardware Mapping Logical Design to DBMS Physical Implementation Security Implementation Monitoring.
1 File Organizations and Indexing Module 4, Lecture 2 “How index-learning turns no student pale Yet holds the eel of science by the tail.” -- Alexander.

1 File Organizations and Indexing Module 4, Lecture 2 “How index-learning turns no student pale Yet holds the eel of science by the tail.” -- Alexander.
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.
Database Implementation Issues CPSC 315 – Programming Studio Spring 2008 Project 1, Lecture 5 Slides adapted from those used by Jennifer Welch.

Database Implementation Issues CPSC 315 – Programming Studio Spring 2008 Project 1, Lecture 5 Slides adapted from those used by Jennifer Welch.
SQL Components DML DDL DAL. Overview u Getting the records onto the disk - mapping u Managing disk space u SQL Modes u Ceating database.

SQL Components DML DDL DAL. Overview u Getting the records onto the disk - mapping u Managing disk space u SQL Modes u Ceating database.
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.
Databases and Processing Modes. Fundamental Data Storage Concepts and Definitions What is an entity? An entity is something about which information is.

Databases and Processing Modes. Fundamental Data Storage Concepts and Definitions What is an entity? An entity is something about which information is.
Chapter 8 - 1 Specification Detailed and precise proposal for a system Provides the technical basis for a contract Typically increases understanding and.

Chapter Specification Detailed and precise proposal for a system Provides the technical basis for a contract Typically increases understanding and.
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.

Similar presentations

Ads by Google