2011-09-22 SLIDE 1IS 257 – Fall 2011 Referential Integrity and Database Design Recap: From Conceptual Design to Physical Relational Implementation University.

2011-09-22 SLIDE 1IS 257 – Fall 2011 Referential Integrity and Database Design Recap: From Conceptual Design to Physical Relational Implementation University of California, Berkeley School of Information IS 257: Database Management

2011-09-22 SLIDE 2IS 257 – Fall 2011 Lecture Outline Review –Physical Database Design –Access Methods –Indexes and What to index –Parallel storage systems (RAID) Integrity constraints Database Design Process Recap

2011-09-22 SLIDE 4IS 257 – Fall 2011 Database Design Process Conceptual Model Logical Model External Model Conceptual requirements Conceptual requirements Conceptual requirements Conceptual requirements Application 1 Application 2Application 3Application 4 Application 2 Application 3 Application 4 External Model External Model External Model Internal Model Physical Design

2011-09-22 SLIDE 5IS 257 – Fall 2011 Physical Database Design The primary goal of physical database design is data processing efficiency We will concentrate on choices often available to optimize performance of database services Physical Database Design requires information gathered during earlier stages of the design process

2011-09-22 SLIDE 6IS 257 – Fall 2011 Physical Design Decisions There are several critical decisions that will affect the integrity and performance of the system. –Storage Format –Physical record composition –Data arrangement –Indexes –Query optimization and performance tuning

2011-09-22 SLIDE 7IS 257 – Fall 2011 Objectives of data type selection Minimize storage space Represent all possible values Improve data integrity Support all data manipulations The correct data type should, in minimal space, represent every possible value (but eliminated illegal values) for the associated attribute and can support the required data manipulations (e.g. numerical or string operations)

2011-09-22 SLIDE 9IS 257 – Fall 2011 Internal Model Access Methods Many types of access methods: –Physical Sequential –Indexed Sequential –Indexed Random –Inverted –Direct –Hashed Differences in –Access Efficiency –Storage Efficiency

2011-09-22 SLIDE 10IS 257 – Fall 2011 Physical Sequential Key values of the physical records are in logical sequence Main use is for “dump” and “restore” Access method may be used for storage as well as retrieval Storage Efficiency is near 100% Access Efficiency is poor (unless fixed size physical records)

2011-09-22 SLIDE 11IS 257 – Fall 2011 Index Sequential Data File Block 1 Block 2 Block 3 Address Block Number 123…123… Actual Value Dumpling Harty Texaci... Adams Becker Dumpling Getta Harty Mobile Sunoci Texaci

2011-09-22 SLIDE 12IS 257 – Fall 2011 Indexed Sequential: Two Levels Address 789…789… Key Value 385 678 805 001 003. 150 705 710. 785 251. 385 455 480. 536 605 610. 678 791. 805 Address 1212 Key Value 150 385 Address 3434 Key Value 536 678 Address 5656 Key Value 785 805

2011-09-22 SLIDE 13IS 257 – Fall 2011 Indexed Random Address Block Number 2132121321 Actual Value Adams Becker Dumpling Getta Harty Becker Harty Adams Getta Dumpling

2011-09-22 SLIDE 14IS 257 – Fall 2011 Btree F | | P | | Z | R | | S | | Z |H | | L | | P |B | | D | | F | Devils Aces Boilers Cars Minors Panthers Seminoles Flyers Hawkeyes Hoosiers

2011-09-22 SLIDE 15IS 257 – Fall 2011 Inverted Address Block Number 123…123… Actual Value CH 145 CS 201 CS 623 PH 345 CH 145 101, 103,104 CS 201 102 CS 623 105, 106 Adams Becker Dumpling Getta Harty Mobile Student name Course Number CH145 cs201 ch145 cs623

2011-09-22 SLIDE 16IS 257 – Fall 2011 Direct Key values of the physical records are not necessarily in logical sequence There is a one-to-one correspondence between a record key and the physical address of the record May be used for storage and retrieval Access efficiency always 1 Storage efficiency depends on density of keys No duplicate keys permitted

