Fundamentals/ICY: Databases 2013/14 WEEK 4: Monday Intro to tables, etc. John Barnden Professor of Artificial Intelligence School of Computer Science University.

Slides:



Advertisements
Similar presentations
Organisation Of Data (1) Database Theory
Advertisements

Fundamentals/ICY: Databases 2013/14 Week 6: Monday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Introduction to AI & AI Principles (Semester 1) WEEK 10 (07/08) [John Barnden’s slides only] School of Computer Science University of Birmingham, UK.
Introduction to AI & AI Principles (Semester 1) WEEK 11 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Week 2 Normalization and Queries
Mgt 20600: IT Management & Applications Databases Tuesday April 4, 2006.
Database terms Mr. Brunton.
Intro to Maths for CS: 2013/14 Sets (2) – OPTIONAL MATERIAL John Barnden Professor of Artificial Intelligence School of Computer Science University of.
Concepts of Database Management, Fifth Edition
Access 2007 Database Application Managing Business Information Effectively BCIS 1 and 2.
Fundamentals/ICY: Databases 2010/11 WEEK 5 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
Conceptual Data Modeling, Entity Relationship Diagrams
Intro to Maths for CS 2012/13 REVISION WEEK John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
Fundamentals/ICY: Databases 2012/13 WEEK 5 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
 A database is a collection of data that is organized so that its contents can easily be accessed, managed, and updated. What is Database?
Fundamentals/ICY: Databases 2012/13 WEEK 7 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
CSC 240 (Blum)1 Introduction to Database. CSC 240 (Blum)2 Data versus Information When people distinguish between data and information, –Data is simply.
Business computing Databases 2 4 january Program Create a simple database with several tables using Access Study a more complex database available.
Fundamentals/ICY: Databases 2013/14 Week 10 –Monday –Normalization, contd John Barnden Professor of Artificial Intelligence School of Computer Science.
Fundamentals/ICY: Databases 2013/14 WEEK 3: Friday Theme intro contd; towards tables John Barnden Professor of Artificial Intelligence School of Computer.
Intro to Maths for CS: 2012/13 Sets (week 1 part) John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Fundamentals/ICY: Databases 2012/13 WEEK 3 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
M1G Introduction to Database Development 2. Creating a Database.
Course: Software Engineering ©Alessandra RussoUnit 2: States and Operations, slide number 1 States and Operations This unit aims to:  Define: State schemas.
Fundamentals/ICY: Databases 2012/13 WEEK 10 (maths, normalization) John Barnden Professor of Artificial Intelligence School of Computer Science University.
1. Objectives At the end of this chapter you should be able to:  Discuss the use and features of a data model  Define the terms entity and attribute.
Fundamentals/ICY: Databases 2010/11 WEEK 3 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
Database Beginnings. Scenario so far In our scenario we have people registering for training sessions. –The data about the training sessions was placed.
Fundamentals/ICY: Databases 2012/13 WEEK 11 – 4 th Normal Form (optional material) John Barnden Professor of Artificial Intelligence School of Computer.
Computing Science 1P Lecture 21: Wednesday 18 th April Simon Gay Department of Computing Science University of Glasgow 2006/07.
Fundamentals/ICY: Databases 2012/13 Intro to Some Main Themes John Barnden Professor of Artificial Intelligence School of Computer Science University of.
DATABASE What exactly is a database How do databases work? What's the difference between a spreadsheet database and a "real" database?
Hashing Sections 10.2 – 10.3 CS 302 Dr. George Bebis.
Data Structures and Algorithms Lecture 1 Instructor: Quratulain Date: 1 st Sep, 2009.
Fundamentals/ICY: Databases 2013/14 WEEK 9 –Monday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Concepts of Database Management, Fifth Edition Chapter 6: Database Design 2: Design Methodology.
Computing Science 1P Lecture 14: Friday 2 nd February Simon Gay Department of Computing Science University of Glasgow 2006/07.
GIS Data Models GEOG 370 Christine Erlien, Instructor.
COSC 2007 Data Structures II Chapter 13 Advanced Implementation of Tables IV.
Fundamentals/ICY: Databases 2013/14 WEEK 9 –Friday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Hashing Suppose we want to search for a data item in a huge data record tables How long will it take? – It depends on the data structure – (unsorted) linked.
Fundamentals/ICY: Databases 2013/14 Initial Orientation John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Fundamentals/ICY: Databases 2013/14 Week 5: Monday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Flat Files Relational Databases
CS 111 – Nov. 8 Databases Database Management Systems (DBMS) Structured Query Language (SQL) Commitment –Please review sections 9.1 – 9.2.
Fundamentals/ICY: Databases 2012/13 Week 4 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
Fundamentals/ICY: Databases 2013/14 Week 4: Friday John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Intro to Maths for CS: 2012/13 Sets (end, week 3) John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham,
Fundamentals/ICY: Databases 2013/14 Week 11 – Monday – relations, ended. John Barnden Professor of Artificial Intelligence School of Computer Science University.
April 20022CS3X1 Database Design The relational model John Wordsworth Department of Computer Science The University of Reading
Fundamentals/ICY: Databases 2012/13 WEEK 9 John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK.
Fundamentals/ICY: Databases 2013/14 Week 3: Monday Intro to Some Main Themes John Barnden Professor of Artificial Intelligence School of Computer Science.
ENTITY – RELATIONSHIP MODEL Melissa Ann D. Callejo Chairmane Abanilla.
1 The Relational Data Model David J. Stucki. Relational Model Concepts 2 Fundamental concept: the relation  The Relational Model represents an entire.
Database (Microsoft Access). Database A database is an organized collection of related data about a specific topic or purpose. Examples of databases include:
1 Files and databases Suppose a school stores information about its students on record cards. Each student has their own card; this is their record. Record.
2b. Create an Access Database Lingma Acheson Department of Computer and Information Science IUPUI CSCI N207 Data Analysis with Spreadsheets 1.
Intro to Maths for CS: 2012/13 Sets (contd, week 2)
Fundamentals/ICY: Databases 2013/14 WEEK 8 –Monday
Hash table CSC317 We have elements with key and satellite data
Fundamentals/ICY: Databases 2010/11 WEEK 1
Fundamentals/ICY: Databases 2010/11 WEEK 6
Normalization of Databases
Creating Tables & Inserting Values Using SQL
Common Barriers to Accessibility on the Web
Fundamentals/ICY: Databases 2013/14 WEEK 6 - Friday
John Barnden Professor of Artificial Intelligence
Database Design Week 12.
Information system analysis and design
Presentation transcript:

Fundamentals/ICY: Databases 2013/14 WEEK 4: Monday Intro to tables, etc. John Barnden Professor of Artificial Intelligence School of Computer Science University of Birmingham, UK

Reminder of Friday

NAMEADDRESSPHONESBIRTHDAY Babloop Porkypasta 107 Worm Drive, Hedgebarton, Birmngham, B15 9ZZ January 1969 Coriolanus Zebedee O’Crackpotham The Wellyboots, Boring-under-Mosswood, Berks, HP11 1XX Johnny Next to the Tesco’s in Upper Street H: W: M: ??? Full Monty chip shop Harborne Oct 05 Hilary R. Clinton (grr!) The Old Black House, Aplanalp St., Las Cruces, NM , USA ex-dir16 Sep? (refused to tell me how old she was)

Problems with that Table uAlthough that table illustrates the sort of table used in databases in some sense, it has many tricky features: l Empty entries – what’s the interpretation? l Spelling error (Birmngham) l Names/addresses of different forms (perhaps unavoidably) l Different numbers of alternatives in different cells l Different interpretations of “birthday” field (per year, or when born, or when shop opened) l Vague entries (next to the Tesco’s in Upper St.; Harborne) l Expressed uncertainty (the question marks, alone or attached) l Additional comments (grr!, refused …) l Exceptional entry types (ex-dir, and the contents of the chip-shop row)

New

Question to You: What other sorts of weird thing could happen in tables??

Restrictions on Database Tables: Overall Structure uRegular overall shape: rows all same length, similarly columns. uNo division into different regions (with a certain exception). uNo labels for rows, as opposed to columns. Mostly no significance to the order of rows. uNo additional comments, footnotes, etc.

Restrictions on Database Tables: Nature of Entries uAll cells in any one column are given the same intuitive interpretation. uEach cell’s item restricted to a pre-specified, usually fairly simple value range (data type), and all cells in any given column restricted to same data type. uNo exceptional entries … with one exception!: empty entries uOne data item per cell (but it can be a variable-length character string, containing anything). uUncertainty and vagueness markers not supported.

