Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Slides
Recent questions tagged indexing
47
votes
3
answers
31
GATE CSE 2020 | Question: 54
Consider a database implemented using $\text{B+}$ tree for file indexing and installed on a disk drive with block size of $\text{4 KB}$. The size of search key is $\text{12 bytes}$ ... that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is _______
Consider a database implemented using $\text{B+}$ tree for file indexing and installed on a disk drive with block size of $\text{4 KB}$. The size of search key is $\text{...
Arjun
22.3k
views
Arjun
asked
Feb 12, 2020
Databases
gatecse-2020
numerical-answers
databases
b-tree
indexing
2-marks
+
–
3
votes
2
answers
32
Made Easy Test Series:Database-Indexing
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$ ... pointer of 1st level has $8$ pointer in 2nd level. Am I missing something?? But in ans they divided by only $8$ :(
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 ...
srestha
1.4k
views
srestha
asked
May 17, 2019
Databases
databases
made-easy-test-series
indexing
+
–
2
votes
1
answer
33
Made Easy Test Series:Databases-Indexing
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??
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...
srestha
1.7k
views
srestha
asked
May 13, 2019
Databases
databases
indexing
made-easy-test-series
+
–
2
votes
1
answer
34
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...
akash.dinkar12
1.5k
views
akash.dinkar12
asked
Apr 1, 2019
Databases
korth
databases
indexing
b-tree
descriptive
+
–
1
votes
4
answers
35
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.
akash.dinkar12
1.4k
views
akash.dinkar12
asked
Apr 1, 2019
Databases
korth
databases
indexing
descriptive
+
–
0
votes
1
answer
36
DBMS Korth Edition 4 Exercise 12 Question 3 (Page No. 489)
What is the difference between a primary index and a secondary index ?
What is the difference between a primary index and a secondary index ?
akash.dinkar12
321
views
akash.dinkar12
asked
Apr 1, 2019
Databases
korth
databases
indexing
descriptive
+
–
0
votes
0
answers
37
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.
akash.dinkar12
311
views
akash.dinkar12
asked
Apr 1, 2019
Databases
korth
databases
indexing
descriptive
+
–
0
votes
0
answers
38
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.
akash.dinkar12
252
views
akash.dinkar12
asked
Apr 1, 2019
Databases
korth
databases
indexing
descriptive
+
–
2
votes
1
answer
39
nptel pdf
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 ... 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
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 orde...
adityaaswal
659
views
adityaaswal
asked
Mar 12, 2019
Databases
databases
indexing
+
–
3
votes
1
answer
40
Ace Test Series: DBMS - File Indexing
Na462
1.8k
views
Na462
asked
Jan 26, 2019
Databases
indexing
databases
ace-test-series
+
–
0
votes
1
answer
41
indexing
among primary index, secondary index, clustered index which index are dense or sparse or both?
among primary index, secondary index, clustered index which index are dense or sparse or both?
Rahul_Rathod_
814
views
Rahul_Rathod_
asked
Jan 22, 2019
Databases
indexing
databases
+
–
1
votes
0
answers
42
self_doubt
I am confused about indexing being densed or sparse, Read a lot of answer but can't figure out Primary Index is always sparse : since indexing is done of key attribute and records(files) are ordered so we create index only for anchor of the block(group of records) ... record and is only for some records. Please correct me If I am wrong at some point and If I am right then please comment.
I am confused about indexing being densed or sparse, Read a lot of answer but can’t figure outPrimary Index is always sparse : since indexing is done of key attribute a...
Shivam Kasat
384
views
Shivam Kasat
asked
Jan 20, 2019
Databases
databases
indexing
file-system
+
–
1
votes
1
answer
43
Ace Test Series: DBMS - Multi level indexing
Na462
923
views
Na462
asked
Jan 19, 2019
Databases
databases
indexing
ace-test-series
+
–
0
votes
0
answers
44
B+ tree
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
bts1jimin
375
views
bts1jimin
asked
Jan 9, 2019
Databases
b-tree
databases
indexing
+
–
0
votes
1
answer
45
UGC NET CSE | December 2018 | Part 2 | Question: 85
A clustering index is defined on the fields which are of type non-key and ordering non-key and non-ordering key and ordering key and non-ordering
A clustering index is defined on the fields which are of typenon-key and orderingnon-key and non-orderingkey and orderingkey and non-ordering
Arjun
617
views
Arjun
asked
Jan 2, 2019
Unknown Category
ugcnetcse-dec2018-paper2
databases
indexing
+
–
3
votes
2
answers
46
Gateforum Test Series: Databases - Indexing
suppose that in a file organization record size(R)=150 bytes , block size (B)=512 bytes. there are totally 30000 records. the data field on which indexing is done is 9 bytes and block pointer size is 7 bytes how many block access will be needed to access a data item in case of single level primary indexing?
suppose that in a file organization record size(R)=150 bytes , block size (B)=512 bytes. there are totally 30000 records. the data field on which indexing is done is 9 by...
Shivam Kasat
1.3k
views
Shivam Kasat
asked
Dec 19, 2018
Databases
gateforum-test-series
databases
indexing
+
–
0
votes
0
answers
47
Gateforum Test Series: Databases - Indexing
Can anyone explain this in detail???
Can anyone explain this in detail???
nag.swarna
351
views
nag.swarna
asked
Dec 9, 2018
Databases
gateforum-test-series
databases
indexing
+
–
1
votes
1
answer
48
METest-Database_B+tree
Consider a $B^+$ tree , in which order of internal nodes is 4 and order of leaf nodes is 3. The order of internal nodes is the maximum number of tree pointers in each internal node and the order of leaf node is the maximum number of data items that can be ... way and I got 3 splits, assuming B+ tree with left biasing. But the answer is given to be 8. Have I made any mistake?
Consider a $B^+$ tree , in which order of internal nodes is 4 and order of leaf nodes is 3. The order of internal nodes is the maximum number of tree pointers in each int...
Ayush Upadhyaya
1.3k
views
Ayush Upadhyaya
asked
Nov 30, 2018
Databases
databases
indexing
+
–
2
votes
2
answers
49
B+ Tree Self Doubt
what is the minimum and maximum number of keys for non-leaf nodes and leaf nodes for B+ Tree of order p?
what is the minimum and maximum number of keys for non-leaf nodes and leaf nodes for B+ Tree of order p?
aditi19
1.6k
views
aditi19
asked
Nov 23, 2018
Databases
b-tree
databases
indexing
multilevel
+
–
0
votes
1
answer
50
B+ Trees
can anyone share some good resources fot B+ tree deletion?
can anyone share some good resources fot B+ tree deletion?
aditi19
406
views
aditi19
asked
Nov 23, 2018
Databases
databases
binary-tree
indexing
multilevel
+
–
0
votes
0
answers
51
Gateforum Test Series: Databases - Indexing
Gupta731
274
views
Gupta731
asked
Nov 1, 2018
Databases
databases
gateforum-test-series
indexing
+
–
2
votes
0
answers
52
Database-Indexing
I have two doubts here (1)Doubt1-The number of blocks needed to store file must be 3000 and not 2930. Record organisation is unspanned and so 1 block can contain only 10 records. Here in solution, they are trying to fit bytes into blocks and ... ;t tell, for purpose of optimisation we can consider multi-level indexing with primary index. What should be the correct answer here?
I have two doubts here(1)Doubt1-The number of blocks needed to store file must be 3000 and not 2930. Record organisation is unspanned and so 1 block can contain only 10 r...
Ayush Upadhyaya
569
views
Ayush Upadhyaya
asked
Oct 12, 2018
Databases
indexing
databases
+
–
2
votes
1
answer
53
Indexing
How to prove that if same size blocks are allocated to B trees and B+ trees then:- No. of index nodes in B tree >= No. Of index nodes in B+ tree
How to prove that if same size blocks are allocated to B trees and B+ trees then:-No. of index nodes in B tree >= No. Of index nodes in B+ tree
skywalker_19
653
views
skywalker_19
asked
Oct 8, 2018
Databases
indexing
databases
b-tree
bplustrees
+
–
1
votes
1
answer
54
indexing
Block size 1000B records are of size 100B of which 12B are the key field and pointer of size 8B. a file consist of 10000 records 1.the number of blocks required for a sparse index on this file? 2.the number of blocks required for for a dense index on this file
Block size 1000B records are of size 100B of which 12B are the key field and pointer of size 8B. a file consist of 10000 records1.the number of blocks required for a spar...
suneetha
643
views
suneetha
asked
Aug 27, 2018
Databases
indexing
+
–
0
votes
1
answer
55
B+ tree maximum and minimum height
Vishnathan
8.2k
views
Vishnathan
asked
Aug 24, 2018
Databases
b-tree
indexing
databases
+
–
Page:
« prev
1
2
3
4
5
6
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register