2011-09-22 SLIDE 17IS 257 – Fall 2011 Hashing Key values of the physical records are not necessarily in logical sequence Many key values may share the same physical address (block) May be used for storage and retrieval Access efficiency depends on distribution of keys, algorithm for key transformation and space allocated Storage efficiency depends on distibution of keys and algorithm used for key transformation

2011-09-22 SLIDE 18IS 257 – Fall 2011 Comparative Access Methods Indexed No wasted space for data but extra space for index Moderately Fast Very fast with multiple indexes OK if dynamic OK if dynamic Easy but requires Maintenance of indexes Factor Storage space Sequential retrieval on primary key Random Retr. Multiple Key Retr. Deleting records Adding records Updating records Sequential No wasted space Very fast Impractical Possible but needs a full scan can create wasted space requires rewriting file usually requires rewriting file Hashed more space needed for addition and deletion of records after initial load Impractical Very fast Not possible very easy

2011-09-22 SLIDE 19IS 257 – Fall 2011 Late addition – Bitmap index Uses a single bit to represent whether or not a particular record has a specific value

2011-09-22 SLIDE 21IS 257 – Fall 2011 Indexes Most database applications require: –locating rows in tables that match some condition (e.g. SELECT operations) –Joining one table with another based on common values of attributes in each table Indexes can greatly speed up these processes and avoid having to do sequential scanning of database tables to resolve queries

2011-09-22 SLIDE 22IS 257 – Fall 2011 Primary Key Indexes In Access -- this will be created automatically when a field is selected as primary key –in the table design view select an attribute row (or rows) and clock on the key symbol in the toolbar. –The index is created automatically as one with (No Duplicates) In SQL –CREATE UNIQUE INDEX indexname ON tablename(attribute);

2011-09-22 SLIDE 23IS 257 – Fall 2011 Secondary Key Indexes In Access -- Secondary key indexes can be created on any field. –In the table design view, select the attribute to be indexed –In the “Indexed” box on the General field description information at the bottom of the window, select “Yes (Duplicates OK)” In SQL –CREATE INDEX indxname on tablename(attribute);

2011-09-22 SLIDE 24IS 257 – Fall 2011 When to Index Tradeoff between time and space: –Indexes permit faster processing for searching –But they take up space for the index –They also slow processing for insertions, deletions, and updates, because both the table and the index must be modified Thus they SHOULD be used for databases where search is the main mode of interaction The might be skipped if high rates of updating and insertions are expected, and access or operations are rare

2011-09-22 SLIDE 25IS 257 – Fall 2011 When to Use Indexes Rules of thumb –Indexes are most useful on larger tables –Specify a unique index for the primary key of each table (automatically done for many DBMS) –Indexes are most useful for attributes used as search criteria or for joining tables –Indexes are useful if sorting is often done on the attribute –Most useful when there are many different values for an attribute –Some DBMS limit the number of indexes and the size of the index key values –Some indexes will not retrieve NULL values

2011-09-22 SLIDE 27IS 257 – Fall 2011 Parallel Processing with RAID In reading pages from secondary storage, there are often situations where the DBMS must retrieve multiple pages of data from storage -- and may often encounter –rotational delay –seek positioning delay in getting each page from the disk

2011-09-22 SLIDE 28IS 257 – Fall 2011 Disk Timing (and Problems) Rotational Delay Read Head fingerprint Hair Seek Positioning Delay

2011-09-22 SLIDE 29IS 257 – Fall 2011 RAID Provides parallel disks (and software) so that multiple pages can be retrieved simultaneously RAID stands for “Redundant Arrays of Inexpensive Disks” –invented by Randy Katz and Dave Patterson here at Berkeley Some manufacturers have renamed the “inexpensive” part (for obvious reasons)

