answersLogoWhite

0

What else can I help you with?

Related Questions

Explain the distinction between closed an open hashing discus the relative merits of each technique in database application?

A hash table is where data storage for a key-value pair is done by generating an index using a hash function. Open Hashing (aka Separate chaining) is simpler to implement, and more efficient for large records or sparse tables. Closed Hashing (aka Open Addressing) is more complex but can be more efficient, especially for small data records.


Explain the distinction between closed an open hashing Discuss the relative merits of each technique in database application?

A hash table is where data storage for a key-value pair is done by generating an index using a hash function. Open Hashing (aka Separate chaining) is simpler to implement, and more efficient for large records or sparse tables. Closed Hashing (aka Open Addressing) is more complex but can be more efficient, especially for small data records.


What are different types of hashing techniques are there in DBMS?

there are 2 types of hashing techniques 1- Static hashing 2-Dynamic hashing


What are the different types of collision resolution techniques?

Open addressing (closed hashing), The methods used include: Overflow block & Closed addressing (open hashing) The methods used include: Linked list, Binary tree..


What are the difference between static and dynamic hashing in DBMS?

Search operation in static hashing is time consuming, but in dynamic hashing it is not.


Difference between Internal hashing n external hashing?

Internal hashing mainly used for internal file, it is particularly an array of records. External hashing used for file disk


What is Homomorphic Hashing?

Homomorphic Hashing is a algorithm technique used for verifying data.


What are the advantages and disadvantages of theocracy?

No Answer -Thread Closed-


What are advantages and disadvantages of theocracy?

No Answer -Thread Closed-


What are the advantages and disadvantages of the closed source software?

What are the advantages and disadvantages of the close source software ?


Define hashing and describe briefly including types of hashing and where it is used and advantages and disadvantages of hashing?

Hashing is performed on arbitrary data by a hash function. A hash function is any function that can convert data to either a number or an alphanumeric code. There are possibly as many types of hashing as there are data. How precisely the hash function works depends on what data it is meant to generate a hash code from. Hashing is used for a variety of things. For example, a hash table is a data structure used for storing data in memory. Instead of iterating through the structure to find a specific item, we associate a key (hash code) to a particular item (data). A hash code can be generated from a file or disk image. If the data does not match the code, then the data is assumed to be corrupted. Hashing has the advantage of taking a larger amount of data and representing it as a smaller amount of data (hash code). The code generated is unique to the data it came from. Generating a hash code can take time however, depending on the function and the data. Some hash functions include Bernstein hash, Fowler-Noll-Vo hash, Jenkins hash, MurmurHash, Pearson hashing and Zobrist hashing.


What is hashing function in data structure?

If you read up on hashing, why hashing is done, what are its uses. Then you will be able to answer your own question. More to the point you will have studied the material that your homework question is intended to make you study. It is educational.