Deck 7: Security, Administration and Transaction Management

Full screen (f)
exit full mode
Question
Describe a general plan of action for initiating a security policy, elaborating on each stage that might be undertaken.
Use Space or
up arrow
down arrow
to flip the card.
Question
Detail the types of problems associated with microcomputer security and the types of countermeasures that could be installed against loss.
Question
Discuss the problems associated with microcomputer security, and contrast the measures required to provide a secure environment with those of a mainframe computing environment.
Question
Discuss the types of threat that might occur within the general database environment, and indicate the measures that could be taken to safeguard against them.
Question
Explain the integrity features that a database management system may provide making reference to the system used, and indicate the disadvantages that arise where they are not available.
Question
The increasing accessibility of databases on the Internet and intranets requires a reanalysis and extension of the normal approaches to security. Discuss some of the issues associated with the database system security in these environments.
Question
(a) Locking-based algorithms for concurrency control can be employed to synchronize the execution of transactions. Explain what is meant by a serializable schedule and show that the following locking-based schedule is not serializable:
S = [wl1(y), wl2(y), R1(y), W1(y), R2(y), W2(y), rl1(y), rl2(y), wl2(z), R2(z), W2(z), rl2(z), C2,
wl1(z), R1(z), W1(z), rl1(z), C1]
where Ri(x)/Wi(x) indicates a read/write by transaction i on data item x
rli(x)/wli(x) indicates a release/write lock by transaction i on item x
Ci indicates a commit operation by transaction i.
(b) Identify the problem with the above schedule, and produce a correct locking-based serializable schedule.
Question
'One of the potential advantages of Distributed Database Management Systems is improved reliability and availability.'
(a) The consistency and reliability aspects of transactions are due to the 'ACIDity' properties of transactions. Discuss each of these properties and how they relate to the concurrency control and recovery mechanisms. Give examples to illustrate your answer.
Question
(a) Produce a wait-for-graph for the transactions with locking information shown in Table 1. What can you conclude for this graph?
(a) Produce a wait-for-graph for the transactions with locking information shown in Table 1. What can you conclude for this graph?   (b) Compare and contrast the approaches to deadlock management in database systems.<div style=padding-top: 35px>
(b) Compare and contrast the approaches to deadlock management in database systems.
Question
The locking information for several transactions is shown in Table 2. Produce a wait-for-graph (WFG) for the transactions and determine whether deadlock exists.
The locking information for several transactions is shown in Table 2. Produce a wait-for-graph (WFG) for the transactions and determine whether deadlock exists.  <div style=padding-top: 35px>
Question
Locking-based algorithms for concurrency control can be employed to synchronize the execution of transactions. Explain the rules for two-phase locking in a centralized Database Management System and why each of these is necessary to avoid the database becoming inconsistent.
Question
A taxonomy of concurrency control algorithms can classify algorithms as pessimistic or optimistic. Compare and contrast these algorithms.
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/12
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 7: Security, Administration and Transaction Management
1
Describe a general plan of action for initiating a security policy, elaborating on each stage that might be undertaken.
First of all, the need for one must be appreciated, and there must be commitment on the part of senior managers. Depending on course coverage, an IT security team may be formed to oversee the development of the policy. They may decide on an information classification exercise for the area under consideration, then carry out a risk analysis. Following on from this, the policy will be prepared, specific responsibilities identified, and then standards and procedures formulated for implementation. The whole process is iterative, the policy should be continually refined. Certain aspects of the plan should be elaborated, such as, how information might be classified, how risk analysis might be carried out, what the policy should cover.
2
Detail the types of problems associated with microcomputer security and the types of countermeasures that could be installed against loss.
The data a PC holds may be considerably more valuable than the machine itself. We are concerned here with both data security and physical security. Some obvious precautions that concern the data. For example, careful storage of the media, regular backups taken that are labeled and classified if appropriate. Working procedures should be appropriately defined. Obvious physical security such as fixing the machine to a surface, using locks and/or alarming it. Other measures include using security programs, careful disposal of old media and equipment, staff training.
3
Discuss the problems associated with microcomputer security, and contrast the measures required to provide a secure environment with those of a mainframe computing environment.
The problems concern data security and physical security. Problems and precautions in dealing with these are generally as for part two of the previous question. It is important that a contrast is made with a mainframe environment. For example, in dealing with microcomputers, you are dealing with individual machines and staff, possibly over a wide location. Much of the responsibility rests with members of staff, consequently, all staff training is important. In the mainframe environment it is possible to set up centralized controls (physical and logical). Consequently, it should be an easier environment to control, with the responsibility residing in the IT manager.
4
Discuss the types of threat that might occur within the general database environment, and indicate the measures that could be taken to safeguard against them.
Unlock Deck
Unlock for access to all 12 flashcards in this deck.
Unlock Deck
k this deck
5
Explain the integrity features that a database management system may provide making reference to the system used, and indicate the disadvantages that arise where they are not available.
Unlock Deck
Unlock for access to all 12 flashcards in this deck.
Unlock Deck
k this deck
6
The increasing accessibility of databases on the Internet and intranets requires a reanalysis and extension of the normal approaches to security. Discuss some of the issues associated with the database system security in these environments.
Unlock Deck
Unlock for access to all 12 flashcards in this deck.
Unlock Deck
k this deck
7
(a) Locking-based algorithms for concurrency control can be employed to synchronize the execution of transactions. Explain what is meant by a serializable schedule and show that the following locking-based schedule is not serializable:
S = [wl1(y), wl2(y), R1(y), W1(y), R2(y), W2(y), rl1(y), rl2(y), wl2(z), R2(z), W2(z), rl2(z), C2,
wl1(z), R1(z), W1(z), rl1(z), C1]
where Ri(x)/Wi(x) indicates a read/write by transaction i on data item x
rli(x)/wli(x) indicates a release/write lock by transaction i on item x
Ci indicates a commit operation by transaction i.
(b) Identify the problem with the above schedule, and produce a correct locking-based serializable schedule.
Unlock Deck
Unlock for access to all 12 flashcards in this deck.
Unlock Deck
k this deck
8
'One of the potential advantages of Distributed Database Management Systems is improved reliability and availability.'
(a) The consistency and reliability aspects of transactions are due to the 'ACIDity' properties of transactions. Discuss each of these properties and how they relate to the concurrency control and recovery mechanisms. Give examples to illustrate your answer.
Unlock Deck
Unlock for access to all 12 flashcards in this deck.
Unlock Deck
k this deck
9
(a) Produce a wait-for-graph for the transactions with locking information shown in Table 1. What can you conclude for this graph?
(a) Produce a wait-for-graph for the transactions with locking information shown in Table 1. What can you conclude for this graph?   (b) Compare and contrast the approaches to deadlock management in database systems.
(b) Compare and contrast the approaches to deadlock management in database systems.
Unlock Deck
Unlock for access to all 12 flashcards in this deck.
Unlock Deck
k this deck
10
The locking information for several transactions is shown in Table 2. Produce a wait-for-graph (WFG) for the transactions and determine whether deadlock exists.
The locking information for several transactions is shown in Table 2. Produce a wait-for-graph (WFG) for the transactions and determine whether deadlock exists.
Unlock Deck
Unlock for access to all 12 flashcards in this deck.
Unlock Deck
k this deck
11
Locking-based algorithms for concurrency control can be employed to synchronize the execution of transactions. Explain the rules for two-phase locking in a centralized Database Management System and why each of these is necessary to avoid the database becoming inconsistent.
Unlock Deck
Unlock for access to all 12 flashcards in this deck.
Unlock Deck
k this deck
12
A taxonomy of concurrency control algorithms can classify algorithms as pessimistic or optimistic. Compare and contrast these algorithms.
Unlock Deck
Unlock for access to all 12 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 12 flashcards in this deck.