2011-09-22 SLIDE 30IS 257 – Fall 2011 RAID Technology Parallel Writes Disk 2Disk 3Disk 4Disk 1 1 2 3 4 5 6 7 8 9 10 11 12 * * Parallel Reads Stripe One logical disk drive

2011-09-22 SLIDE 31IS 257 – Fall 2011 Raid 0 Parallel Writes Disk 2Disk 3Disk 4Disk 1 1 2 3 4 5 6 7 8 9 10 11 12 * * Parallel Reads Stripe One logical disk drive

2011-09-22 SLIDE 32IS 257 – Fall 2011 RAID-1 Parallel Writes Disk 2Disk 3Disk 4Disk 1 1 1 2 2 3 3 4 4 5 5 6 6 * * Parallel Reads Stripe Raid 1 provides full redundancy for any data stored

2011-09-22 SLIDE 33IS 257 – Fall 2011 RAID-2 Writes span all drives Disk 2Disk 3Disk 4Disk 1 1a 1b ecc ecc 2a 2b ecc ecc 3a 3b ecc ecc * * Reads span all drives Stripe Raid 2 divides blocks across multiple disks with error correcting codes

2011-09-22 SLIDE 34IS 257 – Fall 2011 RAID-3 Writes span all drives Disk 2Disk 3Disk 4Disk 1 1a 1b 1c ecc 2a 2b 2c ecc 3a 3b 3c ecc * * Reads span all drives Stripe Raid 3 divides very long blocks across multiple disks with a single drive for ECC

2011-09-22 SLIDE 35IS 257 – Fall 2011 Raid-4 Disk 2Disk 3Disk 4Disk 1 1 2 3 ecc 4 5 6 ecc 7 8 9 ecc * * Stripe Parallel Writes Parallel Reads Raid 4 like Raid 3 for smaller blocks with multiple blocks per stripe

2011-09-22 SLIDE 36IS 257 – Fall 2011 RAID-5 Parallel Writes Disk 2Disk 3Disk 4Disk 1 1 2 3 4 5 6 7 8 9 10 11 12 ecc ecc * * Parallel Reads Stripe Raid 5 divides blocks across multiple disks with error correcting codes

2011-09-22 SLIDE 37IS 257 – Fall 2011 RAID for DBMS What works best for Database storage? RAID-1 is best when 24/7 fault tolerant processing is needed RAID-5 is best for read-intensive applications with very large data sets

2011-09-22 SLIDE 39IS 257 – Fall 2011 Integrity Constraints The constraints we wish to impose in order to protect the database from becoming inconsistent. Five types –Required data –attribute domain constraints –entity integrity –referential integrity –enterprise constraints

2011-09-22 SLIDE 40IS 257 – Fall 2011 Required Data Some attributes must always contain a value -- they cannot have a null For example: – Every employee must have a job title. –Every diveshop diveitem must have an order number and an item number.

2011-09-22 SLIDE 41IS 257 – Fall 2011 Attribute Domain Constraints Every attribute has a domain, that is a set of values that are legal for it to use. For example: –The domain of sex in the employee relation is “M” or “F” Domain ranges can be used to validate input to the database.

2011-09-22 SLIDE 42IS 257 – Fall 2011 Entity Integrity The primary key of any entity cannot be NULL.

2011-09-22 SLIDE 43IS 257 – Fall 2011 Referential Integrity A “foreign key” links each occurrence in a relation representing a child entity to the occurrence of the parent entity containing the matching candidate key Referential Integrity means that if the foreign key contains a value, that value must refer to an existing occurrence in the parent entity For example: –Since the Order ID in the diveitem relation refers to a particular diveords item, that item must exist for referential integrity to be satisfied

2011-09-22 SLIDE 44IS 257 – Fall 2011 Referential Integrity Referential integrity options are declared when tables are defined (in most systems) There are many issues having to do with how particular referential integrity constraints are to be implemented to deal with insertions and deletions of data from the parent and child tables.

2011-09-22 SLIDE 45IS 257 – Fall 2011 Insertion rules A row should not be inserted in the referencing (child) table unless there already exists a matching entry in the referenced table. Inserting into the parent table should not cause referential integrity problems –Unless it is itself a child… Sometimes a special NULL value may be used to create child entries without a parent or with a “dummy” parent.

2011-09-22 SLIDE 46IS 257 – Fall 2011 Deletion rules A row should not be deleted from the referenced table (parent) if there are matching rows in the referencing table (child). Three ways to handle this –Restrict -- disallow the delete –Nullify -- reset the foreign keys in the child to some NULL or dummy value –Cascade -- Delete all rows in the child where there is a foreign key matching the key in the parent row being deleted

2011-09-22 SLIDE 47IS 257 – Fall 2011 Referential Integrity This can be implemented using external programs that access the database newer databases implement executable rules or built-in integrity constraints (e.g. Access)

2011-09-22 SLIDE 48IS 257 – Fall 2011 Enterprise Constraints These are business rule that may affect the database and the data in it –for example, if a manager is only permitted to manage 10 employees then it would violate an enterprise constraint to manage more

2011-09-22 SLIDE 49IS 257 – Fall 2011 Outline Review –Physical Database Design –Access Methods –Indexes and What to index –Parallel storage systems (RAID) Integrity constraints Database Design Process Recap

2011-09-22 SLIDE 50IS 257 – Fall 2011 Database Design Process Conceptual Model Logical Model External Model Conceptual requirements Conceptual requirements Conceptual requirements Conceptual requirements Application 1 Application 2Application 3Application 4 Application 2 Application 3 Application 4 External Model External Model External Model Internal Model

2011-09-22 SLIDE 51IS 257 – Fall 2011 Today: New Design Today we will build the COOKIE database from (rough) needs assessment through the conceptual model, logical model and finally physical implementation in Access.

2011-09-22 SLIDE 52IS 257 – Fall 2011 Cookie Requirements Cookie is a bibliographic database that contains information about a hypothetical union catalog of several libraries. Need to record which books are held by which libraries Need to search on bibliographic information –Author, title, subject, call number for a given library, etc. Need to know who publishes the books for ordering, etc.

2011-09-22 SLIDE 53IS 257 – Fall 2011 Cookie Database There are currently 6 main types of entities in the database –Authors (Authors) Note: we created authors from the former design when talking about normalization (two weeks ago) –Books (bibfile) –Local Call numbers (callfile) –Libraries (libfile) –Publishers (pubfile) –Subject headings (subfile) –Additional entities Links between subject and books (indxfile) Links between authors and books (AU_BIB)

2011-09-22 SLIDE 54IS 257 – Fall 2011 AUTHORS Author -- The author’s name (We do not distinguish between Personal and Corporate authors) Au_id – a unique id for the author

2011-09-22 SLIDE 55IS 257 – Fall 2011 AUTHORS Authors Author AU ID

2011-09-22 SLIDE 56IS 257 – Fall 2011 BIBFILE Books (BIBFILE) contains information about particular books. It includes one record for each book. The attributes are: –accno -- an “accession” or serial number –title -- The title of the book –loc -- Location of publication (where published) –date -- Date of publication –price -- Price of the book –pagination -- Number of pages –ill -- What type of illustrations (maps, etc) if any –height -- Height of the book in centimeters

2011-09-22 SLIDE 57IS 257 – Fall 2011 Books/BIBFILE Books accno Title Loc Date Price Pagination Height Ill

2011-09-22 SLIDE 58IS 257 – Fall 2011 CALLFILE CALLFILE contains call numbers and holdings information linking particular books with particular libraries. Its attributes are: –accno -- the book accession number –libid -- the id of the holding library –callno -- the call number of the book in the particular library –copies -- the number of copies held by the particular library

2011-09-22 SLIDE 59IS 257 – Fall 2011 LocalInfo/CALLFILE CALLFILE Copies accno libid Callno

