Reference no: EM1379652
Assignment 6.2
Suppose your database system has failed. Describe the database recovery process and the use of deferred-write and write-through techniques.
Suppose you are asked to evaluate a DBMS in terms of lock granularity and the different locking levels. Create a simple database environment in which these features would be important.
Research the Dining Philosophers problem on the Internet. Summarize what you find and explain how this classic problem relates to deadlock and concurrency control. Explain how you could prevent this problem from occurring.
There are several different kinds of locks used with databases. Using your text, the Internet, and any other sources you have available, study the concept of locking. Briefly describe each type of lock that you uncover during your studies, along with its advantages and disadvantages.
Write or find (online) SQL statements that might be used in transaction management and explain how they work. Here's an example with the answer:
The following transaction registers the credit sale of a product to a customer. Start transaction
INSERT INTO INVOICE -- Add record to invoice
(INV_NUM, INV_DATE, ACCNUM, TOTAL)
UPDATE INVENTRY -- Update the quantity on hand of the product
SET ON_HAND = ON_HAND - 100
WHERE PROD_CODE = '345TYX';
UPDATE ACCREC -- Update the customer balance account
The above statement have accomplished:
Create the invoice record.
Update the inventory data.
Update the customer account data.
The DBMS will ensure that all SQL statements are executed and completed before committing all work. If, for any reason, one or more of the SQL statements in the transaction cannot be completed, the entire transaction is aborted and the database is rolled back to its previous consistent state.
Assignment 6.3
This is a group assignment.
Make sure that your E-R diagram and your data dictionary are accurate in every detail. (entities and attributes are the same.)
Use the group E-R diagram and data dictionary from the previous two weeks to develop SQL statements that will create tables.
After your tables are created, enter a minimum of 3 sets of data for each table.
Use the SQL examples from the last two weeks and anything you can find on the Internet as examples on how to write the SQL instructions.
Attach your SQL code for creating the tables and adding data to each table to this assignment in a single text document. Post your the ERD and Data Dictionary that you use to generate your code to your file exchange.
Note: The attached pvfc1.txt file used in week 1 is an example of what you code should look like. Except that your code should include comments for each block of text.
Attachment:- Full_Requirement.zip
Compute the cost of 1 mbyte of main memory
: Describe the meaning of Tc, Cc, Tm and Cm and compute the cost of 1 MByte of main memory using the above parameters.
|
Computing the access time
: Main memory uses a block transfer capability & has 1st word (four bytes) access time of fifty ns and access time for following words as 5 ns.
|
Determine the format of main memory address
: Given that a system has two way set associative cache of size eight KBytes, with sixteen bytes cache lines, and a byte-addressable main memory of size 64 MBytes.
|
Creating programs to compute
: Compare zero-, one-, two-, and three-address machines through writing programs to compute X = (A+B X C)/D - E X F)
|
Evaluate a dbms in terms of lock granularity
: Suppose you are asked to evaluate a DBMS in terms of lock granularity and the different locking levels. Create a simple database environment in which these features would be important.
|
Creating a c++ program
: A text document with machine code for little man's computer following instruction set. Instructions are in different lines.
|
Define cache and its purpose
: Describe what a cache is and what its purpose is. Also explain what data gets placed into the cache, and when it is put there.
|
Direct mapped cache- word, block, tag
: Think about a byte addressable computer with twenty-four bit addresses, a cache capable of storing a total of 64KB of data, and blocks of 32 bytes.
|
Find the sizes of the tag, block and word fields
: Assume that a computer using direct mapped cache has 2^24 words of main memory and a cache of sixty-four blocks, where each cache block contains sixteen words.
|