Dark Mode

Recent questions tagged indexing

1 vote

1 answer

151

bahirNaik asked in Databases Jan 8, 2016

923 views

4 votes

1 answer

152

Indexing (Find no. of Blocks)

Himanshu1 asked in Databases Jan 2, 2016

3.0k views

3 votes

2 answers

153

B-Tree / possible records

Himanshu1 asked in Databases Jan 2, 2016

847 views

3 votes

1 answer

154

Find best choice for degree for B+ tree,
Consider a relation R(A B C) with attribute size of A as 8 bytes. Disk block size is 512 bytes and block pointer is 8 bytes. The best choice for degree (maximum value) for B+ tree, if B+ tree was used for creating indexing on R(A B C) is _________.

Sandeep Singh asked in Databases Dec 18, 2015

by Sandeep Singh

2.3k views

16 votes

3 answers

155

ISRO2015-18
Given a block can hold either $3$ records or $10$ key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index $13n/30$ $n/3$ $n/10$ $n/30$

ajit asked in Databases Oct 12, 2015

by ajit

7.4k views

49 votes

4 answers

156

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

makhdoom ghaya asked in Databases Feb 13, 2015

by makhdoom ghaya

16.2k views

6 votes

3 answers

157

Consider the following statement about indexes
Consider the following statement (i) Primary index is always sparse (ii) Secondary index may or may not be dense Which of the above statement is/are false? A)Only (i) B)Only (ii) C)Both (i) and (ii) D)None of these

Keith Kr asked in Databases Oct 19, 2014

8.1k views

40 votes

3 answers

158

GATE CSE 1993 | Question: 14
An $\text{ISAM}$ (indexed sequential) file consists of records of size $64$ bytes each, including key field of size $14$ bytes. An address of a disk block takes $2$ bytes. If the disk block size is $512$ bytes and there are $16K$ records, compute the size of the data and index areas in terms of number blocks. How many levels of $\text{tree}$ do you have for the index?

Kathleen asked in Databases Sep 29, 2014

6.8k views

40 votes

6 answers

159

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$

go_editor asked in Databases Sep 29, 2014

9.6k views

47 votes

2 answers

160

GATE CSE 1998 | Question: 1.35
There are five records in a database. ... and it contains the values $1, 3, 2, 5$ and $4$. Which one of the fields is the index built from? Age Name Occupation Category

Kathleen asked in Databases Sep 25, 2014

9.8k views

46 votes

3 answers

161

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

Arjun asked in Databases Sep 23, 2014

by Arjun

15.7k views

33 votes

4 answers

162

GATE CSE 2008 | Question: 16, ISRO2016-60
A clustering index is defined on the fields which are of type non-key and ordering non-key and non-ordering key and ordering key and non-ordering

Kathleen asked in Databases Sep 11, 2014

13.9k views

67 votes

5 answers

163

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$

ABG asked in Databases Sep 2, 2014

by ABG

23.6k views

Page:

« prev
1
2
3
4
5
6

Recent questions tagged indexing