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

What are object interaction diagrams, What are object interaction diagrams?...

What are object interaction diagrams? Object interaction diagrams are the diagrams that used to describe order in which messages are communicated in execution of an operation,

Which model is used to store data in tree structures, 1. Which model is use...

1. Which model is used to store data in tree structures Ans: Hierarchical model is used to store data in tree structures

What are the different approaches for database design, What are the differe...

What are the different approaches for database design? There are two basic approaches for database design which are as follows: Attribute driven: It compiles a list of att

What is normalization, What is normalization? It is a method of analysi...

What is normalization? It is a method of analysing the given relation schemas based on their Functional Dependencies (FDs) and primary key to attain the properties (1).Minim

What is a security, What is a security? Securities are claims on financ...

What is a security? Securities are claims on financial assets.  They can be illustrated as "claim checks" which give their owners the right to receive funds in the future.  Sec

Describe physical data independence, Describe Physical Data independence ? ...

Describe Physical Data independence ? Physical Data Independence - It is capacity to modify the internal schema without having to change conceptual schema. Therefore, the exter

Produce a set of relations - normalisation, Produce a set of relations (equ...

Produce a set of relations (equivalent to the Finkelstein entity list) in third normal form (3NF) from the following un-normalised relation. You must use the Finkelstein methodolog

Illustrate the view of software architecture, Illustrate the view of softwa...

Illustrate the view of software architecture A model is a semantically closed abstraction of system composes of elements. It can be visualized using any of the following five v

Relation and relational schema, A relation has: Relational Schema ...

A relation has: Relational Schema Relation instance Relational Schema: A relational schema shows the relation's name, its attributes and the domain of every a

Lossless-join decomposition, Lossless-Join Decomposition   Let us sh...

Lossless-Join Decomposition   Let us show an intuitive decomposition of a relation. We require a better basis for deciding decompositions since intuition may not always be r

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