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

Assignment Help:

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'.


Related Discussions:- Define and differentiate among ordered indexing and hashing

Construct a generalization-specialization hierarchy, Construct a generaliza...

Construct a generalization-specialization hierarchy for a motor-vehicle sales company. The company sells motorcycles that comprise an engine number and cost; cars that have a chass

Gui interfaces, Draw the database using the ER approach and then make the t...

Draw the database using the ER approach and then make the tables accordingly. Populate the tables so that every table have at least 10 tuples. Then using Java and SQL, execute the

Data analysis and design, give some example real-life situations where DBMS...

give some example real-life situations where DBMS are most suiitabe

Define the phases of two phase locking protocol, Define the phases of two p...

Define the phases of two phase locking protocol Growing phase: a transaction may get locks but not release any lock. Shrinking phase: a transaction might be release locks bu

How many levels can be viewed architecture of the database, How many levels...

How many levels can be viewed in Architecture of the database ? Architecture of the database can be viewed as three levels.

Explain embedding sql statements, Question 1 Explain the functions of t...

Question 1 Explain the functions of the following Storage Manager Buffer Manager Transaction Manager 2 Discuss about system catalog in a relational DBMS 3

File manager-database management system, File Manager File manager ha...

File Manager File manager handles the allocation of space on disk storage. It starts and maintains the list of structures and indices described in the internal schema that is

Data integrity, You are required to implement integrity constraints within ...

You are required to implement integrity constraints within the database to enforce the following requirements:  For Projects: Start date must be supplied. Start date cannot be i

Referential integrity, It can be easily defined as: The database must no...

It can be easily defined as: The database must not have any unmatched foreign key values. The term "unmatched foreign key value" means a foreign key value for which there doe

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd