1. 7.1 © 2002 by Prentice Hall c h a p t e r 7 7 MANAGING DATA DATARESOURCES

2. 7.2 © 2002 by Prentice Hall LEARNING OBJECTIVES COMPARE TRADITIONAL FILE ORGANIZATION & MANAGEMENT TECHNIQUESCOMPARE TRADITIONAL FILE ORGANIZATION & MANAGEMENT TECHNIQUES DESCRIBE HOW DATABASE MANAGEMENT SYSTEM ORGANIZES INFORMATIONDESCRIBE HOW DATABASE MANAGEMENT SYSTEM ORGANIZES INFORMATION* © 2002 by Prentice Hall

3. 7.3 LEARNING OBJECTIVES IDENTIFY TYPES OF DATABASE, PRINCIPLES OF DATABASE DESIGNIDENTIFY TYPES OF DATABASE, PRINCIPLES OF DATABASE DESIGN DISCUSS DATABASE TRENDSDISCUSS DATABASE TRENDS* © 2002 by Prentice Hall

4. 7.4 MANAGEMENT CHALLENGES TRADITIONAL DATA FILE ENVIRONMENTTRADITIONAL DATA FILE ENVIRONMENT DATABASE APPROACH TO DATA MANAGEMENTDATABASE APPROACH TO DATA MANAGEMENT CREATING DATABASE ENVIRONMENTCREATING DATABASE ENVIRONMENT DATABASE TRENDSDATABASE TRENDS*

5. 7.5 © 2002 by Prentice Hall MANAGEMENT CHALLENGES 1. ORGANIZATIONAL OBSTACLES: Challenges existing power structure, requires organizational restructure 2. COST / BENEFIT CONSIDERATIONS: Large initial costs, delayed benefits, tangible, intangible *

6. 7.6 © 2002 by Prentice Hall FILE ORGANIZATION BIT: Binary Digit (0,1; Y,N; On,Off)BIT: Binary Digit (0,1; Y,N; On,Off) BYTE: Combination of BITS which represent a CHARACTERBYTE: Combination of BITS which represent a CHARACTER FIELD: Collection of BYTES which represent a DATUM or FactFIELD: Collection of BYTES which represent a DATUM or Fact RECORD: Collection of FIELDS which reflect a TRANSACTIONRECORD: Collection of FIELDS which reflect a TRANSACTION*

7. 7.7 © 2002 by Prentice Hall FILE ORGANIZATION FILE: A Collection of similar RECORDSFILE: A Collection of similar RECORDS DATABASE: An Organization’s Electronic Library of FILES organized to serve business applicationsDATABASE: An Organization’s Electronic Library of FILES organized to serve business applications*

8. 7.8 © 2002 by Prentice Hall Data Hierarchy

9. 7.9 © 2002 by Prentice Hall FILE ORGANIZATION ENTITY: Person, place, thing, event about which data must be keptENTITY: Person, place, thing, event about which data must be kept ATTRIBUTE: Description of a particular ENTITYATTRIBUTE: Description of a particular ENTITY KEY FIELD: Field used to retrieve, update, sort RECORDKEY FIELD: Field used to retrieve, update, sort RECORD*

10. 7.10 © 2002 by Prentice Hall KEY FIELD Field in Each Record Uniquely Identifies THIS Record For RETRIEVAL UPDATING UPDATINGSORTING*

11. 7.11 © 2002 by Prentice Hall DATA REDUNDANCYDATA REDUNDANCY PROGRAM / DATA DEPENDENCYPROGRAM / DATA DEPENDENCY LACK OF FLEXIBILITYLACK OF FLEXIBILITY POOR SECURITYPOOR SECURITY LACK OF DATA SHARING & AVAILABILITYLACK OF DATA SHARING & AVAILABILITY* PROBLEMS WITH TRADITIONAL FILE ENVIRONMENT Flat File

