Presentation is loading. Please wait.

Presentation is loading. Please wait.

Physical DB Design The University of California Berkeley Extension Copyright © 2008 Patrick McDermott Salvador Dali (1904-1989) The.

Similar presentations


Presentation on theme: "Physical DB Design The University of California Berkeley Extension Copyright © 2008 Patrick McDermott Salvador Dali (1904-1989) The."— Presentation transcript:

1 Physical DB Design The University of California Berkeley Extension pmcdermott@msn.com Copyright © 2008 Patrick McDermott Salvador Dali (1904-1989) The Ghost of Vermeer of Delft which Can Be Used as a Table 1934

2 SOX Sarbanes-Oxley Act –Basel II Internationally Annual Financial Report –Includes an Internal Control Report Database Integrity Controls –Data Field Integrity Controls –Triggers & Stored Procedures –Audit Trails & Activity Logs Thoroughly Documented Well-Documented Change Procedures

3 CRUD Frequencies Data Volumes Frequency of Use If you can’t do these, your Analysis is incomplete: If you can’t count it, you don’t understand it Critical for performance –Need speed for frequent actions –Don’t want overhead for rare actions

4 Suitable Data Type 1.Represents All Possible Values 2.Improves Data Integrity 3.Supports all Data Manipulations 4.Minimizes Storage Space

5 Data Integrity Default Value –Safest vs. Most Frequent –Prompts –Avoids Errurs Range Control Null Value Referential Integrity

6 Coded Value Save Space Allows Change Internationalization Lookup Table –Referential Integrity with Lookup Table –Lookup & Enter –Hard Code

7 De-Normalize Consider –Frequency of Join vs. –Size of Redundant Fields –It favors some over others One-to-One One Side of Associative Entity Reference Data

8 File Organization Goals 1.Fast Data Retrieval 2.High Throughput 3.Storage Space 4.Protection from Failure or Loss 5.Minimize Re-Organization 6.Accommodate Growth 7.Security from Unauthorized Access

9 File Organization Sequential Indexed Hashed Clustered: Related Manys with their One #FactorSequentialIndexedHashed 1StorageNo Extra StorageSpace for IndexElbow room 2ADDRe-Write fileIndex MaintenanceVery Easy; address overflow problematic 3UPDATEPossibly Re-Write fileIndex MaintenanceVery Easy 4DELETELeaves Hole unless re-writeIndex MaintenanceVery Easy 5Sequential Retrieval Sort on KeyVery FastFastOnly with Hash Index 6Random RetrievalImpracticalFastVery Fast 7Cross-Key RetrievalMust Scan entire FileMutiple Indexes fastOnly with Hash Index


Download ppt "Physical DB Design The University of California Berkeley Extension Copyright © 2008 Patrick McDermott Salvador Dali (1904-1989) The."

Similar presentations


Ads by Google