edited by
2,234 views
3 votes
3 votes

Match the following $:$

$\begin{array} {clcl}   & \textbf{List – I} && \textbf{List – II} \\  \text{a.} & \text{Secondary Index} & \text{i.} & \text{Functional Dependency} \\ \text{b.} & \text{Non-procedural Query language} & \text{ii.} & \text{B-tree} \\  \text{c.} & \text{Closure of set of attributes} & \text{iii.} & \text{Relational Algebric Operation} \\  \text{d.} & \text{Natural JOIN} & \text{iv.} & \text{Domain Calculas} \\  \end{array}$

$\textbf{Codes :}$

  1. $\text{a-i, b-ii, c-iv, d-iii}$
  2. $\text{a-ii, b-i, c-iv, d-iii}$
  3. $\text{a-i, b-iii, c-iv, d-ii}$
  4. $\text{a-ii, b-iv, c-i, d-iii}$
edited by

1 Answer

Best answer
4 votes
4 votes

It is easy to observe that

B-tree has secondary index 

 Natural join is Relational Algebraic Operation

Closure of set of attributes is related to Functional Dependency

Non-procedural Query language is related to  Domain Calculus

Hence ans is D

Primary index:

A primary index is an index on a set of fields that includes the unique primary key for the field and is guaranteed not to contain duplicates. eg. Employee ID can be Example of it.

Secondary index:

A Secondary index is an index that is not a primary index and may have duplicates. eg. Employee name can be example of it. Because Employee name can have similar values.

selected by
Answer:

Related questions

3 votes
3 votes
1 answer
1
go_editor asked Jul 29, 2016
1,731 views
Armstrong $(1974)$ proposed systematic approach to derive functional dependencies. Match the following w.r.t functional dependencies:$\begin{array}{} & \textbf{List-I} ...
4 votes
4 votes
1 answer
4
go_editor asked Jul 29, 2016
2,414 views
Consider the following ER diagram:The minimum number of tables required to represent $M, N, P, R_1, R_2$ is2345