Extra, Crucial Restriction (on the main tables) uNo row can be repeated in a table. (I.e., no two rows can contain exactly the same values.) uThis is equivalent to saying: Rows are uniquely determined (picked out) by the values in some set of columns (possibly the whole set, but could be fewer). That is, if you imagine some values for those columns, there is at most one row that has exactly those values in those columns.

Table on next slide is closer to what might be in a database

LAST N.FIRST NMIADDRESSHome PhMobileB yearB day PorkypastaBabloop107 Worm Drive, Hedgebarton, Birmngham, B15 9ZZ Jan 11 O’CrackpothamCoriolanusZThe Wellyboots, Boring-under- Mosswood, Berks, HP11 1XX DelfinoJohnny-----Next to the Tesco’s in Upper Street ClintonHilaryRThe Old Black House, Aplanalp St., Las Cruces, NM , USA-----Sep 16

Coordination between Tables NAMEPHONEEMPLOYERAGE Chopples University of Birmingham 37 Blurp Monmouth School for Girls 21 Rumpel University of Birmingham 88 EMPLOYERADDRESSNUM. EMPLSSECTOR BTBT House, London, … 1,234,5678Private TCOM Monmouth School for Girls Hereford Rd, Monmouth, … 245Private 2E University of Birmingham Edgbaston Park Rd, …. 4023Public HE PHONETYPESTATUS officeOK homeFAULT homeOK mobileUNPAID There should really be a FIRST NAME as well, in practice

Remember: “Associative Linking” This is how the tables are linked.

But: What are the disadvantages of using character strings like “University of Birmingham” as linking values?

The Disadvantages uIn entering values, have to ensure exactly the same string of characters on each occasion l avoid typos on data entry l avoid variants: “The University of Birmingham” uDifficult to guarantee that two different entities won’t have the same name. uInefficiency of comparing such complex values. Reduce such problems by: uUsing artificial linking values that are simpler in form and easier to make distinct …..

Table Coordination: Revised NAMEPHONEEMPL. IDAGE Chopples E Blurp E Rumpel E EMPL. IDEMPL. NAMEADDRESSNUM. EMPLSSECTOR E48693BTBT House, London, … 1,234,5678Private TCOM E85704Monmouth School Hereford Rd, Monmouth, … 245Private 2E E22561University of Birmingham Edgbaston Park Rd, …. 3023Public HE PHONETYPESTATUS officeOK homeFAULT homeOK mobileUNPAID

Redundancy between Tables NAMEPHONESTATUSEMPLOYERAGE Chopples OK University of Birmingham 37 Blurp FAULT Monmouth School 21 Rumpel UNPAID University of Birmingham 88 PHONETYPESTATUS officeOK homeFAULT homeOK mobileUNPAID What are the advantages and disadvantages of the sharing of the STATUS attribute?

Tables and Things u The example tables involve various sorts of thing: l People l People’s names l Addresses l Phone numbers l Phone number types l Dates l Ages l Status indicators l etc.

uand also various sorts of connection between things, e.g.: l A person having an address l A person being employed by an organization l An organization having some employees l A person having a birth date l A phone number being of a type l A phone number having a status l etc.

ORGANIZATIONS (each with …) PHONE STATIONS (each with number, type & status) a person may be employed by one(?) organization a person may have one(?) phone station PEOPLE (each with name, address, etc.) PHONE EMPLOYER

You Judge Only Some Types of Thing to Merit Tables uIn the example above we have decreed that only the following TYPES of thing --- people, employing organizations, and phone stations --- correspond to WHOLE TABLES. l In one table, each row represents a person. l In another table, each row represents an employing organization. l In yet another table, each row represents a phone station. uWe have decreed that the other types of things, such as people’s names, addresses, phone numbers, phone-number types, etc. correspond only to COLUMNS of tables, not whole tables, and each individual thing is just represented as a value in a cell.

Meriting Tables, contd. uThe question of what types of thing should correspond to tables depends on the application and your design judgment. uIt all depends on things like: l what range of information is needed about something l how separate the pieces of info about a given thing are l what operations are needed l how often they’re needed. u For example:

Typical Approach to Phone Numbers NAMEPHONEEMPLOYERAGE Chopples E Blurp E Rumpel E (There should really be a FIRST NAME as well)

But the following is possible … NAMEPHONE IDEMPLOYERAGE ChopplesABC123E BlurpABC137E RumpelDEF678E PHONE IDAREA CODEBODY ABC ABC DEF DEF There should really be a FIRST NAME as well