We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>


Looking For Something at vustudents.ning.com? Click Here to Search

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.

+ Click Here To Join also Our facebook study Group.

..How to Join Subject Study Groups & Get Helping Material?..


See Your Saved Posts Timeline

Views: 4688

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

Replies to This Discussion

Hi help the Solved GDB 

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.

Tree­ structured indexes are good for searches, especially range selections.

Using this particular field as the search key, choosing a hash indexed file would be the best.

 

 

I think "Clustered Index" type use ho gi...bcz is type me hm both hash n B+ tree use kr skte hn for storing data.

Many of the these concepts are orthogonal. A clustered index means that the rows are arranged in the table in the same order as they appear in the index. Independently, that index can be implemented using a B-tree, a B+ tree, a hash, spatially, etc. And then it may partition the table or not. One aspect may constrain but does not necessarily imply another.

i think we use B+ tree coz indexed file fast hai but kuch pay uska work nahi hai so my opinion is B+ Tree

net pay serch maro apni book ko zara ghoor say parhoo meri traf say B+ tree final hai ankh band ker kay

On my point of view, we are used B+ tree
Because B+ trees don't have data associated with interior nodes, more keys can fit on a page of memory. Therefore, it will require fewer cache misses in order to access data that is on a leaf node.
The leaf nodes of B+ trees are linked, so doing a full scan of all objects in a tree requires just one linear pass through all the leaf nodes. A B tree, on the other hand, would require a traversal of every level in the tree. This full-tree traversal will likely involve more cache misses than the linear traversal of B+ leaves.

HASH is an unordered key-value map. It's even more efficient than BTREE: O(1) instead of O(log n); but it doesn't have any concept of order. That means that is can't be used to avoid sort operations, or to fetch ranges.

i think B+ tree answer ha

Equality search is quicker in hash , range search is quicker in B-tree.

b+ tree is a balance tree structure, any insert/ delete/ update does not affect the performance.

RSS

Latest Activity

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

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