Hashing Techniques

 In hash table data structures, several hashing techniques are commonly used. Here are some of the most popular ones:

  1. Division Hashing:

    • Uses the modulo operation to obtain a hash code. The formula is hash_code = key % table_size.
    • Simple and computationally efficient.
    • Prone to clustering if keys have a pattern that aligns with the table size.

  2. Multiplication Hashing:

    • Involves multiplying the key by a constant A in the range (0, 1), extracting the fractional part, and then multiplying it by the size of the hash table.
    • Formula: hash_code = int(table_size * ((key * A) % 1)).
    • Provides a more uniform distribution compared to division hashing.

  3. Universal Hashing:

    • Uses a family of hash functions, and a random hash function is selected for each instance of the hash table.
    • Reduces the likelihood of collisions, even for worst-case key distributions.
    • Achieves good average-case performance.

  4. Double Hashing:

    • Involves using a secondary hash function to resolve collisions.
    • The formula is hash_code = (hash1(key) + i * hash2(key)) % table_size, where i is the number of collision resolution attempts.
    • Effective in minimizing clustering and providing good distribution.

  5. Cuckoo Hashing:

    • Uses multiple hash functions and two or more hash tables.
    • Each key is assigned to one of the hash tables based on multiple hash functions.
    • If a collision occurs, the existing key is moved to the other hash table.
    • Repeats the process until there are no collisions.
    • Effective for resolving collisions with a constant worst-case lookup time.

  6. Perfect Hashing:

    • Aims to eliminate collisions entirely by designing a hash function that guarantees no collisions for a specific set of keys.
    • Involves two levels of hashing: the first level hashes keys into buckets, and within each bucket, a second-level hash function is used.
    • Ideal for situations where the set of keys is fixed.

  7. Quadratic Probing:

    • A form of open addressing that resolves collisions by incrementing the probe sequence quadratically.
    • The formula is hash_code = (hash1(key) + c1 * i + c2 * i^2) % table_size, where c1 and c2 are constants.
    • Helps avoid clustering and provides good distribution.

  8. Chaining (Separate Chaining):

    • Each bucket in the hash table contains a linked list of key-value pairs.
    • Collisions are resolved by appending key-value pairs to the linked list at the corresponding bucket.
    • Provides a simple and effective way to handle collisions.

These hashing techniques vary in their approach to handling collisions and distributing keys. The choice of a hashing technique depends on factors such as the nature of the data, expected workload, and performance requirements for specific applications.

Comments

Post a Comment

Popular posts from this blog

Data Structures CST 201 KTU Third Semester Syllabus Notes and Solved Questions- Dr Binu V P 984739060

Dr BinuV P -About Me About The Course Syllabus Data Structures Lab CSL 201 ( Do the Programs to Understand the Concept Well) Model Question Paper CST 201 Data Structures University Question Papers CST 201 Data Structures Module-1 Basic Concepts of Data Structures 1.1 System Life Cycle 1.2 Algorithms , Performance Analysis  1.3 Space Complexity, Time Complexity  1.4 Asymptotic Analysis and Notations  1.5 Complexity Calculation of Simple Algorithms Module-2 Arrays and Searching  2.1 Polynomial representation using Arrays  2.2 Sparse matrix  2.3 Stacks  2.4 Queues 2.5 Circular Queues  2.6 Priority Queues 2.7 Double Ended Queues 2.8 Infix to  Postfix Conversion  2.9  Evaluation of Postfix Expression 2.10 Linear Search  2.11 Binary Search Module-3 Linked List and Memory Management 3.1 Linked List -Self Referential Structures  3.2 Dynamic Memory Allocation  3.3 Singly Linked List-Operations on Linked List 3.4 Doubly Linked List 3.5 Circular Linked List  3.6 Stack using Linked List  3.7 Queue
Read more

Stack

Image
A stack is a fundamental data structure in computer science and programming that follows the Last-In, First-Out (LIFO) principle . It is named "stack" because it resembles a stack of items, like a stack of plates or books, where you can only add or remove items from the top. Stacks are used for various purposes in programming and are essential in many algorithms and applications. Let's delve into the details of stacks: Key Operations:  A stack typically supports two primary operations: Push: This operation adds an element to the top of the stack. It is analogous to placing an item on top of the stack. Pop: This operation removes and returns the top element of the stack. It is like taking the top item off the stack. Additionally, stacks often provide the following operations: Peek (or Top): This operation retrieves the top element without removing it. It allows you to examine the top item without modifying the stack. IsEmpty: This operation checks if the stack is empty.
Read more

Quick Sort

Quick sort is a popular sorting algorithm that uses a divide-and-conquer strategy to efficiently sort an array or list. It works by selecting a "pivot" element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then recursively sorted. Here's a detailed algorithm for the Quick Sort algorithm: Algorithm: Quick Sort 1.Choose a pivot element from the array. This can be done in various ways, such as selecting the first element, the last element, or a random element. The choice of the pivot can affect the algorithm's performance. 2,Partition the array into two sub-arrays:     Elements less than the pivot (left sub-array).     Elements greater than the pivot (right sub-array). 3.Recursively apply the Quick Sort algorithm to the left and right sub-arrays. 4.Combine the sorted left sub-array, pivot, and sorted right sub-array to obtain the final sorted ar
Read more