Recent questions tagged indexing

+2 votes

1 answer

1

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

asked Jan 14, 2017 in Databases by vnc Active (2.9k points) | 328 views

+2 votes

1 answer

2

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_____$?$

asked Jan 9, 2017 in Databases by Purple Active (3k points) | 182 views

0 votes

1 answer

3

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

asked Dec 27, 2016 in Databases by pranjalgennext Active (1.3k points) | 274 views

–1 vote

0 answers

4

Test series

asked Dec 23, 2016 in Databases by shefaligups11 Gups (103 points) | 72 views

+1 vote

1 answer

5

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

asked Dec 12, 2016 in Databases by Akanksha Kesarwani Junior (989 points) | 198 views

+1 vote

2 answers

6

Ace Test Series: Databases - B Tree

asked Dec 2, 2016 in Databases by chaser (321 points) | 321 views

+1 vote

2 answers

7

GATE1989-4-xiv
Provide short answers to the following questions: 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.

asked Dec 1, 2016 in Databases by makhdoom ghaya Boss (30.8k points) | 648 views

+10 votes

1 answer

8

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

asked Nov 30, 2016 in Databases by Prabhanjan_1 Boss (12.5k points) | 2.7k views

+10 votes

3 answers

9

GATE1990-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 that would be ... the size of the master index. The referencing capability (fanout ratio) per block of index storage may be considered to be $32$.

asked Nov 24, 2016 in Databases by makhdoom ghaya Boss (30.8k points) | 1.1k views

+1 vote

0 answers

10

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?

asked Nov 24, 2016 in Databases by Tendua Boss (16.1k points) | 309 views

+4 votes

1 answer

11

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

asked Oct 30, 2016 in Databases by GateAspirant999 Active (2.5k points) | 880 views

+5 votes

1 answer

12

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

asked Oct 19, 2016 in Databases by Habibkhan Veteran (102k points) | 420 views

+4 votes

2 answers

13

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

asked Oct 19, 2016 in Databases by KISHALAY DAS Active (4.9k points) | 638 views

+5 votes

2 answers

14

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

asked Sep 21, 2016 in Databases by resilientknight Active (2.1k points) | 240 views

+4 votes

1 answer

15

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

asked Sep 21, 2016 in Databases by resilientknight Active (2.1k points) | 282 views

0 votes

2 answers

16

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

asked Sep 17, 2016 in Databases by resilientknight Active (2.1k points) | 273 views

+1 vote

1 answer

17

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.

asked Sep 15, 2016 in Databases by GateAspirant999 Active (2.5k points) | 226 views

+3 votes

1 answer

18

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

asked Aug 16, 2016 in Databases by Payal Rastogi Junior (939 points) | 269 views

+3 votes

1 answer

19

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

asked Aug 2, 2016 in Databases by sumedha (51 points) | 289 views

+3 votes

3 answers

20

UGCNET-June2014-II-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

asked Jul 1, 2016 in Databases by makhdoom ghaya Boss (30.8k points) | 1.5k views

+1 vote

0 answers

21

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.

asked May 31, 2016 in Databases by jothee Veteran (105k points) | 163 views

+1 vote

1 answer

22

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

asked Jan 15, 2016 in Databases by Prasanna Active (4.7k points) | 1.1k views

0 votes

0 answers

23

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

asked Jan 15, 2016 in Databases by shivanisrivarshini Boss (13.9k points) | 112 views

+1 vote

1 answer

24

Indexing

asked Jan 8, 2016 in Databases by bahirNaik Active (3k points) | 591 views

+4 votes

1 answer

25

Indexing (Find no. of Blocks)

asked Jan 2, 2016 in Databases by Himanshu1 Boss (15.9k points) | 959 views

+3 votes

2 answers

26

B-Tree / possible records

asked Jan 2, 2016 in Databases by Himanshu1 Boss (15.9k points) | 323 views

+3 votes

1 answer

27

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

asked Dec 18, 2015 in Databases by Sandeep Singh Loyal (7.2k points) | 647 views

+13 votes

3 answers

28

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

asked Oct 12, 2015 in Databases by ajit Active (2.5k points) | 4.1k views

+32 votes

2 answers

29

GATE2015-1-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. Than that index is called Dense Sparse Clustered Unclustered

asked Feb 13, 2015 in Databases by makhdoom ghaya Boss (30.8k points) | 4.7k views

+6 votes

3 answers

30

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

asked Oct 19, 2014 in Databases by Keith Kr Loyal (5.9k points) | 1.7k views

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

Recent questions tagged indexing

Recent Posts

Recent Blog Comments