2011-09-22 SLIDE 60IS 257 – Fall 2011 LIBFILE LIBFILE contain information about the libraries participating in this union catalog. Its attributes include: –libid -- Library id number –library -- Name of the library –laddress -- Street address for the library –lcity -- City name –lstate -- State code (postal abbreviation) –lzip -- zip code –lphone -- Phone number –mop - suncl -- Library opening and closing times for each day of the week.

2011-09-22 SLIDE 61IS 257 – Fall 2011 Libraries/LIBFILE LIBFILE Libid SatCl SatOp FCl FOp ThCl ThOpWClWOpTuClTuOp Mcl MOp Suncl SunOp lphone lzip lstatelcity laddress Library

2011-09-22 SLIDE 62IS 257 – Fall 2011 PUBFILE PUBFILE contain information about the publishers of books. Its attributes include –pubid -- The publisher’s id number –publisher -- Publisher name –paddress -- Publisher street address –pcity -- Publisher city –pstate -- Publisher state –pzip -- Publisher zip code –pphone -- Publisher phone number –ship -- standard shipping time in days

2011-09-22 SLIDE 63IS 257 – Fall 2011 Publisher/PUBFILE PUBFILE pubid Ship Publisher pphone pzip pstate pcity paddress

2011-09-22 SLIDE 64IS 257 – Fall 2011 SUBFILE SUBFILE contains each unique subject heading that can be assigned to books. Its attributes are –subcode -- Subject identification number –subject -- the subject heading/description

2011-09-22 SLIDE 65IS 257 – Fall 2011 Subjects/SUBFILE SUBFILE Subject subid

2011-09-22 SLIDE 66IS 257 – Fall 2011 INDXFILE INDXFILE provides a way to allow many- to-many mapping of subject headings to books. Its attributes consist entirely of links to other tables –subcode -- link to subject id –accno -- link to book accession number

2011-09-22 SLIDE 67IS 257 – Fall 2011 Linking Subjects and Books INDXFILE ACCNO subid

2011-09-22 SLIDE 68IS 257 – Fall 2011 AU_BIB AU_BIB provides a way to allow many to many mapping between books and authors. It also consists only of links to other tables –AU_ID – link to the AUTHORS table –ACCNO – link to the BIBFILE table

2011-09-22 SLIDE 69IS 257 – Fall 2011 Linking Authors and Books AU_BIB ACCNO AU ID

2011-09-22 SLIDE 70IS 257 – Fall 2011 Some examples of Cookie Searches Who wrote Microcosmographia Academica? How many pages long is Alfred Whitehead’s The Aims of Education and Other Essays? Which branches in Berkeley’s public library system are open on Sunday? What is the call number of Moffitt Library’s copy of Abraham Flexner’s book Universities: American, English, German? What books on the subject of higher education are among the holdings of Berkeley (both UC and City) libraries? Print a list of the Mechanics Library holdings, in descending order by height. What would it cost to replace every copy of each book that contains illustrations (including graphs, maps, portraits, etc.)? Which library closes earliest on Friday night?

2011-09-22 SLIDE 71IS 257 – Fall 2011 Cookie ER Diagram AU_ID BIBFILE pubid LIBFILE INDXFILE accno SUBFILE libid CALLFILE pubid PUBFILE subcodeaccnosubcode libid accno AUTHORS AU_BIB accno AU ID Author Note: diagram contains only attributes used for linking

2011-09-22 SLIDE 72IS 257 – Fall 2011 What Problems? What sorts of problems and missing features arise given the previous ER diagram?

2011-09-22 SLIDE 73IS 257 – Fall 2011 Problems Identified Subtitles, parallel titles? Edition information Series information lending status material type designation Genre, class information Better codes (ISBN?) Missing information (ISBN) Authority control for authors Missing/incomplete data Data entry problems Ordering information Illustrations Subfield separation (such as last_name, first_name) Separate personal and corporate authors

