Search results for indexing / GATE Overflow for GATE CSE

47 votes

3 answers

1

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.5k views

Arjun asked Feb 12, 2020

14 votes

2 answers

2

GATE CSE 2023 | Question: 52
Consider a database of fixed-length records, stored as an ordered file. The database has $25,000$ records, with each record being $100$ bytes, of which the primary key occupies $15$ bytes. The data file is block-aligned in that each data ... required to identify the block in the data file that may contain a record with the key, in the worst case, is _____________.

Consider a database of fixed-length records, stored as an ordered file. The database has $25,000$ records, with each record being $100$ bytes, of which the primary key oc...

admin

11.9k views

admin asked Feb 15, 2023

46 votes

3 answers

3

GATE CSE 2013 | Question: 15
An index is clustered, if it is on a set of fields that form a candidate key it is on a set of fields that include the primary key the data records of the file are organized in the same order as the data entries of the index the data records of the file are organized not in the same order as the data entries of the index

An index is clustered, ifit is on a set of fields that form a candidate keyit is on a set of fields that include the primary keythe data records of the file are organized...

Arjun

15.9k views

Arjun asked Sep 23, 2014

67 votes

5 answers

4

GATE CSE 2008 | Question: 70
Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$ ... -level blocks in the multi-level index are respectively $8$ and $0$ $128$ and $6$ $256$ and $4$ $512$ and $5$

Consider a file of $16384$ records. Each record is $32\;\text{bytes}$ long and its key field is of size $6\;\text{bytes}$. The file is ordered on a non-key field, and the...

ABG

23.9k views

ABG asked Sep 2, 2014

49 votes

4 answers

5

GATE CSE 2015 Set 1 | Question: 24
A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index. Then that index is called Dense Sparse Clustered Unclustered

A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index. Then that index is calledDenseSparseCl...

makhdoom ghaya

16.4k views

makhdoom ghaya asked Feb 13, 2015

0 votes

0 answers

6

File organisation and indexing (DBMS)

Suryadip

106 views

Suryadip asked Mar 9

3 votes

0 answers

7

GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 24
Assume that a data file has an index consisting of $\text{N}$ items, where $\text{N}$ is large. If a binary search of the index is used to find an item, then, of the following, which best approximates the mean number of comparisons required to locate a ... $\left(\log _2 \text{N}\right)-1$ $\text{N} \log _2 \text{N}$

Assume that a data file has an index consisting of $\text{N}$ items, where $\text{N}$ is large. If a binary search of the index is used to find an item, then, of the foll...

GO Classes

729 views

GO Classes asked Jan 21

1 votes

1 answer

8

Made Easy
Amy and Bob are working on a project vehicle rental system, they have a file consisting of 10000 records, having block size 1024 bytes, record size 100 bytes. Search key size 9 bytes, pointer 7 bytes. They want to implement single level indexing. ... dense index, however Amy suggested to implement sparse index. How many blocks are saved by Amy considering only 1st level index ________?

Amy and Bob are working on a project vehicle rental system, they have a file consisting of 10000 records, having block size 1024 bytes, record size 100 bytes. Search key ...

suvasish114

466 views

suvasish114 asked Dec 9, 2023

20 votes

1 answer

9

GATE CSE 2021 Set 2 | Question: 21
A data file consisting of $1,50,000$ student-records is stored on a hard disk with block size of $4096$ bytes. The data file is sorted on the primary key $\textrm{RollNo}$. The size of a record pointer for this disk is $7$ bytes. ... that the records of data file and index file are not split across disk blocks. The number of blocks in the index file is ________

A data file consisting of $1,50,000$ student-records is stored on a hard disk with block size of $4096$ bytes. The data file is sorted on the primary key $\textrm{RollNo}...

Arjun

9.2k views

Arjun asked Feb 18, 2021

0 votes

1 answer

10

data base
Construct the B+ tree for the following set of key values : {2,3,5,7,11,17,19,23,29,31}. Assume that tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that will fit in one node is as follows: (a) Four (b) Six (c) Eight

Construct the B+ tree for the following set of key values : {2,3,5,7,11,17,19,23,29,31}. Assume that tree is initially empty and values are added in ascending order. Cons...

gateexplore

596 views

gateexplore asked Jun 30, 2023

40 votes

6 answers

11

GATE CSE 2011 | Question: 39
Consider a relational table $r$ with sufficient number of records, having attributes $A_1, A_2, \dots ,A_n$ and let $1 \leq p \leq n$. Two queries $Q1$ and $Q2$ ... queries Hashing will outperform ordered indexing on $Q1$, but not on $Q2$ Hashing will outperform ordered indexing on $Q2$, but not on $Q1$

Consider a relational table $r$ with sufficient number of records, having attributes $A_1, A_2, \dots ,A_n$ and let $1 \leq p \leq n$. Two queries $Q1$ and $Q2$ are given...

go_editor

9.7k views

go_editor asked Sep 29, 2014

3 votes

1 answer

12

Ace Test Series: DBMS - File Indexing

Na462

1.9k views

Na462 asked Jan 26, 2019

0 votes

1 answer

13

Indexing in database(Self Doubt)
Can anyone explain in detail about the concepts of sencondary indexing in dbms??

Can anyone explain in detail about the concepts of sencondary indexing in dbms??

vishnu777

411 views

vishnu777 asked Nov 8, 2022

1 votes

1 answer

14

Igate2022 Test Series
consider a ABC university and the relation took(StudentID, CourseNo, Quarter, Year, Units, Grade) contains the grades for the courses completed by ABC students during the last 20 years. For simplicity, assume that there are 25,000 students enrolled each quarter, and ... the B+ use, in the worst case. (n denotes the maximum number of pointers in a node.) Ans 3 Please explain

consider a ABC university and the relation took(StudentID, CourseNo, Quarter, Year, Units, Grade) contains the grades for the courses completed by ABC students during the...

SKMAKM

506 views

SKMAKM asked Sep 19, 2022

0 votes

0 answers

15

Best Open Video Playlist for Indexing (e.g., B and B+ trees) Topic | Databases
Please list out the best free available video playlist for Indexing (e.g., B and B+ trees) from Databases as an answer here (only one playlist per answer). We'll then select the best playlist and add to ... but standard ones are more likely to be selected as best. For the full list of selected videos please see here

Please list out the best free available video playlist for Indexing (e.g., B and B+ trees) from Databases as an answer here (only one playlist per answer). We'll then sel...

makhdoom ghaya

267 views

makhdoom ghaya asked Aug 20, 2022

3 votes

2 answers

16

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.5k views

srestha asked May 17, 2019

2 votes

1 answer

17

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

692 views

Na462 asked Jun 29, 2018

0 votes

1 answer

18

made easy mock1
TRUE/FALSE: statement 1: secondary index may or may not be dense. statement 2: disk is considered as the maximum size of virtual memory.

TRUE/FALSE:statement 1: secondary index may or may not be dense.statement 2: disk is considered as the maximum size of virtual memory.

aambazinga

636 views

aambazinga asked Jan 8, 2019

0 votes

0 answers

19

AKTU university
Show the result of inserting the keys 9,24,19,13 in order into the following B-tree with minimum degree t=3.

Show the result of inserting the keys 9,24,19,13 in order into the following B-tree with minimum degree t=3.

CSE111

257 views

CSE111 asked Dec 6, 2021

0 votes

1 answer

20

#self doubt
Hash indexing and Hash file organization are there in gate syllabus??? I also wanted to know what are the topics are there in file organization and indexes….as I don’t find much question from file organization in gate questions...then please provide the video link???

Hash indexing and Hash file organization are there in gate syllabus???I also wanted to know what are the topics are there in file organization and indexes….as I don’t...

samarpita

263 views

samarpita asked Nov 14, 2021

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