Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

GDB Starting Date Thursday, February 18, 2016 Closing Date Friday, February 19, 2016 Status Open Question Title Indexing, Hashing

Problem Statement:


Suppose you are working as a database administrator in a company which has a huge database that changes frequently. A lot of transactions, searches and DML operations are being processed daily. A database file can be organized in different ways to support multiple operations. Each file organization technique has benefits on other due to some characteristics.


The main concern at the company is scanning and insertion operations. Every user in the company searches the records according to his/her own needs. Some of them need the records based on range while other searches on some particular field. You can store database using B+ tree or hash indexed file.


Keeping in view the above scenario, which type of indexing would you choose? Support your choice with logical arguments.

Discuss with each other best solution will come.

Views: 4806

Replies to This Discussion

yup so ap kia kehti hain ab Kiran k kia Use kia jaye??

B+ tree 

is mein right solution kn sa?

My Blog:

Asslamu Alaikum, Sab apne idea share karo our us se answer akhaz karo q k time buhat kam he gdb close honey main.

My Blog:


No index structure can satisfy all needs, but the self-balancing B-tree index comes closest to optimizing the performance of searches on large sets of data. Each B-tree node holds multiple keys and pointers. The maximum number of keys in a node supported by a specific B-tree is the order of that tree. Each node has a potential of order+1 pointers to the level below it. For example, the order=2 B-tree illustrated in Figure 7-1 has tree pointers: to child nodes whose value is less than the first key, to the child nodes whose value is greater than the first key and less than the second key, and to the child nodes whose value is greater than the second key. Thus, the B-tree algorithm minimizes the number of reads and writes necessary to locate a record by passing through fewer nodes than in a binary tree algorithm, which has only one key and at most two children for each decision node. Here we describe the Knuth variation in which the index consists of two parts: a sequence set that provides fast sequential access to the data, and an index set that provides direct access to the sequence set.

Please Discuss here about this GDB.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions.


Check my solution. just edit your answer.


I would use B+ tree index Technique, for the following reasons.

Reorganization of nodes does not affect the performance of the file.
Automatically adjust the nodes to the new file record.

change ker lena Bhaio....


Looking For Something? Search Below

Latest Activity

© 2022   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service