Chapter 1. 2) Describe the two-tier client-server architecture and the three-tier client-server

Similar documents
MCQs~Databases~Relational Model and Normalization

A. TRUE-FALSE: GROUP 2 PRACTICE EXAMPLES FOR THE REVIEW QUIZ:

BCA. Database Management System

CS 377 Database Systems. Database Design Theory and Normalization. Li Xiong Department of Mathematics and Computer Science Emory University

ISM 318: Database Systems. Objectives. Database. Dr. Hamid R. Nemati

Chapter 5: Logical Database Design and the Relational Model Part 2: Normalization. Introduction to Normalization. Normal Forms.

The process of database development. Logical model: relational DBMS. Relation

3. Relational Model and Relational Algebra

Introduction to Databases

DATABASE MANAGEMENT SYSTEMS. Question Bank:

1. INTRODUCTION TO RDBMS

Announcements. SQL is hot! Facebook. Goal. Database Design Process. IT420: Database Management and Organization. Normalization (Chapter 3)

Databases What the Specification Says

IT2304: Database Systems 1 (DBS 1)

IT2305 Database Systems I (Compulsory)

SQL NULL s, Constraints, Triggers

Normalization of Database

Relational model. Relational model - practice. Relational Database Definitions 9/27/11. Relational model. Relational Database: Terminology

Relational Database Basics Review

Chapter 15 Basics of Functional Dependencies and Normalization for Relational Databases

Introduction This document s purpose is to define Microsoft SQL server database design standards.

Fundamentals of Database System

There are five fields or columns, with names and types as shown above.

Scheme G. Sample Test Paper-I

AVOIDANCE OF CYCLICAL REFERENCE OF FOREIGN KEYS IN DATA MODELING USING THE ENTITY-RELATIONSHIP MODEL

Introduction to Computing. Lectured by: Dr. Pham Tran Vu

Normalization. Functional Dependence. Normalization. Normalization. GIS Applications. Spring 2011

Chapter 5 More SQL: Complex Queries, Triggers, Views, and Schema Modification

SQL Simple Queries. Chapter 3.1 V3.0. Napier University Dr Gordon Russell

Demystified CONTENTS Acknowledgments xvii Introduction xix CHAPTER 1 Database Fundamentals CHAPTER 2 Exploring Relational Database Components

Section of DBMS Selection & Evaluation Questionnaire


Physical Database Design Process. Physical Database Design Process. Major Inputs to Physical Database. Components of Physical Database Design

DATABASE NORMALIZATION

Tutorial on Relational Database Design

CS2Bh: Current Technologies. Introduction to XML and Relational Databases. The Relational Model. The relational model

Databasesystemer, forår 2005 IT Universitetet i København. Forelæsning 3: Business rules, constraints & triggers. 3. marts 2005

Optimum Database Design: Using Normal Forms and Ensuring Data Integrity. by Patrick Crever, Relational Database Programmer, Synergex

C HAPTER 4 INTRODUCTION. Relational Databases FILE VS. DATABASES FILE VS. DATABASES

SQL Server. 1. What is RDBMS?

DBMS Questions. 3.) For which two constraints are indexes created when the constraint is added?

RELATIONAL DATABASE DESIGN. Basic Concepts

Oracle 10g PL/SQL Training

Chapter 6: Integrity Constraints


Triggers & Packages. {INSERT [OR] UPDATE [OR] DELETE}: This specifies the DML operation.

Chapter 5: FUNCTIONAL DEPENDENCIES AND NORMALIZATION FOR RELATIONAL DATABASES

The Relational Data Model and Relational Database Constraints

5. CHANGING STRUCTURE AND DATA

The Relational Model. Why Study the Relational Model? Relational Database: Definitions

Database Design Overview. Conceptual Design ER Model. Entities and Entity Sets. Entity Set Representation. Keys

Basic Concepts of Database Systems

COSC344 Database Theory and Applications. Lecture 9 Normalisation. COSC344 Lecture 9 1

LiTH, Tekniska högskolan vid Linköpings universitet 1(7) IDA, Institutionen för datavetenskap Juha Takkinen

Instant SQL Programming

Functional Dependencies and Finding a Minimal Cover

Database Constraints and Design

Course 20464: Developing Microsoft SQL Server Databases

