Advertisement

Algorithm for Solving the Collisions in Uniform Simple Hashing with Combined Linked Ordered Lists

  • Tudor Nicoleta Liviana
Conference paper

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    G. H. Gonnet, ,,Handbook of Algorithms and Data Structures”, Addison-Wesley: pp. 200-286, 1984Google Scholar
  2. [2]
    A. Apostolico, F. P. Preparata, ,,Data Structures and Algorithms for the String Statistics Problem”, Algorithmica: pp. 481-494, 1996Google Scholar
  3. [3]
    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, 1994Google Scholar
  4. [4]
    D. Knuth, ,,The Art of Computer Programming”, vol. 3, Addison-Wesley, 1973Google Scholar
  5. [5]
    D. E. Knuth, ,,The art of computer programming”, Vol. 2, Seminumerical algorithms. Third ed. Reading, Mass.: Addison-Wesley, 1998Google Scholar
  6. [6]
    M. J. Franklin, M. J. Carey, M. Livny, ,,Transactional client-server cache consistency: Alternatives and performance”, ACM Transactions on Database Systems 22, 1997Google Scholar
  7. [7]
    T. Cormen, C. Leiserson, R. Rivest, ,,Introducere in algoritmi”, Agora, pp. 192, 1990Google Scholar
  8. [8]
    M. Mor, S. Fraenkel, ,,A Hash Code Method for Detecting and Correcting Spelling Errors”, Comm. of the ACM, pp. 935 938, 1982Google Scholar
  9. [9]
    http://www.squid-cache.orgGoogle Scholar
  10. [10]
    M. D. Hill, Aspects of Cache Memory and Instruction Buffer Performance, PhD thesis, Unversity of Berkeley, 1987Google Scholar
  11. [11]
    Z. Chen, Y. Zhou, K. Li, ,,Eviction-based cache placement for storage caches”, In Proceedings of USENIX Technical Conference, San Antonio, 2003Google Scholar
  12. [12]
    A. Shatdal, C. Kant, J. F. Naughton, ,,Cache Conscious Algorithms for Relational Query Processing”, In Proceedings of the 20th VLDB, pp 510-521, 1994Google Scholar
  13. [13]
    M. Grant, ,,Pattern Summaries: Cache Management”, Jupitermedia Corporation, 2006Google Scholar
  14. [14]
    G. N. Frederickson, ,,Searching Intervals and Compact Routing Tables”, Algorithmica, pp. 448-466, 1996Google Scholar
  15. [15]
    T. Wong, J. Wilkes, ,,My cache or yours? making storage more exclusive”, In Proceedings of the Usenix Technical Conference, 2002Google Scholar

Copyright information

© Springer 2007

Authors and Affiliations

  • Tudor Nicoleta Liviana
    • 1
  1. 1.Department of Computer Science Petroleum-Gas University of Ploiesti 39 Bucuresti Avenue100680 PloiestiRomania

Personalised recommendations