Dark Mode

Recent questions tagged indexing

2 votes

1 answer

61

Ace Test Series: DBMS - Indexing And File Organization
Here the indexing is done on ordered field so which to use Dense or Sparse because both can be done here ?

Na462 asked in Databases Jun 29, 2018

by Na462

686 views

1 vote

1 answer

62

Ace Test Series: DBMS - B+ Trees And Indexing
Please Solve this question. I didn't understood the question properly so please Make Me as well :) What is meant by Leaf Page ?

Na462 asked in Databases Jun 29, 2018

by Na462

627 views

1 vote

0 answers

63

Doubt
1. Why in question They treat both clustered and primary indices Different, because both are the same thing(written in Korth). Only the thing is Primary indices means search key is Primary Key and Clustered means it can be any search Key and both defines the ... a clustered index and i took another attribute not in the order say Salary and created a different Secondary index on the Records ?

Na462 asked in Databases Jun 13, 2018

by Na462

377 views

4 votes

1 answer

64

Indexing
Database file consist 50000 records with record size 100 bytes, block size 512 bytes. If sparse B+ tree index build over given database file with search key size 20 bytes both block pointer and record pointer sizes 12 bytes each. How many maximum index blocks required if node order P is defined as between ⎡P/2⎤ to P pointers per node?

Na462 asked in Databases Jun 4, 2018

by Na462

5.4k views

4 votes

1 answer

65

Indexing
A database relation has $5000$ records block can hold either $10$ records or $15$ keys and pointer pairs. If sparse index is used at $1^{st}$ level and multilevel indexing is used in system, then the number of disk block required to store relation and index is _______. 1. Please explain the approach used. 2. what had been the answer if instead of sparse it would have been dense indexing ?

Na462 asked in Databases May 29, 2018

by Na462

2.1k views

4 votes

1 answer

66

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.

Na462 asked in Databases May 26, 2018

by Na462

3.2k views

1 vote

3 answers

67

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. Then that index is called:- Dense Sparse. Clustered Unclustered

Na462 asked in Databases May 26, 2018

by Na462

1.3k views

0 votes

0 answers

68

ER Diagram Table
Minimum number of Relations:- The Answer is $5$. Please see my Reason behind it:- 1. $R_6$ and $E_5$ CAN be merged giving $1$ relation we cant merge with $E_3$, because its a strong entity even though the participation is total. 2. $E_1$ and $E_4$ Gives ... $R_5$ can be merged. 4. $R_2$ will have separate table because of many to many (Doubt here) Hence total $5$ tables we got.

Na462 asked in Databases May 17, 2018

by Na462

336 views

3 votes

1 answer

69

B+ Tree
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node. A. B tree index has more levels than B+ tree index for large number of keys. B. B+ tree index has more levels than B ... tree best for sequential access of records. D. B+ tree index nodes more than B+ tree for large number of keys. Please Explain every Point.

Na462 asked in Databases May 12, 2018

by Na462

1.4k views

2 votes

0 answers

70

Made easy test series2019 database
Consider two relations R(A, B, C) and S(B, D) with R contains 5000 tupples stored in a sequential file sorted on attribute A and S contain 100000 tupples stored in a sequential file sorted on attribute B. Each block can hold 10 R tupples or 10 S tupples. Which one of ... A A dense index on R.B B A sparse index on R.B C A dense index on S.B D A sparse index on S.B

visakh v asked in Databases May 3, 2018

367 views

2 votes

2 answers

71

ISRO2018-51
Which of the following is dense index? Primary index Clustered index Secondary index Secondary non-key index

Arjun asked in Databases Apr 22, 2018

by Arjun

10.1k views

0 votes

2 answers

72

Indexing
What is the Difference between Primary and Clustering Index or both are actually the Same ?

Na462 asked in Databases Apr 12, 2018

by Na462

612 views

0 votes

1 answer

73

Doubt Question
In this Question :- Let there is a Table named Stud_records with 3000 records of fixed length , each record size is 50 Bytes and records are stored in a block of size 512 Bytes , If secondary index is built on the key field of size 10 Bytes and a block pointer of size 5 ... 88 Blocks The number of blocks in First level index = (88 * 15)/512 = 3 ???? Why am i wrong ?? Please Help?

Na462 asked in Databases Apr 12, 2018

by Na462

638 views

1 vote

1 answer

74

