search
Log In
0 votes
102 views

Q Consider a relation R(a, b, c) ordered on a non-key attribute b, and an index is maintained on attribute c. To evaluate the following expression, which is a better order of operation? σ(b=‘abc’∧c=12)(R)

A. First filter tuples using index on c and then search for b

B. First search tuples for the given value of b and then use index on c

C. The order of operation does not matter

D. Insufficient data to answer

 

in Databases 102 views
0
d?
0
Yes plz explain

Please log in or register to answer this question.

Related questions

1 vote
1 answer
1
335 views
The minimum number of nodes (both leaf and non-leaf) of $B^{+}$ tree index required for storing $5500$ keys and order of $B^{+}$ tree is $8$________________(order is max pointers a node can have) See here first level should be divide by $7$ $2nd$ levelshould divide by ... each $7$ pointer of 1st level has $8$ pointer in 2nd level. Am I missing something?? But in ans they divided by only $8$ :(
asked May 17, 2019 in Databases srestha 335 views
1 vote
0 answers
2
226 views
Consider the following statement below: $A)$ A clustered index may be either sparse or dense. $B)$ Every $B^{+}$ tree index is dense. Which of the above statement is true? Is clustering Index can be dense. Dense means non-ordering field, but clustering field should be ordering field right??
asked May 13, 2019 in Databases srestha 226 views
1 vote
0 answers
3
153 views
Construct a $B^+$-tree for the following set of key values: $(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)$ Assume that the tree is initially empty and values are added in ascending order. Construct B+-trees for the cases where the number of pointers that will fit in one node is as follows: a. Four b. Six c. Eight
asked Apr 1, 2019 in Databases akash.dinkar12 153 views
0 votes
2 answers
4
169 views
Is it possible in general to have two primary indices on the same relation for different search keys ? Explain your answer.
asked Apr 1, 2019 in Databases akash.dinkar12 169 views
...