Managing Objects with Data Dictionary Views. Copyright 2006, Oracle. All rights reserved.

Intermediate SQL C H A P T E R4. Practice Exercises. 4.1 Write the following queries in SQL:

If it's in the 2nd NF and there are no non-key fields that depend on attributes in the table other than the Primary Key.

Chapter 6: Physical Database Design and Performance. Database Development Process. Physical Design Process. Physical Database Design

David Dye. Extract, Transform, Load

Introduction to Triggers using SQL

C# Cname Ccity.. P1# Date1 Qnt1 P2# Date2 P9# Date9 1 Codd London Martin Paris Deen London

The Relational Data Model: Structure

Databases and BigData

Sample Fraction Addition and Subtraction Concepts Activities 1 3

Normalization in Database Design

Database Systems Concepts, Languages and Architectures

Fundamentals of Database Design

Functional Dependency and Normalization for Relational Databases

The Entity-Relationship Model

ETL Process in Data Warehouse. G.Lakshmi Priya & Razia Sultana.A Assistant Professor/IT

Relational Database Concepts

When to consider OLAP?

Developing Microsoft SQL Server Databases MOC 20464

RELATIONAL DATABASE DESIGN

Developing Microsoft SQL Server Databases 20464C; 5 Days

Data Dictionary and Normalization

Normalization. CIS 3730 Designing and Managing Data. J.G. Zheng Fall 2010

The Relational Model. Why Study the Relational Model?

1.264 Lecture 10. Data normalization

A basic create statement for a simple student table would look like the following.

CSC 443 Data Base Management Systems. Basic SQL

14 Databases. Source: Foundations of Computer Science Cengage Learning. Objectives After studying this chapter, the student should be able to:

Using SAS as a Relational Database

Would-be system and database administrators. PREREQUISITES: At least 6 months experience with a Windows operating system.

Performance Evaluation of Natural and Surrogate Key Database Architectures

Introduction to normalization. Introduction to normalization

Outline. Data Modeling. Conceptual Design. ER Model Basics: Entities. ER Model Basics: Relationships. Ternary Relationships. Yanlei Diao UMass Amherst

Bridge from Entity Relationship modeling to creating SQL databases, tables, & relations

ICAB4136B Use structured query language to create database structures and manipulate data

Physical Database Design and Tuning

20464C: Developing Microsoft SQL Server Databases

Normalisation 6 TABLE OF CONTENTS LEARNING OUTCOMES

1. Physical Database Design in Relational Databases (1)

Relational Data Analysis I

Transcription:

Chapter 1 1) Discuss the meaning of each of the following terms: (a) data (b) database (c) database management system (d) application program (e) data independence (f) views. 2) Describe the two-tier client-server architecture and the three-tier client-server architecture. 3) Describe the problems with the two-tier client-server architecture and discuss how these problems were overcome with the three-tier client-server architecture. 4) Discuss the advantages and disadvantages of DBMSs. 5) Define three principal integrity rules for the relational model. 6) Describe with a schema the main phases involved in database design 7) Give the difference between conceptual database design and logical database design. 8) A transaction is ACID. Explain this sentence. 9) Give an illustrative example of a transaction

Chapter Relational Model 1) Discuss each of the following concepts in the context of the relational data model: (a) relation (b) attribute (c) domain (d) tuple (e) relational database. 2) Discuss the properties of a relational table. 3) What does a null represent? QMC Row is synonymous with the term: A. record. B. relation. C. column. D. field. When the values in one or more attributes being used as a foreign key must exist in another set of one or more attributes in another table, we have created a(n): A. transitive dependency. B. insertion anomaly. C. referential integrity constraint. D. normal form. A relation is considered a: A. Column. B. one-dimensional table. C. two-dimensional table. D. three-dimensional table.

In the relational model, relationships between relations or tables are created by using: A. composite keys. B. determinants. C. primary keys. D. foreign keys. Table is synonymous with the term: A. record. B. relation. C. column. D. field. Which of the following is not a restriction for a table to be a relation? A. The cells of the table must contain a single value. B. All of the entries in any column must be of the same kind. C. The columns must be ordered. D. No two rows in a table may be identical. An attribute is a(n): A. column of a table. B. two dimensional table. C. row of a table. D. key of a table. A tuple is a(n): A. column of a table. B. two dimensional table. C. row of a table. D. key of a table.

