Recent questions tagged indexing

0 votes

0 answers

1

data base 3
The difference between the minimum levels of B tree index required for 7000 keys and order of B tree node (P) is 12 (assume order P is max possible child pointers per B-tree node) and the minimum levels of B+ tree index required for 7000 keys and order of B+ tree node (P) is 12 (Assume P is max pointer possible to stage in B+ tree node) _________.

asked Nov 22, 2017 in Databases by nikkey123 Active (1.2k points) | 97 views

0 votes

1 answer

2

data base 2

asked Nov 22, 2017 in Databases by nikkey123 Active (1.2k points) | 92 views

0 votes

1 answer

3

data base 1

asked Nov 22, 2017 in Databases by nikkey123 Active (1.2k points) | 85 views

+1 vote

1 answer

4

Can anyone explain how? . Databases

asked Nov 18, 2017 in Databases by Parshu gate Active (3.1k points) | 68 views

+3 votes

3 answers

5

B+ tree
pls explain

asked Nov 14, 2017 in Databases by Nils Junior (593 points) | 125 views

0 votes

1 answer

6

indexing
please can someone explain dense index ,sparse index ,cluster indexing with a proper example instead of theory ?

asked Nov 10, 2017 in Databases by kewal (43 points) | 71 views

0 votes

1 answer

7

sparse/dense indexing
which statement is true? 1)for any data file it is possible to construct two separate sparse first level index on different keys. 2)for any data file it is possible to construct two separate dense first level index on different keys. 3)for any data file it is possible to construct a sparse first level index and a dense second level indexboth should be useful 4) none.

asked Nov 10, 2017 in Databases by set2018 Loyal (7.8k points) | 593 views

+1 vote

1 answer

8

indexing
Given a data file with 100 records per page and 1000 pages and on index page capacity of 512 index entries, how deep should be the B+ tree to index this file. please explain with a diagram.

asked Oct 28, 2017 in Databases by Arnabi Loyal (8k points) | 198 views

+2 votes

1 answer

9

indexing

asked Oct 28, 2017 in Databases by Arnabi Loyal (8k points) | 135 views

+1 vote

0 answers

10

Database: B+ Tree Insertion
Question: the below figure shows a B+ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value 34 is inserted into the B+-tree. Obtain the modified B-tree after insertion. My Solution Please validate the solution,

asked Oct 27, 2017 in Databases by Manu Thakur Boss (44.1k points) | 291 views

+20 votes

1 answer

11

B+tree with sparse/Dense indexing
Database file consists of $10,000$ records with record size of $100$ bytes, block size $512$ bytes. If sparse B+ tree index is built over given database file with search key size $22$ bytes and both block pointer and record pointer of size $12$ bytes each.Find out a)minimum index block required b)maximum index block required my answers a)$143$ b)$325$.

asked Oct 27, 2017 in Databases by reena_kandari Loyal (8.3k points) | 1.9k views

+2 votes

0 answers

12

Database: Multilevel Indexing
In the following question, How to know that at first level (base level) index entries will be recorded for a block or for each record?https://gateoverflow.in/2311/gate1993_14 See the highlighted part below, what if we have multilevel secondary inedxing?

asked Oct 26, 2017 in Databases by Manu Thakur Boss (44.1k points) | 350 views

+2 votes

1 answer

13

indexing doubt

asked Oct 25, 2017 in Databases by Arnabi Loyal (8k points) | 177 views

+2 votes

0 answers

14

indexing-testbook

asked Oct 21, 2017 in Databases by set2018 Loyal (7.8k points) | 94 views

+1 vote

1 answer

15

Indexing
Consider a disk with block size B=512 bytes. A block pointer is P=6 bytes long,and a record pointer is P R =7 bytes long. A file has r=30,000 EMPLOYEE records of fixed-length. Each record size is fixed 50 bytes. Find out the no. Of block b requires .assuming an unspanned organization.

asked Oct 17, 2017 in Databases by akankshadewangan24 Active (4k points) | 175 views

0 votes

2 answers

16

Indexing
consider a display block size is equal to 1024 bytes A block pointer 6 byte and record pointer 8 byte the file has 10000 employees record every record is fixed length of 100 bytes it is he is SSN which is a 2 byite the file is not ordered by the key field SSN and want to construct a secondary index on SSN and find out the number of blocks required in the first level index.

asked Oct 17, 2017 in Databases by akankshadewangan24 Active (4k points) | 109 views

+1 vote

2 answers

17

Indexing

asked Oct 16, 2017 in Databases by shivangi5 Active (1.2k points) | 193 views

+2 votes

3 answers

18

Indexing
Clustered index is dense or sparse or both?

asked Sep 23, 2017 in Databases by Arjun Kumar 1 (67 points) | 654 views

+1 vote

0 answers

19

Minimum number of index blocks
DB file consists of 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). How many minimum index blocks are required for sparse B+ tree index? I think the answer should be (417/10) + (42/11) +(4/11) = 42 + 4 + 1 = 47 (Assuming order of leaf and internal nodes are same as they are not given separately). Am I correct?

asked Sep 20, 2017 in Databases by Xylene Active (3.6k points) | 268 views

0 votes

1 answer

20

Sparse and Dense index doubt
Block size 1000 B Search key 12 B Pointer size 8B What is max records of DB 1) For Dense index B+ tree of 2 level 2) For Sparse index B+ tree of 2 level How ans will differ , Plz show

asked Sep 16, 2017 in Databases by srestha Veteran (119k points) | 231 views

+1 vote

0 answers

21

Multi- level Indexes
why Multi- level Indexes uses fan out as base of log function

asked Jul 22, 2017 in Databases by iamHarin (45 points) | 30 views

0 votes

1 answer

22

Self Doubt in Sparse Indexing and Dense Indexing
Is it possible to have an Index file which is both dense index and sparse Index?

asked Jun 11, 2017 in Databases by AnilGoudar Active (4.4k points) | 218 views

+2 votes

1 answer

23

databases
In the given B-Tree below , insert an index record with key 40 ? (order of b-tree is 4) ANSWER : PLEASE VERIFY ...

asked May 8, 2017 in Databases by vignesh (209 points) | 339 views

+3 votes

3 answers

24

Databases
A Clustered index A) is a dense index always. B) is a sparse index always. C) can be either dense index or a sparse index,but not both. D) can be both dense index and sparse index.

asked Apr 27, 2017 in Databases by vignesh (209 points) | 942 views

+1 vote

3 answers

25

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.

asked Apr 27, 2017 in Databases by vignesh (209 points) | 304 views

0 votes

0 answers

26

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

asked Apr 26, 2017 in Databases by vignesh (209 points) | 106 views

+2 votes

0 answers

27

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

asked Apr 26, 2017 in Databases by vignesh (209 points) | 112 views

0 votes

0 answers

28

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.

asked Apr 19, 2017 in Databases by kauray (215 points) | 134 views

+1 vote

2 answers

29

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

asked Jan 26, 2017 in Databases by pranjalgennext Active (1.3k points) | 172 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