1. Question 1: Basic Concepts (45 %)
國立東華大學 試題: 高等資料庫系統
系所：資管碩士班 日期：2010年11月23日 第1頁/共4頁
Question 1: Basic Concepts (45 %)
What is the Candidate key?
What is the Primary Key?
What is Entity Integrity Rule?
Explain what is the Referential Integrity Rule?
Explain the basic approaches of a DBMS based Information System.
How index are used?
Discuss the update operations on views of the relational model.
What are the advantages of the View?
What information are stored in the system catalog for a database?
What is “SSA: Segment Search Arguments” in the Hierarchical Database Model?
IDMS, Communication Block is similar to SQLCA in DB2, please explain it?
Logic Data Independence
Clustering Index
Using “update anomalies” concept, discuss the 1NF and 2NF.
Using “update anomalies” concept, discuss the 3NF.

2. Question 2: Foreign Key Statement (12 %)
Consider the following statements:
CREATE TABLE SP
(S# S# NOT NULL, P# P# NOT NULL,
QTY QTY NOT NULL,
PRIMARY KEY (S#, P#),
FOREIGN KEY (S#) REFERENCE S
ON DELETE CASCADE
ON UPDATE CASCADE,
FOREIGN KEY (P#) REFERENCE P
ON DELETE Restricted
ON UPDATE Restricted,
CHECK (QTY>0 AND QTY<5001));
reference S# S1 S2 P# P2 P3 P1
QTY . SP
Foreign keys, FK S3
SNAME
. . . S
PNAME P
If user issues the following comments, what will be happen?
DELETE FROM S WHERE S#='S1’
DELETE FROM P WHERE P#=‘P2’
DELETE FROM SP WHERE P#=‘P2’
DELETE FROM SP WHERE S#='S1’

3. Question 3: Relational Algebra (12 %)
Draw the simple diagrams to show the 8 operations of the Relational Algebra.
Relational Algebra is a procedure language or an non-procedure? Why?
How to define the non-primitive operator JOIN by the following primitive operators?
1. UNION
2. DIFFERENCE
3. CARTESIAN PRODUCT
4. RESTRICT
5. PROJECT
討論 Relational Algebra and Relational Calculus 之異同，並說明它們與 SQL 之關係

4. Question 4: Indexing with Multiple Fields (12 %)
Consider the following relation with two indexes:
Fig. 6.3: Indexing the supplier file on both CITY and STATUS.
London
Paris
Athens S1 S2 S3 S4 S5
Smith
Jones
Blake
Clark
Adams 20 10 30
CITY-index S
Status-index
Explain the procedure to do the query: “Find the supplier number of suppliers in Paris?” step by step and show the output results.
How many disk I/O are needed to get S3 if we query: “Find the supplier number of suppliers in Paris”?
Explain the procedure to do the query: “Find the suppliers in Paris with status 30?” step by step and show the output results.

5. Question 5: About B+-tree (Knuth's variation) (12 %)
index set
(nondense)
Sequence set
(with pointers
to data records)
(dense or nondense) -
Explain the “nondense” in the index set?
Explain the meaning of “with pointers to data records”
In the B+-tree, how to print out all records by the order of the primary keys?
討論 B+-tree and B-tree 之異同?

6. Question 6: Good and Bad Decomposition (7 %)
Consider S#
CITY
STATUS
transitive FD
Suppose 1. CITY is the main office of the supplier.
2. STATUS is some factor of CITY S#
STATUS
CITY S#
STATUS
CITY S#
CITY
STATUS
② Decomposition B:
SC:
CS: S#
CITY
STATUS
①Decomposition A:
SC:
CS:
③ Decomposition C:
S# -> status
city -> status
Which one is the best? Why?
If STATUS is some factor of the Supplier, which one is the best? Why? Or we don’t have to do decomposition? Why?