Studies on Hashing PART-2: Algorithms and Programming with CAMs

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 一般社団法人情報処理学会の論文
• 1980-03-30

著者

• Goto Eiichi

  Dept. Of Information Science University Of Tokyo

• Sassa Masataka

  Dept. of Information Science, Tokyo Institute of Technology

• Sassa Masataka

  Dept. Of Information Science Tokyo Institute Of Technology

• KANADA YASUMASA

  Institute of Plasma Physics, Nagoya University

• Kanada Yasumasa

  Institute Of Plasma Physics Nagoya University

• Goto Eiichi

  Dept. Of Information Science Faculty Of Science Univ. Of Tokyo

関連論文

• Rie, a compiler generator based on a one-pass attribute grammar
• A Contribution to LR-attributed Grammars
• Associative Data Structures and Their Applications (Mathematical Methods in Software Science and Engineering)
• Parallelism in Algebraic Computation and Parallel Algorithms for Symbolic Linear Systems (Mathematical Methods in Software Science and Engineering : Third Conference)
• Studies on Hashing PART-3: MTAC-Mathematical Tabulative Automatic Computing
• Studies on Hashing PART-2: Algorithms and Programming with CAMs

スポンサーリンク