Recent questions tagged indexing

1
This index is a dense index ...right ...???
2
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 ...
3
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 index is ... of 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.
4
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 >> Database file block ... >> Index block factor c. Database file block factor = (Index block factor)/2 d. Database file block factor = Index block factor
5
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
6
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_____$?$
7
What is the difference between different types of indices: 1. Clustered Index 2. Unclustered Index 3. Dense Index 4. Sparse Index
–1 vote
8
9
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
1 vote
10
11
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.
12
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 number of keys ... and 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
13
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 required ... also the size of the master index. The referencing capability (fanout ratio) per block of index storage may be considered to be $32$.
1 vote
14
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 like book index at the back. ... primary index is a clustred index then what is clustred index that states that make a entry for unique keys only. Are they both the same?
15
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, and the size of a block porinte is ... level and second level blocks in the multilevel index are respectively a. 8 and 1 b. 16 and 1 c. 8 and 2 d. None of these
16
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..
17
I think it would be 7..please check
18
Maximum number of clustered indices one can build for a table with n attributes, which already has a primary index?
19
How many different secondary indices are possible for a table with n attributes(Not necessarily at the same time)?
1 vote
20
A clustered index is typicallly less expensive to maintain than unclustered index. True or False.
1 vote
21
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 on average, ... (D) Clustered B+ tree index on the budge field of Dept I feel in first paragraph what all important is Dept table.
22
What is the answer of 2nd Question ??
23
If one block access time is 30ms,then what is the access time for 100 blocks index if we use binary search?
24
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
1 vote
25
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+$ ... of 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.
1 vote