menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

DBMS Korth Edition 4 Exercise 12 Question 3 (Page No. 489)

0 votes
73 views
What is the difference between a primary index and a secondary index ?
in Databases 73 views

1 Answer

0 votes
In primary index data is ordered whereas  in secondary index data is unordered
← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

1 vote
4 answers
1
334 views
DBMS Korth Edition 4 Exercise 12 Question 4 (Page No. 489)
Is it possible in general to have two primary indices on the same relation for different search keys ? Explain your answer.
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 334 views
0 votes
0 answers
2
88 views
DBMS Korth Edition 4 Exercise 12 Question 2 (Page No. 489)
Since indices speed query processing, why might they not be kept on several search keys ? List as many reasons as possible.
Since indices speed query processing, why might they not be kept on several search keys ? List as many reasons as possible.
asked Apr 1, 2019 in Databases akash.dinkar12 88 views
0 votes
0 answers
3
78 views
DBMS Korth Edition 4 Exercise 12 Question 1 (Page No. 489)
When is it preferable to use a dense index rather than a sparse index ? Explain your answer.
When is it preferable to use a dense index rather than a sparse index ? Explain your answer.
asked Apr 1, 2019 in Databases akash.dinkar12 78 views
1 vote
0 answers
4
209 views
DBMS Korth Edition 4 Exercise 12 Question 5 (Page No. 490)
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
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 209 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...