Utilizing Temporal Locality for Hash Tables with Circular Chaining
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Pyo, C. | - |
dc.contributor.author | Kim, T. | - |
dc.date.accessioned | 2023-04-24T03:40:35Z | - |
dc.date.available | 2023-04-24T03:40:35Z | - |
dc.date.created | 2023-04-24 | - |
dc.date.issued | 2022-01-01 | - |
dc.identifier.issn | 1976-4677 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/31105 | - |
dc.description.abstract | A hash table with separate chaining typically adopts linearly linked lists as buckets to resolve collisions. This study demonstrates that converting bucket structures from linear to circular chaining enables buckets to utilize temporal locality and improve search performance. Unlike linear chaining, circular chaining can track the most recently accessed entry and preserve the reachability of all bucket entries without complicated data structures and operations. We defined temporal locality interval (TLI) to represent the period during which subsequent bucket access repeats itself on a single entry. We analyzed the average search cost using the TLI length and load factor. The average search cost converges to the minimum when the TLI length dominates the load factor. In our experiments using the SPEC CPU 2006 benchmark suite, circular chaining manifested 1.14 comparisons, reducing the cost of linear chaining by 45.71% when the load factor was 0.99. The improvement is notable, particularly for tables with a high load factor and uneven distribution of bucket sizes © 2022. The Korean Institute of Information Scientists and Engineers | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Korean Institute of Information Scientists and Engineers | - |
dc.title | Utilizing Temporal Locality for Hash Tables with Circular Chaining | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Pyo, C. | - |
dc.identifier.doi | 10.5626/JCSE.2022.16.4.194 | - |
dc.identifier.scopusid | 2-s2.0-85151921035 | - |
dc.identifier.bibliographicCitation | Journal of Computing Science and Engineering, v.16, no.4, pp.194 - 198 | - |
dc.relation.isPartOf | Journal of Computing Science and Engineering | - |
dc.citation.title | Journal of Computing Science and Engineering | - |
dc.citation.volume | 16 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 194 | - |
dc.citation.endPage | 198 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Bucket structure | - |
dc.subject.keywordAuthor | Circular chaining | - |
dc.subject.keywordAuthor | Hash table | - |
dc.subject.keywordAuthor | Linear chaining | - |
dc.subject.keywordAuthor | Locality | - |
dc.subject.keywordAuthor | Temporal locality interval | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.