menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
Recent Posts
Update on GO Book for GATE 2022
Barc Interview Experience 2020- CSE stream
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.2k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.4k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent questions tagged indexing
Recent Blog Comments
Can you check again?
sir please revert back as soon as possible
sir today i have purchased gate overflow test...
This PDF contains all the Previous Year...
Mock 3 will be added soon.
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Slides
Recent questions tagged indexing
2
votes
1
answer
1
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?
asked
Dec 10, 2017
in
Databases
VS
1.2k
views
databases
bplustrees
indexing
1
vote
1
answer
2
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 is possible to construct two separate dense first level indexes on different keys. For any data file, it is possible to construct a sparse first level index and a dense second level index,both should be useful. All the above
asked
Dec 4, 2017
in
Databases
shivangi5
151
views
made-easy-test-series
databases
indexing
0
votes
1
answer
3
MadeEasy Subject Test: 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 is possible to construct two separate dense first level indexes on different keys. For any data file, it is possible to construct a sparse first level index and a dense second level index,both should be useful. All the above
asked
Nov 24, 2017
in
Databases
sunaina rawat
95
views
made-easy-test-series
databases
indexing
2
votes
0
answers
4
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 appropriate until the final level of index has only one block? a) n/3^n b) log3n c) n/4^n d)log10n
asked
Nov 23, 2017
in
Databases
Kajal Khobragade
683
views
indexing
0
votes
0
answers
5
data base 3
The difference between the minimum levels of B tree index required for 7000 keys and order of B tree node (P) is 12 (assume order P is max possible child pointers per B-tree node) and the minimum levels of B+ tree index required for 7000 keys and order of B+ tree node (P) is 12 (Assume P is max pointer possible to stage in B+ tree node) _________.
The difference between the minimum levels of B tree index required for 7000 keys and order of B tree node (P) is 12 (assume order P is max possible child pointers per B-tree node) and the minimum levels of B+ tree index required for 7000 keys and order of B+ tree node (P) is 12 (Assume P is max pointer possible to stage in B+ tree node) _________.
asked
Nov 22, 2017
in
Databases
nikkey123
160
views
databases
indexing
b-tree
0
votes
1
answer
6
data base 2
asked
Nov 22, 2017
in
Databases
nikkey123
155
views
databases
b-tree
indexing
0
votes
1
answer
7
data base 1
asked
Nov 22, 2017
in
Databases
nikkey123
128
views
databases
b-tree
indexing
1
vote
1
answer
8
Can anyone explain how? . Databases
asked
Nov 18, 2017
in
Databases
Parshu gate
100
views
databases
data-structures
indexing
4
votes
3
answers
9
B+ tree
pls explain
pls explain
asked
Nov 14, 2017
in
Databases
Nils
239
views
databases
bplustrees
indexing
0
votes
1
answer
10
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 ?
asked
Nov 10, 2017
in
Databases
kewal
121
views
indexing
0
votes
1
answer
11
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 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.
asked
Nov 10, 2017
in
Databases
set2018
860
views
databases
indexing
1
vote
1
answer
12
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 index page capacity of 512 index entries, how deep should be the B+ tree to index this file. please explain with a diagram.
asked
Oct 28, 2017
in
Databases
Arnabi
335
views
indexing
databases
bplustrees
3
votes
1
answer
13
indexing
asked
Oct 28, 2017
in
Databases
Arnabi
316
views
indexing
databases
1
vote
0
answers
14
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 inserted into the B+-tree. Obtain the modified B-tree after insertion. My Solution Please validate the solution,
asked
Oct 27, 2017
in
Databases
Manu Thakur
406
views
databases
bplustrees
indexing
20
votes
1
answer
15
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 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$.
asked
Oct 27, 2017
in
Databases
reena_kandari
2.9k
views
databases
indexing
bplustrees
2
votes
0
answers
16
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/gate1993_14 See the highlighted part below, what if we have multilevel secondary inedxing?
asked
Oct 26, 2017
in
Databases
Manu Thakur
795
views
databases
indexing
multilevel
2
votes
2
answers
17
indexing doubt
asked
Oct 25, 2017
in
Databases
Arnabi
256
views
indexing
databases
bplustrees
2
votes
0
answers
18
indexing-testbook
asked
Oct 21, 2017
in
Databases
set2018
124
views
databases
testbook-test-series
indexing
1
vote
1
answer
19
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-length. Each record size is fixed 50 bytes. Find out the no. Of block b requires .assuming an unspanned organization.
asked
Oct 17, 2017
in
Databases
akankshadewangan24
286
views
indexing
0
votes
2
answers
20
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 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.
asked
Oct 17, 2017
in
Databases
akankshadewangan24
183
views
indexing
1
vote
2
answers
21
Indexing
asked
Oct 16, 2017
in
Databases
shivangi5
348
views
indexing
databases
bplustrees
2
votes
3
answers
22
Indexing
Clustered index is dense or sparse or both?
Clustered index is dense or sparse or both?
asked
Sep 23, 2017
in
Databases
Arjun Kumar 1
1.6k
views
indexing
databases
1
vote
0
answers
23
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 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?
asked
Sep 20, 2017
in
Databases
Xylene
422
views
databases
indexing
0
votes
1
answer
24
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 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
asked
Sep 16, 2017
in
Databases
srestha
298
views
databases
indexing
1
vote
0
answers
25
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
asked
Jul 22, 2017
in
Databases
iamHarin
62
views
databases
indexing
0
votes
1
answer
26
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?
asked
Jun 11, 2017
in
Databases
AnilGoudar
275
views
indexing
databases
2
votes
1
answer
27
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 ...
asked
May 8, 2017
in
Databases
vignesh
398
views
databases
indexing
b-tree
4
votes
3
answers
28
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 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.
asked
Apr 27, 2017
in
Databases
vignesh
1.6k
views
databases
indexing
2
votes
3
answers
29
databases
Which of the following statements is TRUE ? A) Every primary index is also a clustered index. B) Every clustered index is also a primary index. C) Both primary index and clustered index are one and the same, D) An index can be either primary or clustered but not both.
Which of the following statements is TRUE ? A) Every primary index is also a clustered index. B) Every clustered index is also a primary index. C) Both primary index and clustered index are one and the same, D) An index can be either primary or clustered but not both.
asked
Apr 27, 2017
in
Databases
vignesh
412
views
databases
indexing
Page:
« prev
1
2
3
4
5
next »
...