Matrix Hashing with Random Probing in 1D Array
Enregistré dans:
| Publié dans: | ADCAIJ : Advances in Distributed Computing and Artificial Intelligence Journal vol. 14 (2025), p. e31698-e31723 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | , |
| Publié: |
Ediciones Universidad de Salamanca
|
| Sujets: | |
| Accès en ligne: | Citation/Abstract Full Text - PDF |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3282913881 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2255-2863 | ||
| 024 | 7 | |a 10.14201/adcaij.31698 |2 doi | |
| 035 | |a 3282913881 | ||
| 045 | 2 | |b d20250101 |b d20251231 | |
| 100 | 1 | |a Rajeev Ranjan Kumar Tripathi | |
| 245 | 1 | |a Matrix Hashing with Random Probing in 1D Array | |
| 260 | |b Ediciones Universidad de Salamanca |c 2025 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a The current computing era enables the generation of vast amounts of data, which must be processed to extract valuable insights. This processing often requires multiple query operations, where hashing plays a crucial role in accelerating query response times. Among hashing techniques, Cuckoo Hashing has demonstrated greater efficiency than conventional methods, offering simplicity and ease of integration into various real-world applications. However, Cuckoo Hashing also has limitations, including data collisions, data loss due to collisions, and the potential for endless loops that lead to high insertion latency and frequent rehashing. To address these challenges, this work introduces a modified Matrix hashing technique. The core concept of the proposed scheme is to utilize both a 2D array and an additional 1D array with random probing to create a more robust technique that competes effectively with Cuckoo Hashing. This study also introduces degree of dexterity as a new performance metric, in addition to the traditional load factor. Furthermore, the Even-Odd hash function is proposed to ensure a more balanced load distribution. Through rigorous experimental analysis in a single-threaded environment, this modified Matrix hashing with random probing in the 1D array is shown to effectively resolve key issues associated with Cuckoo Hashing, such as excessive data migration, inefficient memory usage, and high insertion latency. | |
| 653 | |a Collisions | ||
| 653 | |a Arrays | ||
| 653 | |a Data loss | ||
| 653 | |a Load distribution (forces) | ||
| 653 | |a Insertion | ||
| 700 | 1 | |a Singh, Pradeep Kumar | |
| 700 | 1 | |a Sarv Pal Singh | |
| 773 | 0 | |t ADCAIJ : Advances in Distributed Computing and Artificial Intelligence Journal |g vol. 14 (2025), p. e31698-e31723 | |
| 786 | 0 | |d ProQuest |t Advanced Technologies & Aerospace Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3282913881/abstract/embedded/H09TXR3UUZB2ISDL?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3282913881/fulltextPDF/embedded/H09TXR3UUZB2ISDL?source=fedsrch |