In rank() function if one value is shared by two tuples then

Related MCQs

• Which one of the following provides the ability to query information from the database and to insert tuples into, delete tuples from, and modify tuples in the database?
• Suppose now that R(A,B:) and S(A,B:) are two relations with r and s tuples, respectively (again, not necessarily distinct). If m is the number of (not necessarily distinct) tuples in the result of the SQL query: R intersect S; Then which of the following is the most restrictive, correct condition on the value of m?
• A                  on an attribute of a relation is a data structure that allows the database system to find those tuples in the relation that have a specified value for that attribute efficiently, without scanning through all the tuples of the relation.
• If there are n tuples in the partition and the rank of the tuple is r, then its                  is defined as (r −1)/(n−1).
• In a                            operations do not wait for requests to produce tuples, but instead generate the tuples eagerly.
• The           operation allows the combining of two relations by merging pairs of tuples, one from each relation, into a single tuple.
• Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.
• Inorder to simplify the null value confusion in the rank function we can specify
• The result which operation contains all pairs of tuples from the two relations, regardless of whether their attribute values match.
• Using the              clause retains only one copy of such identical tuples.