How to avoid and also solve the problems caused by non-repeatable read, dirty read, and phantom read in concurrent processing
Please be specific to the question and be as detailed as possible. Answer to be made in 4-6 pages.
There is NO NEED to explain what non-repeatable read, dirty read, phantom read , or concurrent processing is.
This is for a Masters level US computer science program.
This is just for your information: The problem may be addressed by Resource locking(Explicit and implicit locks, explicit/shared locks ) etc. But it is necessary to explain how these locks work specifically to solve the problem of non-repeatable read, dirty reads and phantom reads.
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | 7 |
8 | 9 | 10 | 11 | 12 | 13 | 14 |
15 | 16 | 17 | 18 | 19 | 20 | 21 |
22 | 23 | 24 | 25 | 26 | 27 | 28 |
29 | 30 | 1 | 2 | 3 | 4 | 5 |