12. 7.12 © 2002 by Prentice Hall SEQUENTIAL VS. DIRECT FILE ORGANIZATION SEQUENTIAL: Tape oriented; one file follows another; follows physical sequenceSEQUENTIAL: Tape oriented; one file follows another; follows physical sequence DIRECT: Disk oriented; can be accessed without regard to physical sequenceDIRECT: Disk oriented; can be accessed without regard to physical sequence*

13. 7.13 © 2002 by Prentice Hall FILING METHODS INDEXED SEQUENTIAL ACCESS METHOD (ISAM) :INDEXED SEQUENTIAL ACCESS METHOD (ISAM) : –EACH RECORD IDENTIFIED BY KEY –GROUPED IN BLOCKS AND CYLINDERS –KEYS IN INDEX VIRTUAL STORAGE ACCESS METHOD (VSAM) :VIRTUAL STORAGE ACCESS METHOD (VSAM) : –MEMORY DIVIDED INTO AREAS & INTERVALS –DYNAMIC FILE SPACE VSAM WIDELY USED FOR RELATIONAL DATABASES VSAM WIDELY USED FOR RELATIONAL DATABASES DIRECT FILE ACCESS METHODDIRECT FILE ACCESS METHOD*

14. 7.14 © 2002 by Prentice Hall DIRECT FILE ACCESS METHOD EACH RECORD HAS KEY FIELDEACH RECORD HAS KEY FIELD KEY FIELD FED INTO TRANSFORM ALGORITHMKEY FIELD FED INTO TRANSFORM ALGORITHM ALGORITHM GENERATES PHYSICAL STORAGE LOCATION OF RECORD (RECORD ADDRESS)ALGORITHM GENERATES PHYSICAL STORAGE LOCATION OF RECORD (RECORD ADDRESS)*

15. 7.15 © 2002 by Prentice Hall DATABASE MANAGEMENT SYSTEM (DBMS) SOFTWARE TO CREATE & MAINTAIN DATA ENABLES BUSINESS APPLICATIONS TO EXTRACT DATA ENABLES BUSINESS APPLICATIONS TO EXTRACT DATA INDEPENDENT OF SPECIFIC COMPUTER PROGRAMS INDEPENDENT OF SPECIFIC COMPUTER PROGRAMS* DBMS

16. 7.16 © 2002 by Prentice Hall COMPONENTS OF DBMS: DATA DEFINITION LANGUAGE:DATA DEFINITION LANGUAGE: –Defines data elements in database DATA MANIPULATION LANGUAGE:DATA MANIPULATION LANGUAGE: –Manipulates data for applications DATA DICTIONARY:DATA DICTIONARY: –Formal definitions of all variables in database, controls variety of database contents, data elements * DBMS

17. 7.17 © 2002 by Prentice Hall Compare Traditional File Environment to …..

18. 7.18 © 2002 by Prentice Hall …A Database Management System

19. 7.19 © 2002 by Prentice Hall STRUCTURED QUERY LANGUAGE (SQL) EMERGING STANDARD DATA MANIPULATION LANGUAGE FOR RELATIONAL DATABASES * DBMS

20. 7.20 © 2002 by Prentice Hall ELEMENTS OF SQL SELECT: List of columns from tables desiredSELECT: List of columns from tables desired FROM: Identifies tables from which columns will be selectedFROM: Identifies tables from which columns will be selected WHERE: Includes conditions for selecting specific rows, conditions for joining multiple tablesWHERE: Includes conditions for selecting specific rows, conditions for joining multiple tables* DBMS

21. 7.21 © 2002 by Prentice Hall TWO VIEWS OF DATA PHYSICAL VIEW: Where is data physically?PHYSICAL VIEW: Where is data physically? –DRIVE, DISK, SURFACE, TRACK, SECTOR (BLOCK), RECORD –TAPE, BLOCK, RECORD NUMBER (KEY) LOGICAL VIEW: What data is needed by application?LOGICAL VIEW: What data is needed by application? –SUCCESSION OF FACTS NEEDED BY APPLICATION –NAME, TYPE, LENGTH OF FIELD * DBMS

22. 7.22 © 2002 by Prentice Hall RELATIONAL DATA MODEL DATA IN TABLE FORMATDATA IN TABLE FORMAT RELATION: TABLERELATION: TABLE TUPLE: ROW (RECORD) IN TABLETUPLE: ROW (RECORD) IN TABLE FIELD: COLUMN (ATTRIBUTE) IN TABLEFIELD: COLUMN (ATTRIBUTE) IN TABLE*

23. 7.23 © 2002 by Prentice Hall TYPES OR RELATIONS ONE-TO-ONE: STUDENT ID ONE-TO-MANY: CLASS STUDENT A STUDENT B STUDENT C MANY-TO-MANY: STUDENT A STUDENT B STUDENT C CLASS 1 CLASS 2

24. 7.24 © 2002 by Prentice Hall ROOT FIRST CHILD 2nd CHILD RatingsSalary Compensation Job Assignments PensionInsuranceHealth Benefits Employer HIERARCHICAL DATA MODEL

25. 7.25 © 2002 by Prentice Hall NETWORK DATA MODEL VARIATION OF HIERARCHICAL MODELVARIATION OF HIERARCHICAL MODEL USEFUL FOR MANY-TO-MANY RELATIONSHIPSUSEFUL FOR MANY-TO-MANY RELATIONSHIPS* NETWORK A NETWORK B NETWORK C NETWORK 1 NETWORK 2

26. 7.26 © 2002 by Prentice Hall OTHER SYSTEMS LEGACY SYSTEM: older systemLEGACY SYSTEM: older system OBJECT - ORIENTED DBMS: stores data & procedures as objectsOBJECT - ORIENTED DBMS: stores data & procedures as objects OBJECT - RELATIONAL DBMS: hybridOBJECT - RELATIONAL DBMS: hybrid*

27. 7.27 © 2002 by Prentice Hall CREATING A DATABASE CONCEPTUAL DESIGNCONCEPTUAL DESIGN PHYSICAL DESIGNPHYSICAL DESIGN*

28. 7.28 © 2002 by Prentice Hall CREATING A DATABASE CONCEPTUAL DESIGN: ABSTRACT MODEL, BUSINESS PERSPECTIVEABSTRACT MODEL, BUSINESS PERSPECTIVE HOW WILL DATA BE GROUPED?HOW WILL DATA BE GROUPED? RELATIONSHIPS AMONG ELEMENTSRELATIONSHIPS AMONG ELEMENTS ESTABLISH END-USER NEEDSESTABLISH END-USER NEEDS*

29. 7.29 © 2002 by Prentice Hall DETAILED MODEL BY DATABASE SPECIALISTSDETAILED MODEL BY DATABASE SPECIALISTS ENTITY-RELATIONSHIP DIAGRAMENTITY-RELATIONSHIP DIAGRAM NORMALIZATIONNORMALIZATION HARDWARE / SOFTWARE SPECIFICHARDWARE / SOFTWARE SPECIFIC* CREATING A DATABASE PHYSICAL DESIGN:

30. 7.30 © 2002 by Prentice Hall ELEMENTS OF DATABASE ENVIRONMENT DATABASE MANAGEMENT SYSTEM DATA ADMINISTRATION DATABASE TECHNO LOGY & MANAGEMENT USERS DATA PLANNING & MODELING METHODOLOGY

31. 7.31 © 2002 by Prentice Hall ENTITY- RELATIONSHIP DIAGRAM 1 1 M 1 ORDER CAN HAVE PART SUPPLIER CAN HAVE ORDER: #, DATE, PART #, QUANTITY PART: #, DESCRIPTION, UNIT PRICE, SUPPLIER # SUPPLIER: #, NAME, ADDRESS

