Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Slides
Recent questions tagged indexing
1
votes
1
answer
151
Indexing
bahirNaik
943
views
bahirNaik
asked
Jan 8, 2016
Databases
databases
indexing
+
–
4
votes
1
answer
152
Indexing (Find no. of Blocks)
Himanshu1
3.1k
views
Himanshu1
asked
Jan 2, 2016
Databases
databases
indexing
+
–
3
votes
2
answers
153
B-Tree / possible records
Himanshu1
851
views
Himanshu1
asked
Jan 2, 2016
Databases
b-tree
databases
indexing
+
–
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 _________.
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) fo...
Sandeep Singh
2.4k
views
Sandeep Singh
asked
Dec 18, 2015
Databases
databases
b-tree
indexing
+
–
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$
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$1...
ajit
7.5k
views
ajit
asked
Oct 12, 2015
Databases
isro2015
databases
indexing
+
–
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
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.3k
views
makhdoom ghaya
asked
Feb 13, 2015
Databases
gatecse-2015-set1
databases
indexing
easy
+
–
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
Consider the following statement(i) Primary index is always sparse(ii) Secondary index may or may not be denseWhich of the above statement is/are false?A)Only (i)B)Only (...
Keith Kr
8.2k
views
Keith Kr
asked
Oct 19, 2014
Databases
databases
indexing
+
–
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?
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...
Kathleen
6.8k
views
Kathleen
asked
Sep 29, 2014
Databases
gate1993
databases
indexing
normal
descriptive
+
–
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$
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
Databases
gatecse-2011
databases
indexing
normal
+
–
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
There are five records in a database.$$\begin{array}{|c|c|c|c|} \hline \textbf {Name} & \textbf {Age} & \textbf {Occupation} & \textbf{Category } \\\hline \text{Rama} & ...
Kathleen
9.9k
views
Kathleen
asked
Sep 25, 2014
Databases
gate1998
databases
indexing
normal
+
–
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
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
Databases
gatecse-2013
databases
indexing
normal
+
–
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
A clustering index is defined on the fields which are of typenon-key and orderingnon-key and non-orderingkey and orderingkey and non-ordering
Kathleen
14.0k
views
Kathleen
asked
Sep 11, 2014
Databases
gatecse-2008
easy
databases
indexing
isro2016
+
–
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$
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.8k
views
ABG
asked
Sep 2, 2014
Databases
gatecse-2008
databases
indexing
normal
+
–
Page:
« prev
1
2
3
4
5
6
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register