In Section 24.5.1 when discussing naming transparency, we proposed the use of aliases to uniquely identify each replica of each fragment. Provide an outline design for the implementation of this approach to naming transparency.
What will be an ideal response?
FUNCTION map(name)
{
IF name appears in the replica table
THEN
result = name of replica of name;
IF name appears in the fragment table
THEN {
result = expression to construct fragment;
FOR each iname IN result {
replace iname in result with map(iname);
}
}
RETURN result;
}
IF name appears in the alias table
THEN
expression = map(name);
ELSE
expression = name;
You might also like to view...
Which of these is not an example of a "real-life" collection?
a. The cards you hold in a card game. b. Your favorite songs stored in your computer. c. The players on a soccer team. d. The number of pages in a book.
The feature that enables multiple reviewers to critique a document and insert suggestions or questions is referred to as __________.
Fill in the blank(s) with the appropriate word(s).
A(n) ________ is a data file that contains characters, such as letters, numbers, and symbols, including punctuation and spaces.
Fill in the blank(s) with the appropriate word(s).
On average, __________ of all possible keys must be tried in order to achieve success with a brute-force attack.
A. one-fourth B. half C. two-thirds D. three-fourths