BSIT and BSCS students can use this guide to study “Relational Databases and Microsoft Access 365” by Ron McFadyen, a free textbook written for a second-year Database Systems course. It teaches MS Access and relational database design together, so it matches the usual DBMS syllabus: tables, forms, queries, joins, SQL, ER diagrams, mapping to relations and normalization. The Access 365 edition is released under a Creative Commons licence and is hosted by eCampusOntario.
The author wrote it for students with no database background, including those from other majors. Each chapter uses the same small University, Library and Company databases, ends with exercises, and builds from clicking in Access to designing a database on paper. That makes it handy for lab work, for revising ER diagrams and BCNF before a paper, and for self-study. Note that the practical chapters need Microsoft Access, which runs on Windows.
Book Overview
| Course | Database Systems / Database Management Systems (introductory) |
| Degree Programs | BSIT, BSCS |
| Level | University / Undergraduate (second year) |
| Edition | Access 365 edition, Version 4.0 (Pressbooks release, 2022) |
| Author | Ron McFadyen |
| Publisher | eCampusOntario Pressbooks (Loyalist College); author’s website hosted by the University of Winnipeg |
| Language | English |
| Total Chapters | 10 chapters and 2 appendices |
| Exercises | Exercises in most chapters, using the Library, University and Company sample databases |
| License | Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
| Format | PDF, EPUB and online (Pressbooks) |
Chapter List
Chapter 1: Relational Databases and MS Access
Difficulty: Easy · Key topics: relation, tuple, attribute, verbalization, Codd, MS Access, datasheet view, design view, primary key
The chapter starts with a tiny Employees table and shows that a relational database is just tables of rows and columns, introduced by E. F. Codd. It teaches the habit of reading each row as a plain sentence, called a verbalization, and compares it with the document sentences used in reading research. A short formal definition follows: a relation is a set of tuples with the same number of attribute values. The second half opens the Library database in MS Access, where you edit, add and delete rows in Datasheet View and then use Design View to see data types, the primary key and the properties that enforce simple integrity rules.
Key Points:
- A relational database stores data as relations: tables whose rows (tuples) all have the same structure.
- E. F. Codd introduced relational databases in 1969, and his 1970 paper is called one of the great papers in computer science.
- A verbalization turns one row into a sentence, such as “Employee with ID 123 has a first name Joe”, to explain what the row means.
- MS Access is a workstation database system for Windows; the whole database lives in one file ending in
.accdb(older versions used.mdb). - A primary key is a unique identifier: every table should have one, and a table can have only one.
- Data types and field properties enforce rules such as unique call numbers, required titles and maximum lengths, while an author field may be left empty (null).
Memory Tip: Say every row out loud as a sentence. If you cannot explain in plain words what one row means, the table is probably badly designed.
Common Mistake: Treating Datasheet View as the whole table. It only shows the data; keys, required fields and length limits are set in Design View.
Important Questions:
- What is a relation? A set of tuples (rows) in which every tuple has the same number of attribute values; it is usually drawn as a table.
- What does a primary key do? It uniquely identifies each row, so a query on a primary key value returns at most one row, and Access will not accept a duplicate value.
Chapter 2: Creating Tables
Difficulty: Easy · Key topics: Design View, data types, field properties, input mask, validation rule, primary key, composite key
Using a University database with Department and Course tables, this chapter builds tables from scratch in Design View, where each field has a name, a data type and a description. It walks through the Access data types: Short Text, Long Text, Number, Large Number, Date/Time, Currency, AutoNumber, Yes/No, Calculated and Lookup Wizard. Then it explains field properties such as Field Size, Format, Input Mask, Caption, Default Value, Validation Rule and Text, Required and Indexed. The last section sets primary keys, a single field for Department and a composite key of deptCode and courseNo for Course, and the exercises make you enter sample data.
Key Points:
- Short Text holds fewer than 256 characters and is the usual choice for values you will not calculate with, such as codes and phone numbers.
- The Field Size property limits input, for example 4 characters for
deptCode, which reduces typing errors. - An Input Mask guides data entry, and a Validation Rule with Validation Text rejects values that break a rule.
- For an AutoNumber field, the New Values property chooses between incrementing and random numbers.
- Department uses
deptCodeas its key; Course has a composite key made ofdeptCodeandcourseNo. - To make a composite key, select both fields with the Control key held down and then choose Primary Key.
- The same field must be defined the same way in both tables, because this matters when relationships are created later.
Practice Tip: Create the Department table, set deptCode to length 4 with the display format >, then type a lowercase code in Datasheet View and watch how Access shows it.
Common Mistake: Giving the same field a different length or type in two tables. The tables then do not match when you try to relate them, and a primary key is also rejected if the existing data already contains duplicates.
Important Questions:
- What is a composite primary key? A key formed from two or more fields; in the Course table it is
deptCodepluscourseNo. - What does Access do if you add a row with an existing primary key value? It refuses the row, because primary key values must be unique.
Chapter 3: Creating Forms
Difficulty: Easy · Key topics: Form Wizard, Design View, button, label, calculated field, text box
The chapter argues that datasheet view is not user-friendly and that every table should get a basic form. It shows the Form Wizard, which asks for the table, the fields, the layout, the style and the title, and has you build one form each for Department and Course. Then it modifies a form in Design View: adding buttons for common actions such as adding a row, deleting the current row or closing the form, adding a label for display-only text, and adding a calculated field with a text box. The last section, Advanced Forms, points ahead to Appendix A for forms that use more than one table.
Key Points:
- A form is a friendlier way for users to enter and manage the data of a table than datasheet view.
- The Form Wizard collects the table, fields, layout, style and title in a sequence of steps.
- Buttons are added in Design View, for example in the Form Footer, with the Control Wizards switched on.
- A label is a control that holds text for display only; Access adds one with the table name in the Form Header by default.
- A calculated field is a text box with a formula such as
=[quantity]*[unitprice].
Practice Tip: On a form for any table with two numeric fields, add a text box with a formula like =[quantity]*[unitprice], give it a label such as Extended price, and test it in Form View.
Common Mistake: Adding a button while Control Wizards are off. You get a bare button with no action instead of the guided steps that attach an operation to it.
Important Questions:
- Why create forms instead of using datasheet view? Forms give end users a more friendly way to enter and manage data.
- How do you show a calculated value on a form? Add a Text Box control and enter a formula that starts with an equals sign, such as
=[quantity]*[unitprice].
Chapter 4: Microsoft Access Queries
Difficulty: Easy · Key topics: Query Design, QBE grid, projection, selection, sorting, AND, OR, join
Queries restrict what a user can see and can feed forms and reports, and the chapter uses the Library database to build them with the Query Designer. The Query By Example window has a Relationships area for tables and a Grid area for fields, criteria, sorting and calculations. The chapter goes from a simple query that lists a whole table (the asterisk means all attributes) to a projection of chosen columns, a selection with criteria such as paperback equal to Yes, and a sorted result. It then shows AND and OR, including the wildcard pattern for titles containing SQL, and ends with joins, using the member-and-loan example to explain how rows are matched on a common value.
Key Points:
- The QBE window has two areas: Relationships (the tables used) and Grid (fields, criteria, sort, grouping and calculations).
- A projection query shows a subset of columns; only fields with a tick on the Show line appear in the result.
- A selection query puts its requirement on the Criteria line of the field, for example Yes for the paperback field.
- Criteria on the same line are ANDed; criteria on separate lines are ORed.
- The
*character in a text pattern matches any characters, so a pattern around SQL finds titles containing SQL. - A join combines rows of two tables that share a value, such as the member id in Loan and Member.
Practice Tip: Write the query for books by Celko with SQL in the title, run it, then move one criterion to the Or line and run it again to see how the result grows.
Common Mistake: Putting AND criteria on different lines. Access reads separate lines as OR, so you get far more rows than you expected.
Important Questions:
- How do you express AND and OR in the QBE grid? Criteria on one line are ANDed; criteria on different lines are ORed.
- What is a join? An operation that matches rows of two tables on a common value, such as joining Loan to Member on the member id.
Chapter 5: Relationships and the Relationships Tool
Difficulty: Medium · Key topics: Relationships Tool, foreign key, entity integrity, referential integrity, one-to-many, one-to-one, many-to-many
The Relationships Tool defines links between tables through common fields, and the chapter explains why: such links protect data integrity and supply default join criteria for queries. Using the University and Library databases, it shows deptCode in Course as a foreign key that references deptCode in Department. It defines primary key, foreign key, entity integrity and referential integrity. It then shows how dragging a key field creates a one-to-many relationship, a one-to-one relationship when the foreign key has a unique index, or an indeterminate many-to-many link that designers avoid by adding a third table.
Key Points:
- A foreign key is a field in table B that is associated with a primary key in table A (A and B can be the same table).
- Entity integrity means every row is identifiable through its primary key.
- Referential integrity means each foreign key value is either null or exists as a primary key value in the referenced table.
- If the foreign key has duplicate values, Access creates a one-to-many relationship; if it has a unique index, one-to-one.
- Two non-unique fields give an indeterminate many-to-many link, which is better replaced by two one-to-many relationships through a third table.
- Relationships defined in the tool become the default join criteria in queries that use more than one table.
Memory Tip: The primary key is the parent’s ID card and the foreign key is the child carrying a copy of it. A child cannot carry an ID card that no parent holds, and that is referential integrity.
Common Mistake: Leaving a many-to-many link between two tables. Add a third table that holds the keys of both and relate each side to it one-to-many.
Important Questions:
- What is referential integrity? For every row in the referencing table, the foreign key is either null or matches a primary key value in the referenced table.
- How does Access decide between one-to-many and one-to-one? It looks at the foreign key field: duplicate values mean one-to-many, a unique index means one-to-one.
Chapter 6: Microsoft Access Queries – Advanced
Difficulty: Medium · Key topics: logical expressions, Like, In, Totals, parameter query, crosstab, action queries, outer join, self-join, SQL Select, Union
This is the longest chapter and builds from logical expressions with AND, OR and NOT to the Like and In operators and the Top Values and Unique Values query properties. It then covers Totals queries with Group By and aggregate functions, parameter queries with a prompt in square brackets, crosstab queries made with the wizard, and the four action queries: make-table, append, delete and update. A long section on joins separates inner joins, outer joins, Cartesian products, self-joins, anti-joins and non-equi joins. The chapter ends by tying Design View to the SQL Select statement and showing Union and Union All.
Key Points:
- The Like operator matches text patterns with wildcards, while In tests whether a value is in a list such as
IN ("PHYS", "STAT", "MATH"). - Setting Unique Values to Yes removes duplicate rows from a result; Top Values limits the number or percentage of rows shown.
- A Totals query uses Group By, Where or an aggregate: sum, average, minimum, maximum and count.
- An outer join keeps rows with no match, joining them to a row of nulls; a Cartesian product of 4 and 100 rows gives 400 rows.
- The SQL Select clauses are Select, From, Where, Group By, Order By and Having, and each has a matching place in Design View.
- Union removes duplicates and sorts the result; Union All keeps every row; both need identical output fields.
- Action queries change data, and a Delete query can remove many rows in one run.
Practice Tip: Build a Totals query that counts courses per department, then switch to SQL View and match each line of the generated SQL to the Group By and Where settings in the grid.
Common Mistake: Running an action query to see what it does. Build and check it as a normal select query first, because Delete and Update queries change real data.
Important Questions:
- What is the difference between an inner join and an outer join? An inner join keeps only rows that match in both tables; an outer join also keeps unmatched rows from one table, joined to nulls.
- What is the difference between Union and Union All? Union removes duplicates and sorts the result; Union All returns every row without sorting.
Chapter 7: Entity Relationship Modelling
Difficulty: Medium · Key topics: Chen notation, entity, weak entity, attribute types, key, relationship, cardinality, participation, identifying relationship
The chapter moves from Access skills to design. It presents the entity relationship diagram in Peter Chen’s notation, which comes from his 1976 paper, as the way to document the information needs of a system. Entities, weak entities and attributes come first: atomic, composite, single-valued, multi-valued, derived, key, partial key, surrogate key and non-key attributes, plus nulls and domains. The second half covers relationships by degree, participation, cardinality, recursion and identifying relationships, with a student-and-course example throughout and exercises that ask you to draw ERDs.
Key Points:
- Entities are the people, places, things and events we keep information about; attributes describe entities and relationships.
- A weak entity exists only in relation to another, such as a course inside a department.
- Derived attributes are drawn as dotted ovals; key attributes are underlined; a key is a minimal set of attributes that identifies an entity.
- A partial key identifies an entity only relative to a related entity, such as an invoice line number within one invoice.
- A surrogate key is a meaningless value, often an integer assigned by the database system.
- A double line means total (mandatory) participation; cardinality is shown with symbols such as 1 and n.
- An identifying relationship is drawn as a double-lined diamond.
Memory Tip: Weak entity, double diamond, double line: a weak entity cannot be identified alone, so it borrows its parent’s key through an identifying relationship and must always take part in it.
Common Mistake: Storing a multi-valued fact, such as a list of degrees, in one attribute. Show it as a multi-valued attribute in the ERD so it gets its own relation later.
Important Questions:
- What is a weak entity? An entity type whose existence depends on another entity type, so it is identified using the other entity’s key plus its own partial key.
- What is cardinality? A constraint on a relationship that says how many instances of one entity may be related to an instance of the other: one-to-one, one-to-many or many-to-many.
Chapter 8: Mapping an ERD to a Relational Database
Difficulty: Medium · Key topics: mapping rules, strong and weak entities, foreign keys, multi-valued attributes, many-to-many relation
Once an ERD looks right, this chapter turns it into relations. Each entity type becomes its own relation: strong entities take a chosen key, while a weak entity takes the keys of its identifying entities plus its own discriminator. Relationships are implemented with foreign keys, depending on degree and cardinality. Attributes are handled by type: simple ones stay in the relation, multi-valued ones get a new relation, and derived and composite ones do not appear. Two worked examples, a library and an employee-supervisor model, show the rules in use.
Key Points:
- Each entity type is implemented with a separate relation.
- A weak entity’s key is the key of the identifying entity plus its discriminator (partial key).
- In a one-to-many relationship the foreign key goes on the many side.
- A one-to-one relationship lets the designer choose where the foreign key goes.
- A many-to-many relationship becomes its own relation, such as Borrow with the composite key
{memberId, bookId, dateTimeBorrowed}. - A multi-valued attribute gets a new relation whose key is the entity key plus the attribute.
Memory Tip: Foreign keys live on the “many” side. Ask who has many of whom, then put the parent’s key into the child’s table.
Common Mistake: Copying composite or derived attributes straight into a table. Break the composite attribute into its parts and leave out derived ones, as the book’s rules say.
Important Questions:
- How is a many-to-many relationship mapped? It becomes a separate relation holding the keys of both entity types as foreign keys, together forming a composite primary key.
- How is a multi-valued attribute mapped? To a new relation containing the entity’s primary key and the attribute, which together form that relation’s key.
Chapter 9: Data Definition Language (DDL)
Difficulty: Easy · Key topics: DDL, CREATE TABLE, ALTER TABLE, CREATE INDEX, SQL View, foreign key clause
This short chapter shows how to create a database with text commands instead of Design View. In MS Access you open a new query without adding tables, switch to SQL View and run one command at a time. The Library database with Book, Patron and Borrow tables is built in seven small examples: a basic CREATE TABLE, a table with a primary key, a table with a composite primary key and a FOREIGN KEY clause, then ALTER TABLE to add a primary key, a foreign key and a column, and finally CREATE INDEX with its DROP INDEX partner.
Key Points:
- DDL commands create tables, indexes and relationships; many ERD tools can generate them.
- In Access, run DDL from a query in SQL View with no tables added.
- The data type
Counteris turned into AutoNumber after the command runs. - A composite key is declared in a separate
PRIMARY KEY (...)clause. - A
FOREIGN KEY (...) REFERENCESclause creates a relationship you can see in the Relationships Tool. ALTER TABLEcan add a primary key, a foreign key or a column to an existing table.
Practice Tip: Open a query in SQL View, run a CREATE TABLE Book command with a callNo and a title field, and check that the new table appears in the Tables list.
Common Mistake: Declaring a foreign key column with a type that does not match the referenced key. The book uses Integer for the patron id so it matches the table it references.
Important Questions:
- What are the three DDL commands shown in the chapter? CREATE TABLE, ALTER TABLE and CREATE INDEX (with DROP INDEX to remove one).
- How do you add a primary key to a table that already exists? Use
ALTER TABLE tablename ADD PRIMARY KEY (field).
Chapter 10: Normalization
Difficulty: Hard · Key topics: functional dependency, determinant, candidate key, anomalies, partial and transitive dependency, 1NF, BCNF, lossless decomposition
The chapter says normalization gives a theoretical basis to judge the quality of a design, even though ER modelling is the main design technique in practice. It begins with functional dependencies, determinants and candidate keys, and then shows update, insert and delete anomalies with a small enrolment relation where a student name is repeated. Partial and transitive dependencies are explained with course and instructor examples. Then 1NF (single-valued, atomic values) and BCNF (every determinant of a non-trivial dependency is a candidate key) are defined and worked through four examples, with lossless decompositions. The summary adds 2NF and 3NF and says a designer may stop short of BCNF to avoid joins.
Key Points:
- A functional dependency A → B means each value of A has at most one value of B; A is the determinant.
- A key is a minimal set of attributes that uniquely identifies tuples, and the keys of a relation are its candidate keys.
- A relation not in 1NF has a multi-valued attribute, such as a degrees column holding “BSc, MSc”.
- BCNF: a relation is in BCNF if it is in 1NF and every determinant of a non-trivial FD is a candidate key.
- Redundancy in a non-BCNF relation comes from partial dependencies, transitive dependencies, or dependencies among key attributes.
- A decomposition must be lossless: joining the new relations returns the original rows exactly, with no spurious rows.
- 2NF removes partial dependencies; 3NF removes partial and transitive dependencies; BCNF is stronger than both.
Memory Tip: For 2NF and 3NF, remember that every non-key fact should depend on the key, the whole key and nothing but the key. BCNF goes one step further: every determinant must itself be a candidate key.
Common Mistake: Decomposing a relation by simply splitting its columns. If the new relations share no suitable common attribute, the join creates spurious rows and the decomposition is not lossless.
Important Questions:
- What is BCNF? A relation R is in BCNF if it is in 1NF and every determinant of a non-trivial functional dependency in R is a candidate key.
- What is a partial functional dependency? A non-key attribute that depends on only part of a composite key, such as the department chair name depending on department number alone.
Appendix A: Forms Involving Multiple Tables
Appendix · Difficulty: Easy · Key topics: form with subform, one-to-many, Form Wizard, parent and child data
Chapter 3 built forms for one table, and this appendix extends the idea to two tables joined by a one-to-many relationship. Using the Company database, you first make sure the Department and Employee relationship exists and then run the Form Wizard, picking fields from both tables. You view the data “by Department” and choose a form with a subform in Datasheet layout, naming them EmployeesByDepartment and EmployeesSubform. The finished form has one set of navigation buttons for the department and another for its employees. Exercises repeat the idea for the University and Library databases.
Key Points:
- A main form shows the parent row and a subform shows its related child rows.
- The connection between form and subform is based on the primary key and foreign key.
- The one-to-many relationship must exist before the wizard can link the two tables.
- The finished form has two sets of navigation buttons, one for each level.
Practice Tip: Build the EmployeesByDepartment form, move through the departments with the outer buttons, and watch the subform change its list of employees.
Common Mistake: Starting the wizard before the relationship between the two tables exists, so the form cannot link parent and child rows.
Important Questions:
- What is a subform? A form embedded in a main form that shows the rows of a related table for the row currently displayed above it.
- Which relationship type does this appendix cover? A one-to-many relationship, such as one department with many employees.
Appendix B: Supertypes and Subtypes
Appendix · Difficulty: Hard · Key topics: supertype, subtype, disjoint, overlapping, inheritance, discriminator, mapping options
This appendix extends ER modelling to entity types with useful sub-groups, such as a library item that can be a book, a video or a magazine. It keeps the Chen notation, joins a supertype to its subtypes through a circle symbol, and separates disjoint subtypes from overlapping ones. Subtypes inherit the relationships and attributes of the supertype, but never the reverse. A discriminator attribute such as itemType can show which subtype a row belongs to. The final sections map hierarchies to relations in three ways: a relation for every entity type, relations for the bottom-most types only, or one relation for the whole hierarchy.
Key Points:
- Only hierarchies are considered: an entity type has at most one supertype.
- Subtypes are disjoint if an instance can belong to only one of them, and overlapping otherwise.
- Subtypes inherit the supertype’s relationships and attributes; the supertype does not inherit from its subtypes.
- Attributes shared by all subtypes are drawn once, at the supertype.
- With one relation per entity type, all relations share the same primary key, which is also a foreign key in each subtype.
- With one relation for the whole hierarchy, a discriminator attribute shows the subtype of each row.
Memory Tip: Inheritance flows downward only. Think of a family: children get the family name, but the parents do not get each child’s job.
Common Mistake: Putting a subtype-only attribute, such as a book’s page count, on the supertype. Then it applies to videos and magazines too, where it makes no sense.
Important Questions:
- What are the three ways to map a supertype hierarchy to relations? One relation for each entity type, relations for the bottom-most entity types only, or one relation for the whole hierarchy.
- What is the difference between disjoint and overlapping subtypes? In disjoint subtypes an instance belongs to only one subtype; in overlapping subtypes it can belong to more than one.
How to Study This Book
The book has 10 chapters and two appendices, and the preface says it was written for a second-year database course with no prerequisites. It has three jobs: teach you a personal database system (MS Access), teach you SQL (mainly the Select statement), and give you the concepts of database design. Chapters 1 to 6 and Chapter 9 are Access chapters. Chapters 7, 8 and 10 and Appendix B are design theory that applies to any database system.
Start with Chapters 1 and 2 and download the sample databases (Library, University and Company) from the book’s website, because almost every exercise in the book uses them. Chapters 3 and 4 are hands-on and quick if you have Access open next to the text. Do Chapter 4 on the computer rather than only reading it, since the QBE grid only makes sense when you build the queries yourself. Chapter 3 ends by pointing to Appendix A, so read that appendix after Chapter 5, when you understand one-to-many relationships.
Chapter 5 is the bridge between the tool and the theory: foreign keys, entity integrity and referential integrity appear again in Chapters 8 and 10. Chapter 6 is the heaviest Access chapter, with more than twenty sections, so split it over several sittings: logical expressions, Like and In first, then Totals, parameter and crosstab queries, then action queries, and finally the joins and the SQL Select statement. The section on SQL Select is the one to revise most before a paper, because it ties the Design View grid to SQL text.
Chapters 7 and 8 belong together. Chapter 7 is long, so draw the diagrams yourself while reading: the exercises ask for real ERDs, and drawing is the only way the cardinality and participation symbols stick. Then do Chapter 8 straight afterwards and map your own ERDs to relations using its rules. Chapter 9 then turns those relations into CREATE TABLE commands, so it feels easy once Chapter 8 is clear.
Chapter 10 is the hardest chapter and deserves its own week. Read functional dependencies and keys first, then the anomalies, and only then the normal forms. Work through the four BCNF examples with a pencil, writing down the candidate keys and dependencies before you look at the book’s answer. Appendix B is optional in many courses, so check your outline before spending time on it.
Be aware of what the book does not do. It is not a full course in SQL, because it focuses on the Select statement and a few DDL commands. It does not go beyond BCNF, since the author leaves higher normal forms to later courses. It also uses only one product: all screens, menus and the DDL data types (such as Counter, Text and YesNo) are from Access, so check the type names when you move to another system.
Used In These Programs
This book is used for the Database Systems course in: BS Computer Science · BS Information Technology. Browse all Database Systems books or all Computer Science books.
Who Should Read This
This book is written for BSIT and BSCS students taking a first Database Systems or DBMS course, usually in the second year, and for students from other majors who take database design as a service course. It assumes no earlier database knowledge. It is a good fit when your lab uses MS Access, and also when your paper tests ER diagrams, ERD-to-table mapping and normalization, because those chapters are explained in plain steps with many worked examples. Remember that Access is a Windows desktop product, so Mac and Linux users will need a Windows machine or a lab computer for the practical chapters. It is not the right book if your course is built on MySQL, PostgreSQL or Oracle administration, or if you need transactions, indexing internals or NoSQL. For a book that follows the syllabus used at many Pakistani universities, see Database Management System (IT Series, 3rd Edition), and for a short treatment of the relational data model alongside other data models see Foundations of Computer Science.
Applicable Universities
This book is useful for students at Pakistani universities offering BS Computer Science or BS Information Technology with a database systems course, including Punjab University, Virtual University, COMSATS, FAST, UET, NUST, and other HEC-recognized institutions.
Official Copy of Relational Databases and Microsoft Access 365
The book is free on the eCampusOntario Pressbooks site, which offers a digital PDF, a print PDF and an EPUB, as well as an online reading version. Click below to open the official page and choose your format.
→ Visit Official PageFAQs
Is Relational Databases and Microsoft Access free?
Yes. The Access 365 edition is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International. You can read and download it free of charge. Unmodified copies may be shared for non-commercial purposes, modified versions must use the same licence, and other uses need the author’s permission. Use the official eCampusOntario page for your copy.
Which edition is this?
This page covers “Relational Databases and Microsoft Access 365”, listed as Version 4.0 and published through eCampusOntario Pressbooks in 2022. It is the Microsoft 365 edition. Older versions of the book, such as Version 2.0, are still found on the author’s website, but they were written earlier, so use the Access 365 edition if your lab runs a current Access.
How many chapters and exercises does it have?
There are 10 chapters and 2 appendices. Appendix A covers forms with subforms and Appendix B covers supertypes and subtypes. Most chapters end with exercises that use the Library, University and Company sample databases, which you can download from the book’s website.
Is it good for complete beginners?
Yes. The preface says the course it was written for has no prerequisites and is taken by students from many majors. You do not need earlier database knowledge, and the chapters start from what a table is. Chapter 10 on normalization is the hardest part, so give it extra time.
Do I need Microsoft Access to use it?
For the practical chapters, yes. Chapters 1 to 6 and Chapter 9 are taught with MS Access, a Windows desktop product, and the book does not cover other database systems. Chapters 7, 8 and 10 and Appendix B (ER modelling, mapping, normalization, supertypes) are general theory that you can follow without Access, and the SQL ideas carry over, although some data type names in the DDL chapter are Access-specific.
Does it cover ER diagrams, SQL and normalization?
Yes. Chapter 7 teaches ER diagrams in Chen notation, Chapter 8 maps them to relations, Chapter 6 covers the SQL Select statement with joins, Union and Union All, Chapter 9 covers CREATE TABLE, ALTER TABLE and CREATE INDEX, and Chapter 10 covers functional dependencies, 1NF and BCNF with 2NF and 3NF in the summary. Higher normal forms, transactions and NoSQL databases are outside its scope.
Related Books
- Database Management System – IT Series (3rd Edition)
- Foundations of Computer Science – Aho and Ullman (C Edition)
- The Concepts of Information Technology – IT Series (2nd Edition)
- Discrete Mathematics: An Open Introduction – Oscar Levin (4th Edition)
Relational Databases and Microsoft Access 365 gives you a hands-on start with a real database system and the design theory behind it, in one free book. Browse more Computer Science books for the rest of your semester.
Relational Databases and Microsoft Access 365 (Version 4.0) by Ron McFadyen. Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (https://creativecommons.org/licenses/by-nc-sa/4.0/). Published through eCampusOntario Pressbooks with funding from the Government of Ontario and eCampusOntario’s Virtual Learning Strategy. Official source: https://ecampusontario.pressbooks.pub/relationaldatabasesandmicrosoftaccess365/. This page links to the official site and does not host or copy the book; the summaries and study notes here are original.
© Copyright Policy
Freebooks.pk is an educational resource for students in Pakistan. Textbooks and other books belong to their respective boards, authors and publishers, and all rights remain with them. If you are the copyright holder of any material on this page and want it changed or removed, please contact us or file a request under our DMCA policy. We review every request and remove reported content promptly.
