B+ tree sparse indexing
closed

Aditya Bahuguna asked Jan 5, 2018 • closed Jan 6, 2018 by LeenSharma

440 views

See all

Related questions

23 votes

1 answer

reena_kandari asked Oct 26, 2017

5,787 views

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

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

reena_kandari

5.8k views

reena_kandari asked Oct 26, 2017

0 votes

1 answer

set2018 asked Nov 10, 2017

1,688 views

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.

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

set2018

1.7k views

set2018 asked Nov 10, 2017

0 votes

1 answer

AnilGoudar asked Jun 10, 2017

526 views

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

Is it possible to have an Index file which is both dense index and sparse Index?

AnilGoudar

526 views

AnilGoudar asked Jun 10, 2017

4 votes

1 answer

Na462 asked May 26, 2018

3,216 views

B+ tree indexing
Which of the following statements true for $B$ tree and $B^+$ tree index? A. $B$ tree index faster for range queries compare to $B^+$ tree index. B. If disk block allocated for $B^+$ tree index and same size disk block allocated for $B$ tree index then number ... $B^+$ tree index less than equal to I/O cost of $B$ tree index for random access of same key from set of distinct keys.

Which of the following statements true for $B$ tree and $B^+$ tree index?A. $B$ tree index faster for range queries compare to $B^+$ tree index.B. If disk block allocated...

Na462

3.2k views

Na462 asked May 26, 2018

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

B+ tree sparse indexing
closed

Please log in or register to add a comment.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

0 Answers

Related questions

0