Dark Mode

Recent questions tagged indexing

1 vote

0 answers

1

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 _____________.

admin asked in Databases Feb 15

by admin

1.8k views

0 votes

1 answer

2

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

vishnu777 asked in Databases Nov 8, 2022

98 views

1 vote

1 answer

3

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

Amit Mehta asked in Databases Sep 19, 2022

186 views

0 votes

0 answers

4

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 GO ... but standard ones are more likely to be selected as best. For the full list of selected videos please see here

makhdoom ghaya asked in Study Resources Aug 20, 2022

by makhdoom ghaya

74 views

0 votes

0 answers

5

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.

CSE111 asked in Databases Dec 7, 2021

by CSE111

160 views

0 votes

1 answer

6

#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???

samarpita asked in Databases Nov 14, 2021

132 views

14 votes

1 answer

7

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 ________

Arjun asked in Databases Feb 18, 2021

by Arjun

5.4k views

34 votes

3 answers

8

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 _______

Arjun asked in Databases Feb 12, 2020

by Arjun

16.3k views

3 votes

2 answers

9

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$ :(

srestha asked in Databases May 17, 2019

1.1k views

Page:

1
2
3
4
5
6
next »

Recent questions tagged indexing