
Concept explainers
A.
Explanation of Solution
“Yes”, SQL server supports both locking such as optimistic and pessimistic.
Reason:
The SQL server supports the optimistic and pessimistic locks.
Optimistic lock:
- Multiple users can update the data and it gets lock after the transaction has been processed in optimistic lock. It can be used for web applications.
- There is no conflict occur during transaction. If conflict occurs then it can be repeated until no conflict.
- There is no need to lock the
database resources and it prevents database from deadlocks. - The disadvantage is that it allows the applications from selecting and modifying the same data...
B.
Explanation of Solution
Transaction Isolation Level:
The transaction isolation level gives the measure of the extent to which transaction isolation succeeds.
- This process is defined by the presence or the absence of the phenomena such as dirty read, nonrepeatable reads, and phantom read.
- These problems occur when we read data from the database.
There are four levels of transactions. They are,
- Read uncommitted isolation level
- Read committed isolation level
- Repeatable reads isolation level
- Serializable isolation level
Read uncommitted isolation level:
Read uncommitted isolation level is the lowest isolation level which allows dirty reads, nonrepeatable reads, and phantom reads.
- It makes the transaction to read any data currently on a data page irrespective of the data has been committed.
- The uncommitted read isolation level applies to read-only operations like SELECT, SELECT INTO, and FETCH.
- The uncommitted read should not be applied for the cases where the answer must be accurate.
- The uncommitted read does affect other transactions.
Read committed Isolation level:
Read committed Isolation level allows nonrepeatable reads and phantom reads but it prevents dirty read...
C.
Explanation of Solution
Cursor:
The term cursor is used to retrieve the information in row by row manner. If the records stored in the database table, which needs to be updated one row at a time is carried over by cursor.
- It plays the major role for fetching a required row from the table in the database which holds numerous records.
- Cursors are defined using SELECT statement.
- It points the set of rows which is resulted from an SQL SELECT statement.
- In general the cursor is placed in the first or last row.
- It influences the performance of the SQL Server as it uses the SQL server instances memory, decrease network bandwidth, and reduction in concurrency.
- It’s recommended to avoid the use of cursor and the cursor can be replaced with WHILE loop, temporary tables, and sub queries.
- The types of cursor are listed below:
- Forward-only cursor
- Static cursor
- Dynamic cursor
- Keyset cursor
Forward-only cursor:
Forward-only cursor is used for fastest retrieval of data from the database. It is the fastest cursor among all the cursors but with the drawback it does not support backward scrolling.
- Data deletion, updating the data can be done using the Forward-Only cursor.
- It is sensitive as any changes made in the database will affect the original data source...
D.
Explanation of Solution
Difference between Security model for SQL server and figure 6-16:
Note: Refer Figure 6-16 in textbook: “A model of DBMS security”
Security model for SQL server | Security model for database Management system |
It provides the security architecture to permit the database developer to make secure database application and counter threats. |
It provides the |
It contains the hierarchical set of entities with server. Each and every server contains multiple databases, and each and every database contains set of securable objects... |
E.
Explanation of Solution
Types of SQL server backup:
There are different types of SQL server backups. They are,
- Full backup
- Differential backup
- Transaction log backup
- Database file and Filegroup backups
Full backup:
The full backup in SQL server is simple type of backup which does not depends on recovery model.
- It backs up the any type of activity during the backup.
- It backs up any type of uncommitted transactions in transaction log file.
Differential backup:
The differential backup helps to reduce the time for restoring the modified database.
- It backs up the portion of database that have modified since final full database backup.
- It backs up any type of activity during differential backup and also any type of uncommitted transactions in transaction log file...
F.
Explanation of Solution
SQL server recovery models:
There are three different types of recovery models in SQL server. They are,
- Simple
- Full
- Bulk-logged
Simple:
Simple recovery model helps to maintains smallest quantity of information in transaction log.
- Simple recovery model restores the data from full or differential backups. It requires less administration power and easy to manage than full or bulk-logged model.
- It expense high data loss when data file damages occurs.
- The benefits allows the high-performance copy operation.
- The drawback of the simple model is changes because database or differential backup must need to be rebuild...

