Dark Mode

Recent questions tagged indexing

2 votes

3 answers

121

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.

vignesh asked in Databases Apr 27, 2017

1.9k views

0 votes

0 answers

122

databases
This index is a dense index ...right ...???

vignesh asked in Databases Apr 26, 2017

459 views

2 votes

0 answers

123

databases
State TRUE or FALSE. "In Indexing,the number of ordering field (field based on which records in data file and its corresponding index file are sorted) should always be 1". Please support your answer with explanations ...

vignesh asked in Databases Apr 26, 2017

399 views

0 votes

0 answers

124

ISI-JRF
Two queries equivalent to each other are specified for a relation R(A, B, C, D, E, F). The queries are: πA,B,C(σB>500(R)) σB>500(πA,B,C(R)) The system maintains a B+ tree index for (A, B, C) on R. However, ... the two queries will be preferred by the query optimizer for minimum cost of execution. The cost of query execution is primarily dependent on the number of disk accesses.

kauray asked in Databases Apr 19, 2017

by kauray

473 views

2 votes

2 answers

125

MADE EASY TEST SERIES
Assume that search key size is 90% of the record size within a file(records are fixed length records). Pointer makes up only 10% of the record size. Based on the above assumptions which of the following statements is true? a. Index block factor > ... Index block factor c. Database file block factor = (Index block factor)/2 d. Database file block factor = Index block factor

pranjalgennext asked in Databases Jan 26, 2017

by pranjalgennext

431 views

4 votes

1 answer

126

Test by Bikram | Mock GATE | Test 1 | Question: 41
A file has $2^{29}$ records each of size 8B. One block of main memory is $128B$. Sparse indexing is done with one index record per memory block and one index record is of $1$ $Byte$. The blocks stored by the ... stored in disk. Blocks occupied by index are searched using binary search technique. Maximum number of blocks need to be read is _____.

Bikram asked in GATE Jan 16, 2017

by Bikram

1.4k views

2 votes

1 answer

127

TestBook Test Series
Let T be a B-tree of order m and height h. if n is the number of key elements in T then the maximum value of n is (m-1)h-1 (m-1)h-1+1 Mh-1 Mh+1+1

vnc asked in Databases Jan 13, 2017

by vnc

1.4k views

4 votes

1 answer

128

Virtual Gate Test Series: Databases - Indexing
Consider a relation company with $3000$ records are of fixed length, with record size $50$ bytes are stored in block of size $512$ bytes $\text{(unspanned).}$ If a secondary index is built on the key field of size $10$ bytes and a block pointer of size $5$ bytes, the number of first level index blocks are_____$?$

Purple asked in Databases Jan 9, 2017

by Purple

699 views

0 votes

1 answer

129

Indexing
What is the difference between different types of indices: 1. Clustered Index 2. Unclustered Index 3. Dense Index 4. Sparse Index

pranjalgennext asked in Databases Dec 27, 2016

by pranjalgennext

536 views

–1 vote

0 answers

130

shefaligups11 Gups asked in Databases Dec 23, 2016

by shefaligups11 Gups

201 views

2 votes

1 answer

131

MadeEasy Test Series: Databases - Indexing
A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. The that index is called a. Dense b. Sparse c. CLustered d. Unclustered

Akanksha Kesarwani asked in Databases Dec 12, 2016

by Akanksha Kesarwani

394 views

1 vote

2 answers

132

Ace Test Series: Databases - B Tree

chaser asked in Databases Dec 2, 2016

by chaser

749 views

11 votes

1 answer

133

GATE CSE 1989 | Question: 4-xiv
For secondary key processing which of the following file organizations is preferred? Give a one line justification: Indexed sequential file organization. Two-way linked list. Inverted file organization. Sequential file organization.

makhdoom ghaya asked in Databases Nov 30, 2016

by makhdoom ghaya

7.2k views

12 votes

1 answer

134

B-tree/B+tree
1)Consider a B+ Tree of order 4 and height 3, then find a)The maximum number of records stored are ........... b)The maximum number of keys ........... c)The minimum number of records stored are ............ d)The minimum ... maximum number of keys ? 3) Find the following with order 3 and height 3 in B-tree Minimum and maximum number of keys ? Please provide detailed explanation

Prabhanjan_1 asked in Databases Nov 30, 2016

by Prabhanjan_1

9.4k views

26 votes

4 answers

135

GATE CSE 1990 | Question: 10b
One giga bytes of data are to be organized as an indexed-sequential file with a uniform blocking factor $8.$ Assuming a block size of $1$ Kilo bytes and a block refrencing pointer size of $32$ bits, find out the number of levels of indexing ... size of the master index. The referencing capability (fanout ratio) per block of index storage may be considered to be $32$.

makhdoom ghaya asked in Databases Nov 24, 2016