testbook test series
which of the statements are correct? A a clustered index offers much better performance than unclustered index for range queries B a clustered index istypically less expensive to manage than unclustered index

Mayank Gupta 3 asked in Databases Mar 4, 2018

by Mayank Gupta 3

634 views

0 votes

1 answer

75

testbook question
what is the difference between primary index and secondary index? A there can be only one secondary index but many primary index B many primary , many secondary index C primary is dense but secondary sparse D one primary ,many secondary answer is D given. give some explaination for answer.

Mayank Gupta 3 asked in Databases Mar 4, 2018

by Mayank Gupta 3

273 views

0 votes

0 answers

76

CLustered index
I have read that clustered index is an index on ordered non-key field of DB. However, in SQL clustered index can be created on Primary key. Infact, by default primary key constraint automatically creates clustered index if one doesn't already exists on the table. So, is SQL clustered index different from the one defined in theory?

Nymeria asked in Databases Feb 16, 2018

794 views

0 votes

0 answers

77

B-tree
B tree has minimum space utilization equals to 66.6%. explain?

hacker16 asked in Databases Jan 30, 2018

362 views

0 votes

1 answer

78

Maximum height of a B+ tree of order m with n key values is (With Derivation)
Maximum height of a B+ tree of order m with n key values is (With Derivation), the answer is known Logceil(m/2) N I tried deriving but had some trouble, could someone assist with the derivation or derivation process ?

Salazar asked in Databases Jan 29, 2018

3.9k views

2 votes

1 answer

79

MadeEasy Test Series 2018: Databases - Indexing
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is

sumit chakraborty asked in Databases Jan 26, 2018

by sumit chakraborty

1.1k views

2 votes

2 answers

80

MadeEasy Test Series 2018: Databases - Indexing
Database file consist 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). The maximum number of levels of index required for sparse B+ tree index for database file are ______.

nish kim asked in Databases Jan 19, 2018

1.3k views

2 votes

2 answers

81

MadeEasy Test Series 2018: Databases - Indexing
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is ________. I am getting 63 as the answer, but in the solution, it's saying 64. Can anyone check?

souravsaha asked in Databases Jan 15, 2018

1.7k views

1 vote

0 answers

82

nikkey123 asked in Databases Jan 11, 2018

296 views

1 vote

0 answers

83

Indexing
Database relation has 10,000 records. Block can hold either 4 records or 15 key and pointer pairs. If dense index used at 1st level and multilevel indexing is used for 1st level index then the minimum number of disk blocks required to store relation are ________. My ans : 2680 ??

Anjan asked in Databases Jan 9, 2018

by Anjan

1.5k views

2 votes

0 answers

84

MadeEasy Test Series: Databases - Indexing
#DBMS Which of the following statements is/are true? (A) For any data file it is possible to construct two separate sparse first level indexes on different keys. (B) For any data file, it is possible to construct two separate dense ... data file, it is possible to construct a sparse first level index and a dense second level index both should be useful.

Abhishek Kumar Singh asked in Databases Jan 4, 2018

by Abhishek Kumar Singh

592 views

2 votes

1 answer

85

index
Every ________ index is Clustered a)primary b)secondary

Anjan asked in Databases Dec 29, 2017

by Anjan

985 views

1 vote

0 answers

86

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. Then that index is called Dense Sparse Clustered Unclustered Given answer is :- Sparse. Is it correct? This is similar to https://gateoverflow.in/8222/gate2015-1_24 with some variation i highlighted

rahul sharma 5 asked in Databases Dec 29, 2017

by rahul sharma 5

369 views

3 votes

1 answer

87

MadeEasy Test Series: Databases - Indexing
" For any data file, it is possible to construct two separate dense first level indexes on different keys. " How the above statement is true ??

ashish pal asked in Databases Dec 26, 2017

488 views

0 votes

0 answers

88

Ace Test Series: Databases - Indexing

ashish pal asked in Databases Dec 26, 2017

340 views

0 votes

0 answers

89

Database indexing

Abhishek Kumar Singh asked in Databases Dec 23, 2017

by Abhishek Kumar Singh

484 views

0 votes

0 answers

90

Database index.
A file can have either one primary index or one clustered index but not both. True or false ? Give an answer with explanation.

Xylene asked in Databases Dec 22, 2017

by Xylene

1.3k views

Page:

« prev
1
2
3
4
5
6
next »

Recent questions tagged indexing