Want to see the full answer?
Check out a sample textbook solution
Chapter 6 Solutions
EBK DATABASE CONCEPTS
- Problem 4 Number of needed subnets 750 Network Address 190.35.0.0 joy worl Subnetting Show your work for Problem Address class B Default subnet mask 255.255.0.0 Custom subnet mask 255.255.255.122 Total number of subnets 1024 Total number of host addresses Number of usable addresses Number of bits borrowed What is the 15th subnet range? What is the subnet number for the 13th subnet? What is the subnet broadcast address for the 10th subnet? What are the assignable addresses for the 6th subnet? 64 65,536 62 32,768 8 10 16,384 512 1,024 2,048 4,096 8,192 16,384 32,768 65,536 256 128 64 32 16 8,192 4,096 2048 1024 512 128 256. 32 16 8 4 2 1 0 0 o O O O O 4 91 8 32 64 +9 821 32 16 8 4 Number of Hosts Number of Subnets Binary values 190. 35 Solve with the right pictures 00 99999arrow_forward5. Task 5: Write a function that takes an array and its size as parameters and returns the sum of its elements(Homework)arrow_forward4.13 Extract a 3×3 array from the upper left-hand corner of the magic square you created in 4.11. Is this also a magic square?arrow_forward
- a If an M/M/1 queue in a server has task arrivals at a rate of 30 per second and serves at a rate of 50 per second, how many tasks are in the system (waiting and being served) on average? b In part (a), how many tasks are being served, on average? c What is the utilization of an M/M/1 queue in a server that has four tasks waiting on average?arrow_forwardEvaluate the average gate capacitance of, and power dissipated by, a processor with the following properties: • Gate oxide thickness = 1.4 nm• Gate length = 65 nm• Gate area = (65 nm)x(65 nm)• Permittivity of free space = 8.85 x 10e−12 Farads/m • Relative permittivity of SiO2 = 3.9 • Rail-to-rail voltage = 1.1 V• Clock frequency = 3.6 GHz• Switching probability = 1.0• Number of transistors per die = 1.3 x 10e9arrow_forwardCan you conver the following C code into ARM Assembly. Assume a is X0 and b is X1if ((a !=0) && (b == 0)) {a++} else {b++}arrow_forward
- Please help. Matlab for engineers 6th edition question.arrow_forwardA certain proram takes 26.67 seconds to run on 3 processors and 16 s to run on 7 processors. Find the execution time on one processor, the fraction of the program that can be parallelized, the theoretical execution time on an infinite number of processors, and P1/2arrow_forwardCan you write the following C code into ARM Assembly. Assume x is X0 and y is X1:switch ( x ) {case 0 : y++; break ;case 1 : y−−; break ;default : break ;}arrow_forward
- Can you write the following C code into ARM Assembly? Assume a is in X0 and b is in X1:while ( a < 10){b=b +10;a++;}arrow_forward# Instructions a. 1.00E+09 b. 1.00E+09 Compiler A Compiler B Execution time #Instructions Execution time 1s 1.20E+09 1.4 s 0.8 s 1.20E+09 0.7 s 1.6.1 [5] For the same program, two different compilers are used. The table above shows the execution time of the two different compiled programs. Find the average CPI for each program given that the processor has a clock cycle time of 1 nS. 1.6.2 15] Assume the average CPIs found in 1.6.1, but that the compiled programs run on two difference processors. If the execution times on the two processors are the same, how much faster is the clock of the processor running compiler A's coce versus the clock of the processor running compiler B's code? 1.6.3 [5] A new compiler is developed that uses only 600 million instruc- tions and has an average CPI of 1.1. What is the speed-up of using this new compiler versus using Compiler A or B on the original processor of 1.6.1? Consider two different implementations, P1 and P2, of the same instruction set.…arrow_forwardExercise 1.4 Consider two different implementations of the same instruction set architecture. There are four classes of instructions, A, B, C, and D. The clock rate and CPI of each implementation are given in the following table. CPI Class B CPI Class C CPI Class D Clock rate CPI Class A P1 1.5 GHz 1 2 3 P2 2 GHz 2 2 2 4 2 1.4.1 [10] Given a program with 10" instructions divided into classes as follows: 10% class A, 20% class B, 50% class C and 20% class D, which implemen- tation is faster? 1.4.2 [5] What is the global CPI for each implementation? 1.4.3 [5] Find the clock cycles required in both cases. The following table shows the number of instructions for a program. Arith 500 Store 50 Load 100 Branch 50 Total 700 1.4.4 [5] Assuming that arith instructions take I cycle, load and store 5 cycles and branch 2 cycles, what is the execution time of the program in a 2 GHz processor? 1.4.5 [5] Find the CPI for the program. 1.4.6 [10] If the number of load instructions can be reduced…arrow_forward
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY





