UNIT – IV

IMPLEMENTATION TECHNIQUES
PART – A
1. What is the need of RAID? [May - 2013]
 To increase performance
 Increase reliability
 Give greater throughput than a single disk
 Even when disk failure replacement disk installed and data restored

2. What are all the features of RAID?

 It contains set of physical disk drivers
 OS views the separate disks as a single logical disks
 Data is distributed across physical drivers of the array
 Partitioning helped to recover the data.

3. Define Software and Hardware RAID systems. [May - 2016]

The hardware –based array manages the RAID subsystem independently from
the host. It presents a single disk per RAID array to the host.
In software, various RAID levels in the kernel disk code. It offers the cheapest
possible solution, as expensive disk controller cards.

4. What are ordered indices? [Dec – 2011,2017 May - 2014]

This is type of indexing which is based on stored ordering values. Various
ordered indices are primary indexing, secondary indexing.

5. What are the two types of ordered indices?

Two types of ordered indices are primary indexing and secondary indexing.
The primary indexing can be further classified into dense indexing and sparse
indexing and single level indexing and multilevel indexing.

6. Give the comparison between ordered indices and hashing.

 If range of queries are common, ordered indices are to be used.
 The buckets containing records can be chained in sorted order in case of
ordered indices.
 Hashing is generally better at retrieving records having a specified value of
the key.
 Hash function assigns values randomly to buckets. Thus, there is no simple
notion of “next bucket in sorted order”

7. What are the causes of bucket overflow in a hash file organization?

Insufficient buckets: For the total number of buckets there are insufficient
number of buckets to occupy.
Skew: Some buckets are assigned more records than are others, so a bucket
might overflow even while other buckets still have space. This situation is known as
bucket skew.
8. What can be done to reduce the occurrences of bucket overflows in a hash file
organization? [Dec - 2012]
 A bucket is a unit of storage containing one or more records.
 The file blocks are divided into M equal-sized buckets, numbered bucket(),
bucket1…bucket-1. Typically, a bucket corresponds to one disk block.
 In a hash file organization user obtain the bucket of a record directly from
its search-key value using a hash function, h(k)
 To reduce overflow records, a hash file is typically kept 7-80% full
 The hash function h should distribute the records uniformly among the
buckets otherwise, search time will be increased because many overflow records will
exist.

9. Distinguish between dense and sparse indices.

S.No Dense Indices Sparse Indices
1 An index record appears for every Index records are created only for some
search key value in file of the record
2 This record contains search key To locate a record, find index record
value and a pointer to the actual with the largest search key value less
record than or equal to the search key values
user looking for.

10. When is it preferable to use a dense index rather than a sparse index? Explain
your answer. [Dec - 2011]
 It is preferable to use a dense index instead of a sparse index when the file
is not shorted on the indexed filed.
 When the index file is small compared to the size of memory.

11. How does B -tree differs from a B+ tree? Why is a B+ tree usually preferred as
an access structure to a data file?
In B+ tree data stores in leaf node only and searching is easy. It has redundant
search key and does not waste space. In B tree both keys and data stored in internal
and leaf nodes. Difficult to search
12. Define Static Hashing.
 No space for some data entry, allocate new overflow page.
 The data record onto the page and add the page to overflow chain

13. Define Dynamic Hashing.

 Data buckets are added and removed dynamically as the database grows and on-
demand
 Not expand or shrink dynamically as the size of the database grows or shrinks.
 Technique – extensible hashing.
 The data record onto the page and add the page to overflow chain

14. What are the disadvantages of B tree over B+ tree. [Dec - 2016]
 Searching of a key value becomes difficult in B- tree as data can not be found
in the leaf node.
 The leaf node can not store linked list and thus wastes the space.
15. Mention different hashing techniques. [May - 2012]
Two types of hashing techniques are
 Static Hashing
 Dynamic Hashing

16. List the mechanisms to avoid collision during hashing. [Dec – 2016]
 Separate chaining
 Open addressing techniques
 Linear probing
 Quadratic probing