by makhdoom ghaya

6.3k views

1 vote

0 answers

136

Doubt on primary indexing and clustred index.
I have read this. - Clustered index are those in which data is arranged on fields so that it act as an index. like the phonebook. And in non-clustered index we make a new index outside and data and indexes are at different places ... a clustred index then what is clustred index that states that make a entry for unique keys only. Are they both the same?

Tendua asked in Databases Nov 24, 2016

by Tendua

655 views

6 votes

1 answer

137

Number of blocks at different levels of database indexes
Consider a file of 8192 records. Each record is 16 bytes long and its key field is of size 6 bytes. The file is ordered on a key field, and the file organization is unspanned. The file is stored in a file system with block size 512 bytes, ... blocks in the multilevel index are respectively a. 8 and 1 b. 16 and 1 c. 8 and 2 d. None of these

GateAspirant999 asked in Databases Oct 30, 2016

by GateAspirant999

3.7k views

6 votes

1 answer

138

Basic doubt in B+ Tree Indexing
Q : One basic doubt that is coming to my mind is whether number of splits in the process of insertion in B+ Tree indexing going to change if we consider left biasing and right biasing approach.Plz present any example to show if possible..

Habibkhan asked in Databases Oct 19, 2016

1.1k views

4 votes

2 answers

139

B+ Tree insertion
I think it would be 7..please check

KISHALAY DAS asked in Databases Oct 19, 2016

by KISHALAY DAS

1.6k views

5 votes

2 answers

140

database-indexing-2
Maximum number of clustered indices one can build for a table with n attributes, which already has a primary index?

resilientknight asked in Databases Sep 20, 2016

by resilientknight

501 views

5 votes

1 answer

141

database-indexing
How many different secondary indices are possible for a table with n attributes(Not necessarily at the same time)?

resilientknight asked in Databases Sep 20, 2016

by resilientknight

740 views

1 vote

1 answer

142

databases-query
A clustered index is typicallly less expensive to maintain than unclustered index. True or False.

resilientknight asked in Databases Sep 16, 2016

by resilientknight

620 views

1 vote

1 answer

143

Indexing problem
Consider the following relations. Emp(eid:integer,ename:varchar,sal:integer,age:integer,did:integer) Dept(did:integer,budget:integer,floor:integer,mgr_eid:integer) Salaries ranges from 10000 to 100000 ages vary from 20 to 80, each department has about five employees ... Clustered B+ tree index on the budge field of Dept I feel in first paragraph what all important is Dept table.

GateAspirant999 asked in Databases Sep 14, 2016

by GateAspirant999

790 views

3 votes

1 answer

144

Ace Page#39, Q# 20
What is the answer of 2nd Question ??

Payal Rastogi asked in Databases Aug 16, 2016

by Payal Rastogi

551 views

4 votes

1 answer

145

Indexing
If one block access time is 30ms,then what is the access time for 100 blocks index if we use binary search?

sumedha asked in Databases Aug 2, 2016

1.1k views

3 votes

3 answers

146

UGC NET CSE | June 2014 | Part 2 | Question: 48
A clustering index is created when _______. Primary key is declared and ordered No key ordered Foreign key ordered There is no key and no order

makhdoom ghaya asked in Databases Jul 1, 2016

by makhdoom ghaya

4.2k views

2 votes

0 answers

147

ISI2014-PCB-CS-6a
Two queries equivalent to each other are specified for a relation $R(A, B, C, D, E, F)$. The queries are: $\pi_{A,B,C}(\sigma B>500(R))$ $\sigma B>500(\pi_{A,B,C}(R))$ The system maintains a $B+$ tree index ... two queries will be preferred by the query optimizer for minimum cost of execution. The cost of query execution is primarily dependent on the number of disk accesses.

go_editor asked in Databases May 31, 2016

581 views

8 votes

5 answers

148

ISRO-2013-61, ISRO2008-35
Embedded pointer provides A secondary access path A physical record key An inverted index A primary key

makhdoom ghaya asked in Databases May 2, 2016

by makhdoom ghaya

7.3k views

1 vote

1 answer

149

DBMS: Indexing Question
A file is organized so that the odering of data record is same as or close to the odering of data block in some index. Then that index is called Dense Sparse Clustered Unclustered Solution given: (b) • In sparse index number of ... In dense index number of entries depends on number of data record in previous level. Link: https://gateoverflow.in/8222/gate2015-1_24

Prasanna asked in Databases Jan 15, 2016

2.0k views

0 votes

0 answers

150

can anyone help me regarding indexes and b+ trees is was always confused about it

shivanisrivarshini asked in Databases Jan 14, 2016

by shivanisrivarshini

308 views

Page:

« prev
1
2
3
4
5
6
next »

Recent questions tagged indexing