Abstract
This article addresses the problem of solving the collisions through chaining in the simple uniform hashing. The personal contribution consists of the improvement of the algorithm of dispersion through linking, by modifying the linking schema of the elements of the hash table. A contribution presents solving the collisions by creating combined linked ordered lists for storing the elements that have the same hash value. The code returned by the second hash function applied to the key of each element, is used for ordering the elements of the combined linked list. The proof of the performance of the proposed algorithm consists in the computing of the time needed for the search with and without success and of the comparative analysis of the time of execution of the algorithms.
Keywords
- algorithm dispersion
- hash table
- collision
- combined linked ordered lists
- simple uniform hashing
- linking
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. H. Gonnet, ,,Handbook of Algorithms and Data Structures”, Addison-Wesley: pp. 200-286, 1984
A. Apostolico, F. P. Preparata, ,,Data Structures and Algorithms for the String Statistics Problem”, Algorithmica: pp. 481-494, 1996
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. M. Heide, H. Rohnert, R. E. Tarjan, ,,Dynamic perfect hashing: Upper and lower bounds”, SIAM Journal on Computing 23, 4, pp. 738–761, 1994
D. Knuth, ,,The Art of Computer Programming”, vol. 3, Addison-Wesley, 1973
D. E. Knuth, ,,The art of computer programming”, Vol. 2, Seminumerical algorithms. Third ed. Reading, Mass.: Addison-Wesley, 1998
M. J. Franklin, M. J. Carey, M. Livny, ,,Transactional client-server cache consistency: Alternatives and performance”, ACM Transactions on Database Systems 22, 1997
T. Cormen, C. Leiserson, R. Rivest, ,,Introducere in algoritmi”, Agora, pp. 192, 1990
M. Mor, S. Fraenkel, ,,A Hash Code Method for Detecting and Correcting Spelling Errors”, Comm. of the ACM, pp. 935 938, 1982
http://www.squid-cache.org
M. D. Hill, Aspects of Cache Memory and Instruction Buffer Performance, PhD thesis, Unversity of Berkeley, 1987
Z. Chen, Y. Zhou, K. Li, ,,Eviction-based cache placement for storage caches”, In Proceedings of USENIX Technical Conference, San Antonio, 2003
A. Shatdal, C. Kant, J. F. Naughton, ,,Cache Conscious Algorithms for Relational Query Processing”, In Proceedings of the 20th VLDB, pp 510-521, 1994
M. Grant, ,,Pattern Summaries: Cache Management”, Jupitermedia Corporation, 2006
G. N. Frederickson, ,,Searching Intervals and Compact Routing Tables”, Algorithmica, pp. 448-466, 1996
T. Wong, J. Wilkes, ,,My cache or yours? making storage more exclusive”, In Proceedings of the Usenix Technical Conference, 2002
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this paper
Cite this paper
Liviana, T.N. (2007). Algorithm for Solving the Collisions in Uniform Simple Hashing with Combined Linked Ordered Lists. In: Sobh, T. (eds) Innovations and Advanced Techniques in Computer and Information Sciences and Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6268-1_65
Download citation
DOI: https://doi.org/10.1007/978-1-4020-6268-1_65
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-6267-4
Online ISBN: 978-1-4020-6268-1
eBook Packages: EngineeringEngineering (R0)