2011-09-22 SLIDE 74IS 257 – Fall 2011 Problems (Cont.) Location field inconsistent No notes field No language field Zipcode doesn’t support plus-4 No publisher shipping addresses No (indexable) keyword search capability No support for multivolume works No support for URLs –to online version –to libraries –to publishers

2011-09-22 SLIDE 75IS 257 – Fall 2011 Original Cookie ER Diagram AU_ID BIBFILE pubid LIBFILE INDXFILE accno SUBFILE libid CALLFILE pubid PUBFILE subcodeaccnosubcode libid accno AUTHORS AU_BIB accno AU ID Author Note: diagram contains only attributes used for linking

2011-09-22 SLIDE 76IS 257 – Fall 2011 BIBFILE pubid LIBFILE INDXFILE accno SUBFILE libid CALLFILE pubid PUBFILE subcodeaccnosubcode libid accno Cookie2: Separate Name Authorities nameid AUTHFILE AUTHBIB authtype accno authid nameauthid

2011-09-22 SLIDE 77IS 257 – Fall 2011 Cookie 3: Keywords BIBFILE pubid LIBFILE INDXFILE accno SUBFILE libid CALLFILE pubid PUBFILE subcodeaccnosubcode libid accno KEYMAP TERMS accnotermid nameid AUTHFILE AUTHBIB authtype accno authid nameauthid

2011-09-22 SLIDE 78IS 257 – Fall 2011 Cookie 4: Series SERIES seriesid ser_title BIBFILE pubid LIBFILE INDXFILE accno SUBFILE libid CALLFILE pubid PUBFILE subcodeaccnosubcode libid accno KEYMAP TERMS accnotermid nameid AUTHFILE AUTHBIB authtype accno authid nameauthid

2011-09-22 SLIDE 79IS 257 – Fall 2011 Cookie 5: Circulation circid CIRC circidcopynumpatronid PATRON seriesid BIBFILE pubid LIBFILE INDXFILE accno SUBFILE libid CALLFILE pubid PUBFILE subcodeaccnosubcode libidaccno KEYMAP TERMS accnotermid SERIES seriesid ser_title nameid AUTHFILE AUTHBIB authtype accno authid nameauthid

2011-09-22 SLIDE 80IS 257 – Fall 2011 Logical Model: Mapping to Relations Take each entity –Authors –BIBFILE –LIBFILE –CALLFILE –SUBFILE –PUBFILE –INDXFILE –AU_BIB And make it a table...

2011-09-22 SLIDE 81IS 257 – Fall 2011 Implementing the Physical Database... For each of the entities, we will build a table… Loading data Entering data Data entry forms

2011-09-22 SLIDE 82IS 257 – Fall 2011 Database Creation in phpMyAdmin Select database (not a table) Click Operations tab, –Enter table name and number of fields (attributes) –then click Go Fill in form for each attribute Helps to know what the primary key is, or if one is to be created automatically –Automatic creation is more complex in other RDBMS and ORDBMS Need to make decision about the physical storage of the data (data types, etc)

2011-09-22 SLIDE 83IS 257 – Fall 2011 Next Week I will be away Attend the I242 XML Foundations course from 9-10:30 in 205 SH

2011-09-22 SLIDE 1IS 257 – Fall 2011 Referential Integrity and Database Design Recap: From Conceptual Design to Physical Relational Implementation University.

Similar presentations

Presentation on theme: "2011-09-22 SLIDE 1IS 257 – Fall 2011 Referential Integrity and Database Design Recap: From Conceptual Design to Physical Relational Implementation University."— Presentation transcript:

Similar presentations

About project

Feedback

Log in

Auth with social network:

2011-09-22 SLIDE 1IS 257 – Fall 2011 Referential Integrity and Database Design Recap: From Conceptual Design to Physical Relational Implementation University.

Similar presentations

Presentation on theme: "2011-09-22 SLIDE 1IS 257 – Fall 2011 Referential Integrity and Database Design Recap: From Conceptual Design to Physical Relational Implementation University."— Presentation transcript:

Similar presentations

About project

Feedback