Explain hashing techniques, Database Management System

Assignment Help:

Explain Hashing techniques

The hashing techniques can be categorized as: Static Hashing Techniques - In this method, the data can be viewed a collection of buckets, along with one primary page and probably additional overflow pages per bucket. A file contains buckets 0 through N-1, with one primary page per bucket basically and additional overflow pages chained with bucket, if needed later. Buckets consist of data entries (or data records). A main drawback of the static hashing is that the hash address space is fixed. Therefore, it is hard to expand or shrink the file dynamically.


Related Discussions:- Explain hashing techniques

Types of locks, Types of Locks There are two necessary types of locks: ...

Types of Locks There are two necessary types of locks: Binary lock : This locking mechanism has two states for to a data item: locked or unlocked Multiple-mode loc

Designing the fields in the data base, Designing the fields in the data bas...

Designing the fields in the data base The following are the considerations one has to remain in mind while designing the fields in the data base. Coding, compression, en

Explain the dynamic hashing techniques, Explain the Dynamic Hashing Techniq...

Explain the Dynamic Hashing Techniques There are two methods in it: extendible hashing - stores an access structure in addition to the file, and therefore is somewhat identica

RDBMS, DISADVANTAGES OF RDBMS

DISADVANTAGES OF RDBMS

Explain the advantages of database management system, Advantages of Databas...

Advantages of Database management system Let us summarize the advantages. Reduction of Redundancy: This is perhaps the most important advantage of using DBMS. Redundancy i

What is the disadvantage of a call by reference, What is the disadvantage o...

What is the disadvantage of a call by reference? During a call by reference damage or loss of data is not restricted to the subroutine, but will instantly lead to alters to th

Draw the precedence graph, Draw the precedence graph of the following sched...

Draw the precedence graph of the following schedule and determine whether the schedule is serializable. (Note that all instructions, except lock and unlock, are omitted. We assume

Sql select employee from table with at least one department, Consider emplo...

Consider employee (e_no, e_name, e_salary, d_code), dept (d_code, d_name) and dependent (depndt_name, e_no, relation). Show the names of employees in purchase and accounts departm

External failure-database recovery and security, External failure : A failu...

External failure : A failure can also result because of an external cause, such as earthquakes, fire, floods, etc. The database must be duly backed up to avoid troubles occurring d

Explain retrieval in qbe, Explain retrieval in QBE? Retrieval in QBE : ...

Explain retrieval in QBE? Retrieval in QBE : A "GUI" for expressing queries. Based on the Domain Relational Calculus (DRC) Actually invented before GUIs. Very co

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