The Global conceptual Schema in a distributed database contains information about global relations. The condition that all the data of the global relation must be mapped into the fragments, that is, it must not happen that a data item which belongs to a global relation does not belong to any fragment, is called:(A) Disjointness condition(B) Completeness condition(C) Reconstruction condition(D) Aggregation condition

The Global conceptual Schema in a distributed database contains inform

1.	The Global conceptual Schema in a distributed database contains information about global relations. The condition that all the data of the global relation must be mapped into the fragments, that is, it must not happen that a data item which belongs to a global relation does not belong to any fragment, is called:(A) Disjointness condition(B) Completeness condition(C) Reconstruction condition(D) Aggregation condition
Answer»

Discussion

No Comment Found

Related InterviewSolutions

Java uses threads to enable the entire environment to be ______.(A) Symmetric(B) Asymmetric(C) Synchronous(D) Asynchronous
What are the following sequence of steps taken in designing a fuzzy logic machine?(A) Fuzzification → Rule evaluation → Defuzzification(B) Fuzzification → Defuzzification → Rule evaluation(C) Rule evaluation → Fuzzification → Defuzzification(D) Rule evaluation → Defuzzification → Fuzzification
Consider the table R with attributes A, B and C. The functional dependencies that hold on R are : A → B, C → AB. Which of the following statements is/are True ?I. The decomposition of R into R1(C, A) and R2(A, B) is lossless.II. The decomposition of R into R1(A, B) and R2(B, C) is lossy.(A) Only I(B) Only II(C) Both I and II(D) Neither I nor II
The Liang-Barsky line clipping algorithm uses the parametric equation of a line from (x1, y1) to (x2, y2) along with itsinfinite extension which is given as :x = x1 + ∆x.uy = y1 + ∆y.uWhere ∆x = x2– x1, ∆y = y2– y1, and u is the parameter with 0 < u < 1. A line AB withend points A(–1, 7) and B(11, 1) is to be clipped against a rectangular window with xmin = 1, xmax = 9, ymin = 2, and ymax = 8. The lower and upper bound values of the parameter u for the clipped line using Liang-Barsky algorithm is given as :(A) (0, 2/3)(B) (1/6 , 5/6)(C) (0, 1/3)(D) (0, 1)
Consider a N-bit plane frame buffer with W-bit wide lookup table with W > N. How many intensity levels are available at a time ?(A) 2N(B) 2W(C) 2N+W(D) 2N-1
Suppose transmission rate of a channel is 32 kbps. If there are ‘8’ routes from source to destination and each packet p contains 8000 bits. Total end to end delay in sending packet P is _____.(A) 2 sec(B) 3 sec(C) 4 sec(D) 1 sec
In perspective projection (from 3D to 2D), objects behind the centre of projection are projected upside down and backward onto the view-plane. This is known as _____.(A) Topological distortion(B) Vanishing point(C) View confusion(D) Perspective foreshortening
A point P(2, 5) is rotated about a pivot point (1, 2) by 60°. What is the new transformed point P’ ?(A) (1, 4)(B) (–1, 4)(C) (1, – 4)(D) (– 4, 1)
Which of the following in 8085 microprocessor performs HL = HL + HL?(A) DAD D(B) DAD H(C) DAD B(D) DAD SP
8085 microprocessor has ____ bit ALU.(A) 32(B) 16(C) 8(D) 4

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment