Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Slides
Recent questions tagged indexing
2
votes
1
answer
91
ISRO-2017
Q.Consider the following query : Select E.no,COUNT(*) FROM Employee E GROUP BY E.no If an index on eno is available,the query can be answered by scanning only the index if A) the index is only hash and clustered B) the index is only B+ tree and clustered C)index can be hash or B+ tree and clustered or non-clustered D)index can be hash or B+ tree and clustered
Q.Consider the following query :Select E.no,COUNT(*) FROM Employee E GROUP BY E.noIf an index on eno is available,the query can be answered by scanning only the index ifA...
junaid ahmad
3.1k
views
junaid ahmad
asked
Dec 17, 2017
Databases
isro2017
databases
indexing
non-gate
+
–
3
votes
1
answer
92
ISRO-2017
Q.Consider a table that describes the customers: Customers(custid,name,gender,rating) The rating value is an integer in the range 1 to 5 and only two values(male and female) are recorded for gender.Consider the query "how many male customers have a ... ; ? The best indexing mechanism appropriate for the query is A) Linear hashing B)Extensible Hashing C)B+tree D)Bit-mapped index
Q.Consider a table that describes the customers:Customers(custid,name,gender,rating)The rating value is an integer in the range 1 to 5 and only two values(male and female...
junaid ahmad
2.6k
views
junaid ahmad
asked
Dec 17, 2017
Databases
isro-2017
indexing
+
–
0
votes
1
answer
93
DBMA Indexing
Records Size in bytes:- 30,75,40,65,50,20 Block Size:- 100 bytes If unspanning organization is used,then what is % of wastage in disk space?
Records Size in bytes:- 30,75,40,65,50,20 Block Size:- 100 bytesIf unspanning organization is used,then what is % of wastage in disk space?
rahul sharma 5
509
views
rahul sharma 5
asked
Dec 15, 2017
Databases
indexing
databases
+
–
0
votes
1
answer
94
B+ Tree Question
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
iarnav
1.4k
views
iarnav
asked
Dec 15, 2017
Databases
b-tree
bplustrees
databases
indexing
tree
+
–
2
votes
1
answer
95
B+ tree 2
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels?
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels?
VS
2.3k
views
VS
asked
Dec 10, 2017
Databases
databases
bplustrees
indexing
+
–
1
votes
0
answers
96
MadeEasy Test Series: Databases - Indexing
Which of the following statement is/are true? For any data file it is possible to construct two separate sparse first level indexes on different keys. For any data file, it is possible to construct two separate dense first level indexes ... possible to construct a sparse first level index and a dense second level index,both should be useful. All the above
Which of the following statement is/are true?For any data file it is possible to construct two separate sparse first level indexes on different keys.For any data file, it...
shivangi5
580
views
shivangi5
asked
Dec 4, 2017
Databases
made-easy-test-series
databases
indexing
+
–
2
votes
0
answers
97
dense index
Suppose blocks hold either three records, or Ten (Key,pointer) pairs. As a function of n, the number of records, for dense index.How many levels of index as is appropriate until the final level of index has only one block? a) n/3^n b) log3n c) n/4^n d)log10n
Suppose blocks hold either three records, or Ten (Key,pointer) pairs. As a function of n, the number of records, for dense index.How many levels of index as is appropriat...
Kajal Khobragade
1.3k
views
Kajal Khobragade
asked
Nov 23, 2017
Databases
indexing
+
–
0
votes
1
answer
98
data base 2
nikkey123
444
views
nikkey123
asked
Nov 22, 2017
Databases
databases
b-tree
indexing
+
–
0
votes
1
answer
99
data base 1
nikkey123
276
views
nikkey123
asked
Nov 22, 2017
Databases
databases
b-tree
indexing
+
–
1
votes
1
answer
100
Can anyone explain how? . Databases
Parshu gate
274
views
Parshu gate
asked
Nov 18, 2017
Databases
databases
data-structures
indexing
+
–
4
votes
2
answers
101
B+ tree
pls explain
pls explain
Nils
576
views
Nils
asked
Nov 14, 2017
Databases
databases
bplustrees
indexing
+
–
0
votes
1
answer
102
indexing
please can someone explain dense index ,sparse index ,cluster indexing with a proper example instead of theory ?
please can someone explain dense index ,sparse index ,cluster indexing with a proper example instead of theory ?
kewal
351
views
kewal
asked
Nov 10, 2017
Databases
indexing
+
–
0
votes
1
answer
103
sparse/dense indexing
which statement is true? 1)for any data file it is possible to construct two separate sparse first level index on different keys. 2)for any data file it is possible to construct two separate dense first level index on different keys. 3)for any data file it is possible to construct a sparse first level index and a dense second level indexboth should be useful 4) none.
which statement is true?1)for any data file it is possible to construct two separate sparse first level index on different keys.2)for any data file it is possible to cons...
set2018
1.7k
views
set2018
asked
Nov 10, 2017
Databases
databases
indexing
+
–
1
votes
1
answer
104
indexing
Given a data file with 100 records per page and 1000 pages and on index page capacity of 512 index entries, how deep should be the B+ tree to index this file. please explain with a diagram.
Given a data file with 100 records per page and 1000 pages and on indexpage capacity of 512 index entries, how deep should be the B+ tree toindex this file.please explain...
Arnabi
785
views
Arnabi
asked
Oct 28, 2017
Databases
indexing
databases
bplustrees
+
–
3
votes
1
answer
105
indexing
Arnabi
728
views
Arnabi
asked
Oct 28, 2017
Databases
indexing
databases
+
–
1
votes
0
answers
106
Database: B+ Tree Insertion
Question: the below figure shows a B+ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value 34 is inserted into the B+-tree. Obtain the modified B-tree after insertion. My Solution Please validate the solution,
Question: the below figure shows a B+ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value 34 is ins...
Manu Thakur
895
views
Manu Thakur
asked
Oct 27, 2017
Databases
databases
bplustrees
indexing
+
–
23
votes
1
answer
107
B+tree with sparse/Dense indexing
Database file consists of $10,000$ records with record size of $100$ bytes, block size $512$ bytes. If sparse B+ tree index is built over given database file with search key size $22$ bytes and both block pointer and record pointer of size $12$ bytes each.Find out a)minimum index block required b)maximum index block required my answers a)$143$ b)$325$.
Database file consists of $10,000$ records with record size of $100$ bytes, block size $512$ bytes. If sparse B+ tree index is built over given database file with search ...
reena_kandari
5.7k
views
reena_kandari
asked
Oct 26, 2017
Databases
databases
indexing
bplustrees
+
–
2
votes
0
answers
108
Database: Multilevel Indexing
In the following question, How to know that at first level (base level) index entries will be recorded for a block or for each record?https://gateoverflow.in/2311/gate1993_14 See the highlighted part below, what if we have multilevel secondary inedxing?
In the following question, How to know that at first level (base level) index entries will be recorded for a block or for each record?https://gateoverflow.in/2311/gate199...
Manu Thakur
1.9k
views
Manu Thakur
asked
Oct 26, 2017
Databases
databases
indexing
multilevel
+
–
2
votes
2
answers
109
indexing doubt
Arnabi
633
views
Arnabi
asked
Oct 25, 2017
Databases
indexing
databases
bplustrees
+
–
2
votes
0
answers
110
indexing-testbook
set2018
315
views
set2018
asked
Oct 21, 2017
Databases
databases
testbook-test-series
indexing
+
–
1
votes
1
answer
111
Indexing
Consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long,and a record pointer is P R =7 bytes long. A file has r=30,000 EMPLOYEE records of fixed-length. Each record size is fixed 50 bytes. Find out the no. Of block b requires .assuming an unspanned organization.
Consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long,and a record pointer is P R =7 bytes long. A file has r=30,000 EMPLOYEE records of fixed-le...
akankshadewangan24
904
views
akankshadewangan24
asked
Oct 17, 2017
Databases
indexing
+
–
0
votes
1
answer
112
Indexing
consider a display block size is equal to 1024 bytes A block pointer 6 byte and record pointer 8 byte the file has 10000 employees record every record is fixed length of 100 bytes it is he is SSN which is a 2 byite the file is not ordered by the key field SSN and want to construct a secondary index on SSN and find out the number of blocks required in the first level index.
consider a display block size is equal to 1024 bytes A block pointer 6 byte and record pointer 8 byte the file has 10000 employees record every record is fixed length of ...
akankshadewangan24
366
views
akankshadewangan24
asked
Oct 17, 2017
Databases
indexing
+
–
1
votes
2
answers
113
Indexing
shivangi5
943
views
shivangi5
asked
Oct 16, 2017
Databases
indexing
databases
bplustrees
+
–
1
votes
0
answers
114
Minimum number of index blocks
DB file consists of 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). How many minimum index blocks are required for sparse B+ tree index? I think the answer should be (417/10) + (42/11) +(4/11) = 42 + 4 + 1 = 47 (Assuming order of leaf and internal nodes are same as they are not given separately). Am I correct?
DB file consists of 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). How many minimum index blocks are required for sparse B+ tree index?I think t...
Xylene
1.2k
views
Xylene
asked
Sep 20, 2017
Databases
databases
indexing
+
–
0
votes
1
answer
115
Sparse and Dense index doubt
Block size 1000 B Search key 12 B Pointer size 8B What is max records of DB 1) For Dense index B+ tree of 2 level 2) For Sparse index B+ tree of 2 level How ans will differ , Plz show
Block size 1000 BSearch key 12 BPointer size 8BWhat is max records of DB1) For Dense index B+ tree of 2 level2) For Sparse index B+ tree of 2 levelHow ans will differ , P...
srestha
597
views
srestha
asked
Sep 16, 2017
Databases
databases
indexing
+
–
8
votes
3
answers
116
Test by Bikram | Databases | Test 2 | Question: 26
Assume that a data file contains $2000$ records that are ordered by a key attribute $K$ , and a primary index on attribute $K$ is built. The size of key is $5B$ and block pointer is $5B$. Each block of the system is of ... storing meta data). The total number of disk accesses required to fetch the record using the index (in average case) is _____.
Assume that a data file contains $2000$ records that are ordered by a key attribute $K$ , and a primary index on attribute $K$ is built.The size of key is $5B$ and block ...
Bikram
917
views
Bikram
asked
Aug 26, 2017
Databases
tbb-dbms-2
numerical-answers
databases
file-organization
indexing
+
–
1
votes
0
answers
117
Multi- level Indexes
why Multi- level Indexes uses fan out as base of log function
why Multi- level Indexes uses fan out as base of log function
iamHarin
215
views
iamHarin
asked
Jul 22, 2017
Databases
databases
indexing
+
–
0
votes
1
answer
118
Self Doubt in Sparse Indexing and Dense Indexing
Is it possible to have an Index file which is both dense index and sparse Index?
Is it possible to have an Index file which is both dense index and sparse Index?
AnilGoudar
514
views
AnilGoudar
asked
Jun 10, 2017
Databases
indexing
databases
+
–
2
votes
1
answer
119
databases
In the given B-Tree below , insert an index record with key 40 ? (order of b-tree is 4) ANSWER : PLEASE VERIFY ...
In the given B-Tree below , insert an index record with key 40 ? (order of b-tree is 4)ANSWER :PLEASE VERIFY ...
vignesh
698
views
vignesh
asked
May 8, 2017
Databases
databases
indexing
b-tree
+
–
6
votes
6
answers
120
Databases
A Clustered index A) is a dense index always. B) is a sparse index always. C) can be either dense index or a sparse index,but not both. D) can be both dense index and sparse index.
A Clustered indexA) is a dense index always.B) is a sparse index always.C) can be either dense index or a sparse index,but not both.D) can be both dense index and sparse ...
vignesh
6.0k
views
vignesh
asked
Apr 27, 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