Smart Chaining: Templing and Temple Search

Smart Chaining: Templing and Temple Search

Hash tables continue to be at the forefront of applications that require fast data lookup, but their usefulness in practice depends on effective collision resolution. Classical approaches like chaining (linked lists) and open addressing (linear/quadratic/random probing) have inherent challenges, lik...

Full description

Saved in:
Bibliographic Details
Main Authors: Rajeev Ranjan Kumar Tripathi, Rahul Mishra, Shailesh Kumar Agrahari, Pradeep Kumar Singh, Sarvpal Singh
Format: Article
Language:English
Published: IEEE 2025-01-01
Series:IEEE Access
Subjects:
B-tree
chaining
combinatorial hashing
even-odd hash function
linear probing
quadratic probing
Online Access:https://ieeexplore.ieee.org/document/11027127/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://ieeexplore.ieee.org/document/11027127/

Similar Items