17. What is basic difference between static hashing and dynamic hashing?
[May – 2013, 2015 Dec – 2014, 2015]
S.No Static Hashing Dynamic hashing
1 The number of buckets are fixed The number of buckets are not fixed
2 Chaining is used There is no need of Chaining
3 Open hashing and closed hashing Extendible hashing and linear hashing
are forms of static hashing are forms of dynamic hashing
4 Minimum space overhead due to
Space overhead is more
dynamic nature
5 As file grows the performance of There is no degradation in performance
static hash function decreases when the file grows
6 The bucket address table is not
The bucket address table is required
required
7 The bucket address table is used to
The bucket is directly accessed
access the bucket

18. What is need for query optimization? [May - 2015]

Query optimization is required for fast execution of long running complex queries.
19. Which cost component are used most commonly as the basis for cot function?
Disk access or secondary storage access is considered most commonly as a
basis for cost function.

20. What is query execution plan? [May - 2017]

To specify fully how to evaluate a query, need not only to provide the
relational – algebra expression, but also to annotate it with instructions specifying
how to evaluate each operation. This annotated structure is called query execution
plan.
21. Difference between B Trees and B+ Trees.
S.No B Trees B+ Trees
1 Store both keys and data in the Store the data in the leaf nodes only
internal and leaf nodes
2 It Wastes Space It does not wastes Space
3 The leaf node cannot store using The leaf nodes are connected using
linked list linked list
4 Searching becomes difficult in B- Searching of any data in a B+ tree is
tree as data cannot be found in the very easy because all the data in leaf
leaf node. nodes
5 The B tree does not store redundant The B+ tree stores redundant search key
search key

22. What are all the three approaches of organizing records?

 Heap File Organization
 Sequential File Organization
 Hashing File Organization

23. Define Slotted page structure.

 The variable length record can be stored in blocks.
 A specialized structure called slotted page structure used for organizing the
records within a block.

24. What are all the parts of variable length attribute?

 An initial part with fixed length attributes. Represented by (offset, length)
 Followed by data for variable length attributes.
25. Give the rules for inserting data in Sequential file organization.
 If there is free space insert record there
 If no free space, insert the record in an overflow block
 In either case, pointer chain must be updated.
 PART – B
1. What is RAID? List the difference levels in RAID technology and explain its features.
[May - 17]
2. Describe different types of file organization. Explain using a sketch of each of the,
with their advantages and disadvantages. [Dec - 08]
3. Since indices speed processing. Why might they not be kept on several search keys?
List as many reasons as possible. [Dec - 11]
4. Brief the following concept: Ordered Indices. [Dec – 04,08,15 May-06]
5. Illustrate indexing and hashing techniques with suitable example. [Dec - 15]
6. Explain the B+ indexes on multiple keys with suitable examples. [Dec–17,May-16]
7. Explain detail about i) B+ tree index ii) B tree index files. [Dec -12,14, May - 08]
8. Write a note on hashing and hash file organization [May -14, Dec-05]
9. Why is hash structure not the best choice for a search key on which range of queries
are likely? [May - 06]
10. What is hashing? Explain Static and Dynamic hashing with an example
[May -18, Dec-17]
11. What is query optimization? Outline the steps in query optimization. [May-18]
12. Briefly explain about query processing with an example. [May -14]
13. Discuss about join order optimization and Heuristic optimization algorithm[May - 15]
 PART – C
1. Construct B+ tree for following data 30,31,23,32,22,28,24,29, where number of
pointers that fit in one node are 5.
2. Construct B+ tree to insert the following (order of the tree is 3)
26,27,28,3,4,7,9,46,48,51,2,6.
3. Create B tree of order 3 for following data: 20,10,30,15,12,40,50.
4. Construct B+ Tree for the following set of key values (2,3,5,7,11,17,19,23,29,31)
Assume that the tree is initially empty and values are added in ascending order.
Construct B+ tree for the cases where the number of pointers that fit one node is
four. After creation of B+ tree perform following series of operations.
(a) Insert 9, (b) Insert 10, (c) Insert 8, (d) Delete 23, (e) Delete 19
5. The following key values are organized in an extendible hashing technique. 1 3 5
8 9 12 17 28. Show the extendible hash structure for this file if the hash function is
h(x)=x mod 8 and buckets can hold three records. Show extendible hash structure
changes as the result of each of the following steps:
Insert 2, Insert 24, Delete 5, Delete 12