Utilizing Temporal Locality for Hash Tables with Circular Chaining
- Authors
- Pyo, C.; Kim, T.
- Issue Date
- 1-Jan-2022
- Publisher
- Korean Institute of Information Scientists and Engineers
- Keywords
- Bucket structure; Circular chaining; Hash table; Linear chaining; Locality; Temporal locality interval
- Citation
- Journal of Computing Science and Engineering, v.16, no.4, pp.194 - 198
- Journal Title
- Journal of Computing Science and Engineering
- Volume
- 16
- Number
- 4
- Start Page
- 194
- End Page
- 198
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/31105
- DOI
- 10.5626/JCSE.2022.16.4.194
- ISSN
- 1976-4677
- 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
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/31105)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.