(T or F) A tuple is a group of one or more columns that uniquely identifies a row. It is possible to have a relation that does not have a primary key. A primary key can be composed of a group of attributes taken together. A row can be uniquely identified by a key. A referential integrity constraint limits the values of a foreign key. Fill in the blanks A relation. A) has rows containing data about an entity B) has columns containing data about attributes of the entity C) has cells that hold only a single value D) has no two identical rows E) All of the above. A relation is also known as a(n). A) table B) tuple C) relationship D) attribute E) field A tuple is also known as a(n). A) table B) relation C) row D) field E) file An attribute is also known as a(n). A) table B) relation C) row D) field E) file A key consisting of one or more columns that is a primary key in another relation is a(n). A) composite primary key B) primary key C) foreign key D dependency

Chapter Normalization Every time attribute A appears, it is matched with the same value of attribute B, but not the same value of attribute C. Therefore, it is true that: A. A B. B. A C. C. A (B,C). D. (B,C) A. The different classes of relations created by the technique for preventing modification anomalies are called: A. normal forms. B. referential integrity constraints. C. functional dependencies. D. None of the above is correct. A functional dependency is a relationship between or among: A. tables. B. rows. C. relations. D. attributes.

For some relations, changing the data can have undesirable consequences called: A. referential integrity constraints. B. modification anomalies. C. normal forms. D. transitive dependencies. If attribute A determines both attributes B and C, then it is also true that: A. A B. B. B A. C. C A. D. (B,C) A. If attributes A and B determine attribute C, then it is also true that: A. A C. B. B C. C. (A,B) is a composite determinant. D. C is a determinant. Normalization is a process used to deal with which of the following modification anomalies? A) Insertion anomaly B) Update anomaly C) Deletion anomaly D) A and B E) A, B and C

Fill in the blanks If the removal of facts about one entity results in the unintentional lose of data about another entity, this is referred to as a(n). A) normalization anomaly B) insertion anomaly C) update anomaly D) deletion anomaly E) removal anomaly Suppose that you need to update one value of the column SalesCost in a relation. The way the relation is constructed, this value actually needs to be changed in three different rows. However, you only change the value in two of the rows. You have just created an a(n). A) normalization anomaly B) insertion anomaly C) update anomaly D) deletion anomaly E) removal anomaly A table that meets the definition of a relation is in. A) First Normal Form B) Second Normal Form C) Third Normal Form D) Boyce-Codd Normal Form E) Fourth Normal Form If by knowing the value of A we can find the value of B, then we would say that B is on A. Given the functional dependency A (B, C), then it is true that and. A(n) is one or more columns in one relation that also is the primary key in another table. If a table is a relation then it is in. Saying that two entities are functionally dependent means that. A) the entities are always connected by a mathematical equation B) for one of the entities, if we are given the value of that entity, we can determine the value of one other entity C) for both of the entities, if we are given the value of that entity, we can determine the value of one other entity D) the functional dependency will have to be removed through normalization E) All of the above. Given the functional dependency A (B, C), A is a(n). A) independent variable B) dependent variable C) determinant

D) composite determinant E) C and D Given the functional dependency (A, B) C, then. A) A B B) A C C) B A D) B C E) None of the above is correct. (T or F) Attribute Y is functionally dependent on attribute X if the value of attribute X determines the value of Y. The functional dependency noted as A B means that the value of A can be determined from the value of B. In the functional dependency shown as A B, B is the determinant. Functional dependencies can involve groups of attributes. A determinant of a functional dependency may or may not be unique in a relation. Undesirable consequences of changing the data in a relation are called "modification anomalies." Any table that meets the definition of a relation is in 2NF. Breaking a relation into two relations may create the need for a referential integrity constraint to be defined between the two relations.

Chapter SQL 1) What are the two major components of SQL and what function do they serve? 2) Explain the function of each of the clauses in the SELECT statement (they are given in the execution order). What restrictions are imposed on these clauses? FROM WHERE GROUP BY HAVING SELECT ORDER BY 3) Explain how the GROUP BY clause works. What is the difference between the WHERE and HAVING clauses? 4) Describe the alternative strategies that can be applied if there is a child record referencing a parent record that we wish to delete.