Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Slides
Recent questions tagged indexing
2
votes
1
answer
61
Ace Test Series: DBMS - Indexing And File Organization
Here the indexing is done on ordered field so which to use Dense or Sparse because both can be done here ?
Here the indexing is done on ordered field so which to use Dense or Sparse because both can be done here ?
Na462
642
views
Na462
asked
Jun 29, 2018
Databases
ace-test-series
databases
file-system
indexing
+
–
1
votes
1
answer
62
Ace Test Series: DBMS - B+ Trees And Indexing
Please Solve this question. I didn't understood the question properly so please Make Me as well :) What is meant by Leaf Page ?
Please Solve this question. I didn't understood the question properly so please Make Me as well :) What is meant by Leaf Page ?
Na462
607
views
Na462
asked
Jun 29, 2018
Databases
ace-test-series
databases
indexing
b-tree
+
–
1
votes
0
answers
63
Doubt
1. Why in question They treat both clustered and primary indices Different, because both are the same thing(written in Korth). Only the thing is Primary indices means search key is Primary Key and Clustered means it can be any search Key and both defines the ... a clustered index and i took another attribute not in the order say Salary and created a different Secondary index on the Records ?
1. Why in question They treat both clustered and primary indices Different, because both are the same thing(written in Korth).Only the thing is Primary indices means sear...
Na462
374
views
Na462
asked
Jun 13, 2018
Databases
indexing
databases
+
–
4
votes
1
answer
64
Indexing
Database file consist 50000 records with record size 100 bytes, block size 512 bytes. If sparse B+ tree index build over given database file with search key size 20 bytes both block pointer and record pointer sizes 12 bytes each. How many maximum index blocks required if node order P is defined as between ⎡P/2⎤ to P pointers per node?
Database file consist 50000 records with record size 100 bytes, block size 512 bytes. If sparse B+ tree index build over given database file with search key size 20 bytes...
Na462
5.3k
views
Na462
asked
Jun 4, 2018
Databases
indexing
databases
+
–
4
votes
1
answer
65
Indexing
A database relation has $5000$ records block can hold either $10$ records or $15$ keys and pointer pairs. If sparse index is used at $1^{st}$ level and multilevel indexing is used in system, then the number of disk block required to store relation and index is _______. 1. Please explain the approach used. 2. what had been the answer if instead of sparse it would have been dense indexing ?
A database relation has $5000$ records block can hold either $10$ records or $15$ keys and pointer pairs. If sparse index is used at $1^{st}$ level and multilevel indexin...
Na462
2.1k
views
Na462
asked
May 29, 2018
Databases
indexing
databases
+
–
4
votes
1
answer
66
B+ tree indexing
Which of the following statements true for $B$ tree and $B^+$ tree index? A. $B$ tree index faster for range queries compare to $B^+$ tree index. B. If disk block allocated for $B^+$ tree index and same size disk block allocated for $B$ tree index then number ... $B^+$ tree index less than equal to I/O cost of $B$ tree index for random access of same key from set of distinct keys.
Which of the following statements true for $B$ tree and $B^+$ tree index?A. $B$ tree index faster for range queries compare to $B^+$ tree index.B. If disk block allocated...
Na462
3.1k
views
Na462
asked
May 26, 2018
Databases
indexing
bplustrees
b-tree
data-structures
+
–
1
votes
3
answers
67
Indexing
A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. Then that index is called:- Dense Sparse. Clustered Unclustered
A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. Then that index is called:-DenseSparse.ClusteredU...
Na462
1.3k
views
Na462
asked
May 26, 2018
Databases
databases
indexing
+
–
0
votes
0
answers
68
ER Diagram Table
Minimum number of Relations:- The Answer is $5$. Please see my Reason behind it:- 1. $R_6$ and $E_5$ CAN be merged giving $1$ relation we cant merge with $E_3$, because its a strong entity even though the participation is total. 2. $E_1$ and $E_4$ Gives ... $R_5$ can be merged. 4. $R_2$ will have separate table because of many to many (Doubt here) Hence total $5$ tables we got.
Minimum number of Relations:- The Answer is $5$. Please see my Reason behind it:- 1. $R_6$ and $E_5$ CAN be merged giving $1$ relation we cant merge with $E_3$, because ...
Na462
333
views
Na462
asked
May 17, 2018
Databases
databases
indexing
er-to-relational
+
–
3
votes
1
answer
69
B+ Tree
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node. A. B tree index has more levels than B+ tree index for large number of keys. B. B+ tree index has more levels than B ... tree best for sequential access of records. D. B+ tree index nodes more than B+ tree for large number of keys. Please Explain every Point.
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node.A. B tree index has more levels than B+ tr...
Na462
1.4k
views
Na462
asked
May 12, 2018
Databases
databases
b-tree
indexing
+
–
2
votes
0
answers
70
Made easy test series2019 database
Consider two relations R(A, B, C) and S(B, D) with R contains 5000 tupples stored in a sequential file sorted on attribute A and S contain 100000 tupples stored in a sequential file sorted on attribute B. Each block can hold 10 R tupples or 10 S tupples. Which one of ... A A dense index on R.B B A sparse index on R.B C A dense index on S.B D A sparse index on S.B
Consider two relations R(A, B, C) and S(B, D) with R contains 5000 tupples stored in a sequential file sorted on attribute A and S contain 100000 tupples stored in a sequ...
visakh v
357
views
visakh v
asked
May 3, 2018
Databases
databases
indexing
natural-join
+
–
2
votes
2
answers
71
ISRO2018-51
Which of the following is dense index? Primary index Clustered index Secondary index Secondary non-key index
Which of the following is dense index?Primary indexClustered indexSecondary indexSecondary non-key index
Arjun
10.1k
views
Arjun
asked
Apr 22, 2018
Databases
isro2018
indexing
+
–
0
votes
2
answers
72
Indexing
What is the Difference between Primary and Clustering Index or both are actually the Same ?
What is the Difference between Primary and Clustering Index or both are actually the Same ?
Na462
596
views
Na462
asked
Apr 12, 2018
Databases
indexing
databases
+
–
0
votes
1
answer
73
Doubt Question
In this Question :- Let there is a Table named Stud_records with 3000 records of fixed length , each record size is 50 Bytes and records are stored in a block of size 512 Bytes , If secondary index is built on the key field of size 10 Bytes and a block pointer of size 5 ... 88 Blocks The number of blocks in First level index = (88 * 15)/512 = 3 ???? Why am i wrong ?? Please Help?
In this Question :- Let there is a Table named Stud_records with 3000 records of fixed length , each record size is 50 Bytes and records are stored in a block of size 51...
Na462
614
views
Na462
asked
Apr 12, 2018
Databases
indexing
databases
+
–
1
votes
1
answer
74
testbook test series
which of the statements are correct? A a clustered index offers much better performance than unclustered index for range queries B a clustered index istypically less expensive to manage than unclustered index
which of the statements are correct?A a clustered index offers much better performance than unclustered index for range queriesB a clustered index istypically less expens...
Mayank Gupta 3
624
views
Mayank Gupta 3
asked
Mar 4, 2018
Databases
databases
indexing
+
–
0
votes
1
answer
75
testbook question
what is the difference between primary index and secondary index? A there can be only one secondary index but many primary index B many primary , many secondary index C primary is dense but secondary sparse D one primary ,many secondary answer is D given. give some explaination for answer.
what is the difference between primary index and secondary index?A there can be only one secondary index but many primary indexB many primary , many secondary indexC pri...
Mayank Gupta 3
265
views
Mayank Gupta 3
asked
Mar 4, 2018
Databases
databases
indexing
+
–
0
votes
0
answers
76
CLustered index
I have read that clustered index is an index on ordered non-key field of DB. However, in SQL clustered index can be created on Primary key. Infact, by default primary key constraint automatically creates clustered index if one doesn't already exists on the table. So, is SQL clustered index different from the one defined in theory?
I have read that clustered index is an index on ordered non-key field of DB.However, in SQL clustered index can be created on Primary key. Infact, by default primary key ...
Nymeria
790
views
Nymeria
asked
Feb 16, 2018
Databases
databases
indexing
sql
+
–
0
votes
0
answers
77
B-tree
B tree has minimum space utilization equals to 66.6%. explain?
B tree has minimum space utilization equals to 66.6%.explain?
hacker16
353
views
hacker16
asked
Jan 30, 2018
Databases
databases
b-tree
indexing
+
–
0
votes
1
answer
78
Maximum height of a B+ tree of order m with n key values is (With Derivation)
Maximum height of a B+ tree of order m with n key values is (With Derivation), the answer is known Logceil(m/2) N I tried deriving but had some trouble, could someone assist with the derivation or derivation process ?
Maximum height of a B+ tree of order m with n key values is (With Derivation), the answer is known Logceil(m/2) NI tried deriving but had some trouble, could someone assi...
Salazar
3.9k
views
Salazar
asked
Jan 29, 2018
Databases
b-tree
databases
indexing
+
–
2
votes
1
answer
79
MadeEasy Test Series 2018: Databases - Indexing
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest ...
sumit chakraborty
1.1k
views
sumit chakraborty
asked
Jan 26, 2018
Databases
databases
indexing
made-easy-test-series
+
–
2
votes
2
answers
80
MadeEasy Test Series 2018: Databases - Indexing
Database file consist 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). The maximum number of levels of index required for sparse B+ tree index for database file are ______.
Database file consist 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). The maximum number of levels of index required for sparse B+ tree index for...
nish kim
1.3k
views
nish kim
asked
Jan 19, 2018
Databases
databases
indexing
made-easy-test-series
+
–
2
votes
2
answers
81
MadeEasy Test Series 2018: Databases - Indexing
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is ________. I am getting 63 as the answer, but in the solution, it's saying 64. Can anyone check?
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest ...
souravsaha
1.6k
views
souravsaha
asked
Jan 15, 2018
Databases
databases
indexing
made-easy-test-series
madeeasy-testseries-2018
+
–
1
votes
0
answers
82
Databases
nikkey123
289
views
nikkey123
asked
Jan 11, 2018
Databases
databases
indexing
+
–
1
votes
0
answers
83
Indexing
Database relation has 10,000 records. Block can hold either 4 records or 15 key and pointer pairs. If dense index used at 1st level and multilevel indexing is used for 1st level index then the minimum number of disk blocks required to store relation are ________. My ans : 2680 ??
Database relation has 10,000 records. Block can hold either 4 records or 15 key and pointer pairs. If dense index used at 1st level and multilevel indexing is used for 1s...
Anjan
1.4k
views
Anjan
asked
Jan 9, 2018
Databases
databases
indexing
+
–
2
votes
0
answers
84
MadeEasy Test Series: Databases - Indexing
#DBMS Which of the following statements is/are true? (A) For any data file it is possible to construct two separate sparse first level indexes on different keys. (B) For any data file, it is possible to construct two separate dense ... data file, it is possible to construct a sparse first level index and a dense second level index both should be useful.
#DBMSWhich of the following statements is/are true?(A) For any data file it is possible to construct two separate sparse first level indexes on different keys.(B) For any...
Abhishek Kumar Singh
569
views
Abhishek Kumar Singh
asked
Jan 4, 2018
Databases
made-easy-test-series
databases
indexing
+
–
2
votes
1
answer
85
index
Every ________ index is Clustered a)primary b)secondary
Every ________ index is Clustereda)primaryb)secondary
Anjan
972
views
Anjan
asked
Dec 29, 2017
Databases
indexing
databases
+
–
1
votes
0
answers
86
MadeEasy Test Series: Databases - Indexing
A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. Then that index is called Dense Sparse Clustered Unclustered Given answer is :- Sparse. Is it correct? This is similar to https://gateoverflow.in/8222/gate2015-1_24 with some variation i highlighted
A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. Then that index is calledDenseSparseClusteredUncl...
rahul sharma 5
362
views
rahul sharma 5
asked
Dec 29, 2017
Databases
made-easy-test-series
databases
indexing
+
–
3
votes
1
answer
87
MadeEasy Test Series: Databases - Indexing
" For any data file, it is possible to construct two separate dense first level indexes on different keys. " How the above statement is true ??
" For any data file, it is possible to construct two separate dense first level indexes on different keys. "How the above statement is true ??
ashish pal
474
views
ashish pal
asked
Dec 26, 2017
Databases
made-easy-test-series
databases
file-system
indexing
+
–
0
votes
0
answers
88
Ace Test Series: Databases - Indexing
ashish pal
326
views
ashish pal
asked
Dec 26, 2017
Databases
databases
ace-test-series
indexing
+
–
0
votes
0
answers
89
Database indexing
Abhishek Kumar Singh
473
views
Abhishek Kumar Singh
asked
Dec 23, 2017
Databases
databases
indexing
+
–
0
votes
0
answers
90
Database index.
A file can have either one primary index or one clustered index but not both. True or false ? Give an answer with explanation.
A file can have either one primary index or one clustered index but not both. True or false ? Give an answer with explanation.
Xylene
1.3k
views
Xylene
asked
Dec 22, 2017
Databases
databases
indexing
+
–
Page:
« prev
1
2
3
4
5
6
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register