Q1. Describe the lost update, dirty read and wrong summary problems related with transactions.
Q2. What do you mean by timestamp? How does the system produce timestamps? Describe the timestamp ordering protocol for the concurrency control.
Q3. Stable storage can’t be implemented.
a) Describe why it can’t be.
b) Describe how database systems deal with this problem.
Q4. Suppose that instant modification is used in a system. Show, by an illustration, how an inconsistent database state could outcome if log records for a transaction are not output to stable storage prior to data updated by transaction being written to the disk.
Q5. Define the term data warehouse. Describe the characteristics or features of the data warehouse.
Q6. Describe knowledge discovery in the databases. Describe the role of data mining in it.
Q7. Define the tern distributed database. Distinguish between distributed and parallel databases. As well illustrate some merits of distributed databases.
Q8. Write brief notes on any three of the given:
a) Lossless join decomposition and dependency preservation.
b) Multivalued dependency and join dependency.
c) ACID properties of Transactions
d) Strict and conservative two phase locking protocol.
e) Database security.