32. 7.32 © 2002 by Prentice Hall NORMALIZATION PROCESS OF CREATING SMALL DATA STRUCTURES FROM COMPLEX GROUPS OF DATA EXAMPLES: ACCOUNTS RECEIVABLEACCOUNTS RECEIVABLE PERSONNEL RECORDSPERSONNEL RECORDS PAYROLLPAYROLL*

33. 7.33 © 2002 by Prentice Hall DISTRIBUTED DATABASES PARTITIONED: remote CPUs (connected to host) have files unique to that site, e.g., records on local customersPARTITIONED: remote CPUs (connected to host) have files unique to that site, e.g., records on local customers DUPLICATE: each remote CPU has copies of common files, e.g., layouts for standard reports and formsDUPLICATE: each remote CPU has copies of common files, e.g., layouts for standard reports and forms*

34. 7.34 © 2002 by Prentice Hall Partitioned and Duplicated Databases

35. 7.35 © 2002 by Prentice Hall DATABASE ADMINISTRATION DEFINES & ORGANIZES DATABASE STRUCTURE AND CONTENTDEFINES & ORGANIZES DATABASE STRUCTURE AND CONTENT DEVELOPS SECURITY PROCEDURESDEVELOPS SECURITY PROCEDURES DEVELOPS DATABASE DOCUMENTATIONDEVELOPS DATABASE DOCUMENTATION MAINTAINS DBMSMAINTAINS DBMS*

36. 7.36 © 2002 by Prentice Hall DATABASE TRENDS MULTIDIMENSIONAL DATA ANALYSIS: 3D (or higher) groupings to store complex dataMULTIDIMENSIONAL DATA ANALYSIS: 3D (or higher) groupings to store complex data HYPERMEDIA: Nodes contain text, graphics, sound, video, programs. organizes data as nodes.HYPERMEDIA: Nodes contain text, graphics, sound, video, programs. organizes data as nodes.*

37. 7.37 © 2002 by Prentice Hall Hypermedia Database - Nodes Connected by Hypermedia Links

38. 7.38 © 2002 by Prentice Hall DATABASE TRENDS DATA WAREHOUSE: Organization’s electronic library stores consolidated current & historic data for management reporting & analysisDATA WAREHOUSE: Organization’s electronic library stores consolidated current & historic data for management reporting & analysis ON-LINE ANALYTICAL PROCESSING (OLAP): Tools for multi- dimensional data analysisON-LINE ANALYTICAL PROCESSING (OLAP): Tools for multi- dimensional data analysis*

39. 7.39 © 2002 by Prentice Hall COMPONENTS OF DATA WAREHOUSE

40. 7.40 © 2002 by Prentice Hall Online Analytic Processing

41. 7.41 © 2002 by Prentice Hall DATABASE TRENDS DATA MART: Small data warehouse for special function, e.g., Focused marketing based on customer infoDATA MART: Small data warehouse for special function, e.g., Focused marketing based on customer info DATAMINING: Tools for finding hidden patterns, relation- ships, for predicting trendsDATAMINING: Tools for finding hidden patterns, relation- ships, for predicting trends*

42. 7.42 © 2002 by Prentice Hall

43. 7.43 DATABASE TRENDS LINKING DATABASES TO THE WEB: WEB USER CONNECTS TO VENDOR DATABASEWEB USER CONNECTS TO VENDOR DATABASE SPECIAL SOFTWARE CONVERTS HTML TO SQLSPECIAL SOFTWARE CONVERTS HTML TO SQL SQL FINDS DATA, SERVER CONVERTS RESULT TO HTMLSQL FINDS DATA, SERVER CONVERTS RESULT TO HTML*

44. 7.44 © 2002 by Prentice Hall Web-enabled Databases

45. 7.45 © 2002 by Prentice Hall c h a p t e r 7 7 MANAGING DATA DATARESOURCES