华南理工大学期末考试真题+解析

题目	题型
T he collection of information stored in the database at a particular moment is called an () of the database. The overall design of the data base is called the database () .	填空
A relation schema is in ()normal from if for all in + , at least one of the following holds: is (); is a superkey for ; Each attribute in is contained in a candidate key for .	填空
Let be a relation schema , and from a decomposition of . Decomposition is a()if for all l egal database instances of , .	填空
In E-R model , on entity is represented by a set of() . A ()is an association among several entities .	填空
Assume relation has blocks and relation has blocks , therefore , in the best case , only ()block transfers would be required for .	填空
. An ideal hash function is () and() , the former require that each bucket is assigned the same number of search-key values form the set of all possible values.	填空
To generate query-evaluation plans for an expression we have to generate logically equivalent expressions using ().	填空
Consider a + - tree of order ,if there are search-key values in the file , the path form the root to the leaf mode is no longer than ().	填空
A transaction has the following properties: () , () , isolation and durability.	填空
When the final statement of a transaction has been executed , the transaction enters the () committed state . After a transaction has been rolled back and the database has been restored to its previous state , the transaction enter the ()state .	填空
A schedule is () if a transaction in needs a data item previously written by a transaction , then the commit operation of app e ars before the commit operation of .	填空
() attribute values or()attribute values are not atomic .	填空
. A relation schema may have an attribute that corresponds to the primary key of another relation . The attribute is called a ().	填空
Database design Ⅰ : Consider the following conditions	问答
In database design , how to represent relationship set as relational schemas ?	问答
Database design Ⅰ : Consider the following conditions	问答
Let be a relation with functional dependency a) Compute the candidate keys for ;	问答
BOOK ( Bookid , Title , Publishername )	问答
Query Processing , Optimization and Transaction	问答
Database design Ⅰ : Consider the following conditions	问答

题目

题型

T he collection of information stored in the database at a particular moment is called an () of the database. The overall design of the data base is called the database () .

填空

A relation schema is in ()normal from if for all in + , at least one of the following holds: is (); is a superkey for ; Each attribute in is contained in a candidate key for .

填空

Let be a relation schema , and from a decomposition of . Decomposition is a()if for all l egal database instances of , .

填空

In E-R model , on entity is represented by a set of() . A ()is an association among several entities .

填空

Assume relation has blocks and relation has blocks , therefore , in the best case , only ()block transfers would be required for .

填空