Define and differentiate among ordered indexing and hashing, Database Management System

Define and differentiate between ordered indexing and hashing.

Ans: Ordered indexing: To gain fast random access to records in a file, we can make of an index structure. Every index structure is related with a specific search key. An ordered index stores the values of the search keys in sorted order and relates with each search key records which contain it. The records in the indexed file may themselves be stored in some sorted order. A file may have various indices on different search keys.                     

Hashing: It as well provides a way of constructing indices. In hashing, the address of the disk lock consisting of a desired record directly is computed by a function on the search-key value of the record.

Differentiate among the ordered indexing and hashing: Ordered indexing is stored in sorted order while in Hashing search keys are distributed consistently across "buckets" using 'hash function'.

Posted Date: 5/4/2013 6:00:30 AM | Location : United States

Related Discussions:- Define and differentiate among ordered indexing and hashing, Assignment Help, Ask Question on Define and differentiate among ordered indexing and hashing, Get Answer, Expert's Help, Define and differentiate among ordered indexing and hashing Discussions

Write discussion on Define and differentiate among ordered indexing and hashing
Your posts are moderated
Related Questions

Views A view is like a window by which data from tables can be changed or viewed. The table on which a view is based is known as Base table. The view is stored as a SELECT stat

10A.53 Code an Oracle Database trigger to enforce the constraint that an employee can never change his or her department. 10A.54 Code an Oracle Database trigger to allow the delet

how to implement hyrise in C plus plus

Special comparison operator used in where Clause a.   between. ...and...It gives range among two values (inclusive) Example: SELECT ENAME, SAL FROM EMP WHERE SAL BETWE

What is meant by computing the closure of a set of functional dependency? The closure of F denoted by F + is the set of functional dependencies logically implied by F.

Define Deadlock detection If a system does not employ a few protocols that make sure deadlock freedom, after that a detection and recovery scheme should be used. An algorithm

Create a table according to given data:  AmbulanceDriver(Driver_Number#, Name, Address, Birth_Date) AmbulanceDriverTeam(Team_Number#, Driver_Number#, Join_Date, Lea

A software contract and consultancy firm maintains details of all the various projects in which its employees are currently involved. These details comprise: Employee Numbe

State the Design of Associations Before designing associations, it is essential to know the way they are used. For this, analysis of association traversals is required. It is