answersLogoWhite

0

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

User Avatar

Wiki User

13y ago

What else can I help you with?

Related Questions

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.


What are the two names of the most popular hashing algorithms?

Both SHA-1 and MD5 are good hashing algorithms. The primary difference between the two is speed; MD5 is faster to process than SHA.


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 is Homomorphic Hashing?

Homomorphic Hashing is a algorithm technique used for verifying data.


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.


Why do you use hashing and not array?

Hashing provides a method to search for data.Hashing provides a method to search for data.Hashing provides a method to search for data.Hashing provides a method to search for data.


Another term for an icv is?

Hashing.


Is double hashing a rehashing?

ya it it


What actors and actresses appeared in Hashing It Out - 1996?

The cast of Hashing It Out - 1996 includes: Tony Campolo as Host Bill Turpie as himself


How does bucket hashing work to efficiently distribute data into different buckets based on a specific hashing function?

Bucket hashing works by using a hashing function to assign each data item to a specific bucket. The hashing function calculates a unique hash value for each item, which determines the bucket it belongs to. This helps distribute the data evenly across different buckets, making it easier to retrieve and manage the data efficiently.


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.