Presentation is loading. Please wait.

Presentation is loading. Please wait.

Chapter 12 File Processing and Data Management Concepts.

Similar presentations


Presentation on theme: "Chapter 12 File Processing and Data Management Concepts."— Presentation transcript:

1

2 Chapter 12 File Processing and Data Management Concepts

3 Presentation Outline I.Terminology II.Database Technology III.The Architecture of a Database Management System (DBMS) IV.The Database Administrator

4 I. Terminology A.Field B.Data Occurrences C.Fixed vs. Variable Length Records D.Record Key E.Sort Keys

5 A. Field A field is the smallest block of data that will be stored and retrieved in the information system. Other names for field include data item, attribute, or element. Field 1Field 2

6 B. Data Occurrences A specific set of data values for a record in a file The above table contains 5 occurrences of account records for the general ledger account file.

7 C. Fixed vs. Variable Length Records Fixed Length Records  Both the number of fields and the length of each field are fixed.  Strength: Easier to manipulate records.  Weakness: Must accommodate maximum sizes. Variable Length Records  Both the number of fields and the length of each field are variable. (See Fig on p. 603)  Strength: Less waste of memory when maximum sizes do not have to be accomodated.  Weakness: Record manipulation is more difficult.

8 D. Record Key A record key is a field or combination of fields that uniquely identifies a particular record in a file

9 E. Sort Keys  Primary sort key – The first field used to sort the data occurrences in a record set.  Secondary sort key – A field used to determine relative position among a set of data occurrences in a record set.  Tertiary sort key – Additional fields beyond primary and secondary sort keys that are required to uniquely identify data occurrences in a record set. Last NameFirst NameAge AdamsTom25 JonesAlisa36 JonesJulie19 JonesJulie21 YoungSam22

10 II. Database Technology A.The Problem of Redundancy B.The Components of a Database

11 A. The Problem of Redundancy  Redundancy occurs when different areas of an organization use the information system to store the same information in more than one place.  Results in update anomaly. That is not what we show per our records.

12 B. The Components of a Database Management System 1.Data Description Language (DDL) 2.Data Manipulation Language (DML) 3.Data Query Language (DQL)

13 1. Data Description Language (DDL) Defines the logical structure of the database (known as the schema). Defines the following:  Name of data fields.  Type of data (numeric, alphabetic, etc.)  Number of positions (length of field).  May also define subschema (i.e., individual user views)

14 2. Data Manipulation Language (DML)  The DML consists of the commands for updating, editing, manipulating, and extracting data.  Structured query language (SQL) is a common DML in relational settings. Pull a trial balance. Structure Query Language (SQL)

15 3. Data Query Language A data query language is a user friendly language or interface that allows the user to request information by simply filling in blanks. Represents a special type of DML. Query by Example (QBE)

16 III. The Architecture of a Database Management System (DBMS) A.The Database Architecture B.The Conceptual Architecture and Entity- Relationship (ER) Diagrams C.Logical Data Structures D.The Physical Structure

17 A. The Database Architecture Conceptual Level Database contents Uses of database Desired reports Information to be viewed Logical Level Logical data structures: Tree Network Relational Physical Level Access Methods: Sequential Access Indexed Files

18 B. The Conceptual Architecture and Entity- Relationship (ER) Diagrams  Square boxes are used for entities (separate tables).  Ellipses are used for attributes (table columns).  Diamond shaped boxes depict relationships. PART PART_NONAME COST STORED AT LOCATION WHSEADDRESS

19 C. Logical Data Structures 1.Tree or Hierarchical Structure 2.Network Structures 3.Relational Structure a.Selection b.Projection c.Join

20 1. Tree or Hierarchical Structure A parent record can have many children. However a child record can have only one parent. Can only model 1:1 (one-to-one) and 1:* (one-to-many) relationships. Commonly used with accounting data. Can only access data by going from a parent to child. Balance Sheet Assets Liabilities Equity Current Assets Long-term Assets Current Liabilities Long-term Liabilities Revenues Expenses

21 2. Network Structure Eliminates the distinction of parent and child records. A parent can have many children and a child can have many parents. Can model 1:1 (one-to-one), 1:* (one-to-many), and *:* (many-to-many) relationships. Must know the physical structure of the data in order to access it.

22 3. Relational Structure  Relational databases organize and store data in two dimensional tables consisting of rows and columns.  Relationships among tables are represented by common data values in different tables.  Straight forward in terms of organizing and searching the data.  Possesses ad hoc search capabilities.

23 3a. Selection Produces a horizontal subset (includes entire row) of a relation which satisfies a boolean predicate. NameAcct #Balance John Bill Mary Joe Balance < 5.00 (Savings) Savings Table NameAcct #Balance Bill Joe

24 3b. Projection Constructs a vertical subset of a relation. The subset is obtained by selecting specified attributes and removing others. NameAcct #Balance John Bill Mary Joe Balance < 5.00 (Savings) Savings Table Name Bill Joe Name

25 3c. Join A join is used to combine 2 tables. The attribute used to join must be in both tables. ABC a1b1c1 a2b2c2 a2b2c3 a4b2c2 Table R CDE c2d1e1 c3d2e3 c2d1e2 Table S ABCDE a2b2c2d1e1 a2b2c2d1e2 a2b2c3d2e3 a4b2c2d1e1 a4b2c2d1e2 R |X| S

26 D. The Physical Structure 1.Sequential Access 2.Indexed Files

27 1. Sequential Access  Records can only be accessed in a predefined sequence. For example, if there are 100 records in a file, one must access the first 99 records before accessing the last record.  Generally useful for batch processing when nearly all records must be accessed.

28 2. Indexed Files  Any attribute can be extracted from the records in a primary file and used to build a new file whose purpose is to provide an index to the original file.  First, the index is searched to find a specified value of an attribute such as an customer account number.  Second, the disk addresses are used to directly retrieve the desired records  See Fig on p. 427.

29 IV. The Database Administrator The database administrator is a person who coordinates data management activities such as approving the physical contents and user views of the database. This is not quite what we need.

30 Summary  Fields and keys  Three Components of a DBMS  Three Types of Database Architecture  The Database Administrator


Download ppt "Chapter 12 File Processing and Data Management Concepts."

Similar presentations


Ads by Google