2024-03-29T05:53:01Zhttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_oaipmhoai:ipsj.ixsq.nii.ac.jp:000599982017-03-31T05:36:57Z05471:05535:05539
Studies on Hashing PART-2: Algorithms and Programming with CAMsStudies on Hashing PART-2: Algorithms and Programming with CAMsenghttp://id.nii.ac.jp/1001/00059998/Articlehttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_action_common_download&item_id=59998&item_no=1&attribute_id=1&file_no=1Copyright (c) 1980 by the Information Processing Society of JapanDept. of Information Science University of TokyoDept. of Information Science Tokyo Institute of TechnologyInstitute of Plasma Physics Nagoya UniversityEiichi, GotoMasataka, SassaYasumasa, KanadaThe relation between CAM operations and hashing on RAMs(Random Access Memories) is investigated. Two types of hashing algorithms those that can benefit from CAMs and those that can not for improving the worst-case time complexity are shown together with a criticism on what has been said about the worst-case time of hashing. A GlD(Generalized Identifier) concept which means a unique pointerized representation of a character string a long integer an ordered tuple or an unordered tuple is formulated in terms of CAM and hash operations. The effectiveness of the GID concept is demonstrated in some programming examples. An algorithm design strategy to be used when identity among data structures has to be checked very frequently is formulated.The relation between CAM operations and hashing on RAMs(Random Access Memories) is investigated. Two types of hashing algorithms, those that can benefit from CAMs and those that can not, for improving the worst-case time complexity are shown, together with a criticism on what has been said about the worst-case time of hashing. A GlD(Generalized Identifier) concept, which means a unique pointerized representation of a character string, a long integer, an ordered tuple or an unordered tuple, is formulated in terms of CAM and hash operations. The effectiveness of the GID concept is demonstrated in some programming examples. An algorithm design strategy, to be used when identity among data structures has to be checked very frequently, is formulated.AA00700121Journal of Information Processing 3113221980-03-301882-66522009-06-30