1. Chapter 15 Introduction to Database Concepts

2. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Learning Objectives Use XML to describe the metadata for a table of information, and classify the uses of the tags as identification, affinity, or collection Explain the differences between everyday tables and database tables Explain how the concepts of entities and attributes are used to design a database table Use the six database operations: Select, Project, Union, Difference, Product, and Join Describe the differences between physical and logical databases Express a query using Query By Example

3. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Differences Between Tables and Databases When we think of databases, we think of tables of information: –iTunes show the title, artist, running time on a row –Your car’s information is one line in the state’s database of automobile registrations –The U.S. is a row in the demography table for the World’s listing of country name, population, etc.

4. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Canada’s Demographic Information

5. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley The Database’s Advantage Metadata is the key advantage of databases over other approaches to recording data as tables –Database software can search for the tag surrounding Canada –The tag will be one of several tags surrounded by tags –The computer knew which data to return based on the availability of the metadata

6. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley The Database’s Advantage The tags for the CIA database fulfill two of the most important roles in defining metadata: –Identify the type of data: Each different type of value is given a unique tag. –Define the affinity of the data: Tags enclose all data that is logically related.

7. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley The Database’s Advantage,, and similar tags have the role of identification because they label content tag has the role of implementing affinity because it keeps an entry’s data together

8. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley XML: A Language for Metadata Tags XML stands for the Extensible Markup Language It is a tagging scheme What makes XML easy and intuitive is that there are no standard tags to learn Tags are created as needed! –This trait makes XML a self-describing language

9. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley XML: A Language for Metadata Tags There are a couple of rules: –Always match tags –Basically anything goes XML works well with browsers and Web- based applications XML must be written with a text editor to avoid unintentionally including the word processor’s tags (see Chapter 4)

10. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Rules for Writing XML

11. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley XML As with HTML, the tag and its companion closing tag surround the data XML tag names cannot contain spaces Both UPPERCASE and lowercase are allowed XML is case sensitive Like XHTML, XML doesn’t care about white space between tags

12. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley XML Example Scenario: –Create a database for the Windward Islands archipelago in the South Pacific –Plan what information will be stored –Develop those tags: Tahiti 1048 Affinity role

13. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley XML This required line is added at the beginning of the file Note the question marks. This line identifies the file as containing XML data representations The file also has standard UTF-8 encoded characters

14. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Expanding the Use of XML To create a database of the two similar items (in this chapter, archipelagos), put both sets of information in the file As long as the two sets use the same tags for the common information, they can be combined Extra data is allowed and additional tags can be created ( to indentify which archipelago is being used)

15. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Expanding the Use of XML Group sets of information by surrounding them with tags These tags are the root elements of the XML database A root element is the tag that encloses all content of the XML file –In Figure 15.1 the tag was the root element

16. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley New root element

17. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Attributes in XML XHTML tags can have attributes to give additional information Tags of XML also have attributes –They have a similar form –Must always be set inside simple quotation marks –Tag attribute values can be enclosed either in paired single or paired double quotes

18. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Attributes in XML Writing tag attributes is easy enough The rules for using quotes are straightforward Use attributes is to use them for additional metadata, not for actual content

19. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Effective Design with XML Tags Identification Rule: Label Data with Tags Consistently –You can choose whatever tag names you wish to name data, but once you’ve decided on a tag for a particular kind of data, you must always surround that kind of data with that tag.

20. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Effective Design with XML Tags Label Data with Tags Consistently –One advantage of enclosing data with tags is that it keeps data together –It might be difficult to combine databases written by two different people –Tags can be edited by Find/Replace to change the tag names

21. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Effective Design with XML Tags Affinity Rule: Group Related Data –Enclose in a pair of tags all tagged data referring to the same entity. Grouping it keeps it all together, but the idea is much more fundamental: Grouping makes an association of the tagged data items as being related to each other, properties of the same thing.

22. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Effective Design with XML Tags Group Related Data –Plan on tags that can group same, not similar, items. –This is an important association to consider when developing tags and the database

23. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Effective Design with XML Tags Collection Rule: Group Related Instances –When you have several instances of the same kind of data, enclose them in tags; again, it keeps them together and implies that they are related by being instances of the same type.

24. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Effective Design with XML Tags Group Related Instances –A group of five islands were grouped inside an tag –A group of two archipelagos were grouped inside a tag

25. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Effective Design with XML Tags The Collection Rule and the Affinity Rule are different –The Affinity Rule groups the data for a single thing –The Collection Rule groups the data of several instances of the same thing The tags may be the same

26. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Effective Design with XML Tags The first association is among properties of an object The second association is among the objects themselves (entities) Being grouped by the Collection Rule doesn’t preclude being an object

27. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

28. Relational Databases Relational databases describe the relationships among the different kinds of data These relationships allow the software to answer queries about them Every relational database can be described by XML Every XML description is NOT a relational database

29. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Entities An entity is anything that can be identified by a fixed number of its characteristics (attributes) –The attributes have names and values –The values are the data that is stored in the table In relational databases, an attribute is a “column of a table”

30. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Entities The attribute’s name is the tag used in the Identity role The attribute values are the content enclosed in the tags An entity is a group of attributes collected together by the tag used in the Affinity role The entity is that object that is being described by all the tags

31. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Entities The tag used in affinity is the entity’s name The tags within are its attributes –“island” is an entity –“name”, “area”, and “elevation are the attributes –“archipelago” is also an entity

32. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Table Instance for Island Entity

33. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Entities Entity defines a table...the name of the entity is the name of the table Each column is one of the possible attributes The values in the columns are the attributes’ values, and the rows are the entity instances A specific set of values for the attributes of an entity is an entity instance Any table containing specific rows is said to be a table instance

34. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Entities In addition to having a name, attributes also have a data type (such as number, text, image) The data type defines the form of the information that can be stored in a field By specifying the data type, database software prevents us from accidentally storing bad information in a table

35. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Properties of Entities A relational database table can be empty –It is a table with no rows An entity is anything defined by a specific set of attributes A table exists with a name and column headings Once entity instances have been specified, there will be rows Among the instances of any table is the “empty instance”

36. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Instances Are Unordered Each distinct table is a different table instance Two table instances will have a different set of rows Tables with the same rows (but reordered) are the same table instance The order of the rows doesn’t matter in databases

37. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Instances Are Unordered The attributes (columns) are also considered to be unordered The attributes or column heading have a name, they are not tracked by position Column information stays in columns –They cannot switch to being a row Row information stays in rows –They cannot switch to being a column

38. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Uniqueness There are few limits on what an entity can be Things that can be identified from each other qualify as entities Entities can be distinguished by their attributes they are unique No two rows in a database table can be the same Unique instances is what is intended when a database is setup

39. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Keys What attributes distinguish the rows in a database table? –Single attributes might be sufficient –Multiple attributes might be required to ensure uniqueness Any set of attributes for which all entities are different is called a candidate key Database tables usually have several candidate keys

40. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Keys One of the candidate keys is the primary key The primary key is the one that the database system will use to decide uniqueness Candidate keys qualify only if they distinguish among all entities forever If no combination of attributes qualifies as a candidate key, then a unique ID must be assigned to each entity

41. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Atomic Data Databases treat the information as atomic –The information cannot be decomposed into smaller parts The “only atomic data” rule is usually relaxed for certain types of data: –Dates, time, and currency –A date value 01/01/1970 must be treated as a single unity –The format of the data attribute, say dd/mm/yyyy, allows the program to understand how the field decomposes

42. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Database Schemes Tags are a cumbersome way to define a table Database systems specify a table as a database scheme or database schema The scheme is a collection of table definitions that gives the name of the table, lists the attributes, their data types, and identifies the primary key

43. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Database Schemes Each database system has specific requirements for how a scheme is presented There are no universal rules

44. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Database Table Definition

45. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley XML Trees and Entities Reminder: relational database tables and XML trees are not the same Relational databases are more restrictive than XML trees The limits make them more powerful and allow them to do more

46. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley XML Trees and Entities The Collection Rule: –When entity instances are grouped, all entities within the tag must have the same structure –The structure defines the attributes that make up a row –When the tags was added inside of tags, the relational requirement that all entities have the same structure was violated

47. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Database Tables Recap Tables in databases are not simply an arrangement of text Tables have a structure that is specified by metadata The structure of a database table is separate from its content A table structures a set of entities by naming the attributes and giving their data types

48. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Database Tables Recap The entities of the table are represented as rows Rows and columns are unordered in databases Tables and fields should have names that describe their contents Fields must be atomic One or more attributes define the primary key

49. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Operations on Tables A relational database is a collection of database tables The main use of a database is to look up information Users specify what they want to know and the database software finds it The data is in the database, but it’s not stored in a single table The data must be describe in a way that the computer can figure out how to find it

50. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Operations on Tables Database operations allows queries of a database in a way that lets the software find the answer Operations can be performed on tables to produce tables The questions asked of a database are answered with a whole table There may be several answers forming the table If there is no answer, the table will be empty

51. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

52. Select Operation The Select operation takes rows from one table to create a new table The Select operation is specified by giving the table from which rows are to be selected and the test for selection: Select Test From Table

53. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Select Operation The Test is to be applied to each row of the given table to decide if the row should be included in the new result table The Test is a short formula that tests attribute values The Test is written using attribute names, constants like numbers or letter strings, and relational operators <, ≤, ≠, =, ≥

54. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Select Operation The relational operators test whether the attribute value has a particular relationship If the Test is true, the row is included in the new table The information used to create the new table is a copy –The original table is not changed by Select The Test can be more than a test of a single value

55. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

56. Project Operation Project (pronounced prōJECT) is the operation that builds a new table from the columns of an existing table Specify the name of a table and the columns (field names) from it to be included in the new table Project Field_List From Table

57. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Project Operation The new table may have as many rows as the original table, but a different number of columns Project does not always result in a table with the same number of rows as the original table Both Select and Project operations are used to “trim” base tables to keep some of the rows and some of the columns

58. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

59. Union Operation Another operation that can be performed on tables is to combine two tables This only makes sense if they have the same set of attributes The operation is known as Union Table1 + Table2

60. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Union Operation Read the plus sign (+) as “combined with” Union can be used to combine separate tables

61. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

62. Difference Operation Removing from one table the rows also listed in a second table is called the Difference Operation Table1 − Table2 Difference makes sense when the table’s fields are the same

63. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Product Operation The Product operation on tables is accomplished by multiplying tables together The Product operation creates a supertable Table1 × Table2

64. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Product Operation The super table has the columns from both tables –The first table has five attributes –The second table has six attributes. –The Product table has eleven attributes The rows of the new table are created by appending or concatenating each row of the second table to each row of the first table

65. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Super = Nations × Travelers A new table with ten fields (8 fields from Nations and 2 fields from Travelers) Yields a total of 920 rows Results in

66. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

67. Product Operation The Product operation merges information that may not “belong together” Product is used to create a supertable that contains both useful and useless rows The supertable may be “trimmed down” using Select, Project, and Difference to contain only the intended information

68. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Product Operation The Super table is the product table discussed earlier with a row for each nation paired with each friend The Assign table is then created by Union (+) that combines four tables

69. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Product Operation The tables were created by a Select operation from Super. The resulting Assign table has 230 rows with one of the friends’ names assigned to each country

70. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Database Operations These five basic operations on tables are straightforward and simple These five are the only operations needed to create any table in a relational database Database software incorporates these operations Creating tables from tables…we are using these operations

71. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Join Operation Another powerful and useful operation for creating database tables is Join Join can be defined from the previous five primitive database operations of the last section It is so useful, it is usually provided as a separate operator in database software

72. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Join Operation Join combines two tables, but it doesn’t necessarily produce all pairings If the two tables each have fields with a common attribute, the new table produced by Join combines only the rows from the given tables that match on those fields Table1 Table2 On Match

73. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Join Applied There are at least two ways to think about the Join operation: –It is a “lookup” operation on tables For each row in one table, locate a row (or rows) in the other table with the same value(s) in the common field(s) –If found, combine the two; if not, look up the next row

74. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Join Applied There are at least two ways to think about the Join operation: –Another way is to see it as a Product operation forming all pairs of the two tables, and then eliminating all rows that don’t match in the common fields with a Select Join is called a natural Join because the natural meaning of “to match” is for the fields to be equal

75. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

76. Structure of a Database There are two forms of tables: –The physical database Stored on the disk drives of the computer system Permanent repository of the database –The logical database known as the view of the database created for users on-the-fly customized for their needs

77. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Physical Database The physical database is designed by database administrators Data must be accessed fast The physical database is set up to avoid redundancy (duplicate information) –There is a good chance that data stored in various places will not be updated

78. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Logical Database The logical database shows users the view of the information they need and want It doesn’t exist permanently, but is created every time they need it The logical database is retrieved from the one copy stored in the physical database, and provided to the users as needed

79. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Logical Database Creating a new copy each time is essential –If it were to be created once and then stored on the user’s computer, then there would be two copies of the information The other advantage of creating specialized versions of the database for each user is that different users want to see different information

80. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Queries A query is a specification using the five operations and Join that define a table from other tables Queries are written in the standard database language SQL (Structured Query Language) SQL allows a new query to be run each time it is selected or opened

81. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Defining Physical Tables Database Schemes –The metadata specification of a database’s tables is given by a database schema –Interactive software helps define a database schema –The database schema describes the database design

82. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

84. The Idea of Relationships A relationship is a correspondence between rows of one table and the rows of another table Relationships are part of the metadata of a database and are critical to building the logical database from the physical database

85. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Relationship Examples Familiar relationships illustrate that their description often ends with a preposition –Father_Of the relationship between a man and his child –Daughter_Of the relationship between a girl and her parent –Employed_By the relationships between people and companies

86. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

87. Practical Construction Using QBE Database systems can make the development of a Join easy Query By Example (QBE) is available to us in Microsoft Access The software provides a template of a table, and we fill in what we want in the fields –That is, we give an example of what we want in the table –The software then figures out a query that creates the table from the sample table

88. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

90. Summary In this chapter we followed a path from XML tagging through to the construction of logical views using QBE. You learned a lot, including the following: –XML tags are an effective way to record metadata in a file. –Metadata is used to identify values; it can capture the affinity among values of the same entity, and can collect a group of entity instances.

91. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Summary You learned a lot, including the following: –Database tables have names and fields that describe the attributes of the entity contained in the table. –The data that quantitatively records each property has a specific data type and is atomic.

92. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Summary You learned a lot, including the following: –There are five fundamental operations on tables: Select, Project, Union, Difference, and Product. These operations are the only ones you need to create new tables from other database tables. –Join is an especially useful operation that associates information from separate tables in new ways, based on matching fields.

93. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Summary You learned a lot, including the following: –Relationships are the key to associating fields of the physical database. The physical database resides on the disk drive; it avoids storing data redundantly and is optimized for speed. –The main approach for creating logical views from physical data is the join-and-trim technique.

94. Copyright © 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Summary You learned a lot, including the following: –There is a direct connection between the theoretical ideas of database tables and the software of database systems.