Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지

Perfect Hashing Algorithm Using TPSACA

TPSACA를 이용한 완전 해싱 알고리즘

  • 김석태 (부경대학교 전자컴퓨터정보통신공학부) ;
  • 이석기 (부경대학교 정보통신공학과) ;
  • 최언숙 (영산대학교) ;
  • 조성진 (부경대학교 자연과학대학 수리과학부)
  • Published : 2004.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

One of the fundamental problems in computer science is how to store information so that it can be searched and retrieved efficiently. Hashing is a technique which solves this problem. In this paper, we propose a tree construction algorithm using linear two-predecessor single attractor cellular automata C and its complemented cellular automata. Also by using the concept of MRT we give a perfect hasing algorithm based on C.

컴퓨터 과학에서의 중요한 문제중의 하나가 '정보를 어떻게 잘 저장하고 효과적으로 검색할 수 있는가' 이다. 이러한 문제를 해결하는 기술이 해싱이다. 본 논문에서는 두 개의 직전자와 하나의 끌개를 갖는 선형 셀룰라 오토마타와 그것의 여원 셀룰라 오토마타의 특성을 이용하여 만들어진 트리구성 알고리즘을 제안한다. 또한, MRT 개념을 이용한 두 개의 직전자와 하나의 끌개를 갖는 선형 셀룰라 오토마타를 기반으로 하는 완전 해싱 알고리즘을 제안한다.

Keywords

References

  1. P.H. Bardell, Analysis of cellular auto- mata used as pseudorandom pattern generators, Proc. IEEE int. Test. Conf., pp. 762-767, 1990
  2. A.K. Das and P.P. Chaudhuri, Efficient characterization of cellular automata, Proc. IEE(Part E), Vol. 137, No.1, pp. 81-87, 1990
  3. S. Nandi and P.P. Chaudhuri, Analysis of Periodic and Intermediate Boundary 90/150 Cellular automata, IEEE Trans. Computers, Vol. 45, No 1, pp. 1-12, 1996 https://doi.org/10.1109/12.481481
  4. M. Serra, T. Slater, J.C. Muzio and D.M. Miller, The analysis of one dimensional linear cellular automata and their aliasing properties, IEEE Trans Computer-Aided Design, Vol. 9, pp. 767-778, 1990 https://doi.org/10.1109/43.55213
  5. S.J. Cho, U.S. Choi and H.D. Kim, Linear nongroup one-dimensional cellular automata characterization on GF(2), J. Korea Multimedia Soc., Vol. 4, No.1, pp. 91-95, 2001
  6. P.P. Chaudhuri, D.R. Chowdhury, S. Nandy and Chattopadhyay, Additive Cellular Automata Theory and Application, 1, IEEE Computer Society Press, California, 1997
  7. A.K. Das and P.P. Chaudhuri, Vector space theoretic analysis of additive cellular automata and its application for pseudo-exhaustive test pattern generation, IEEE Trans. Comput., Vol. 42, pp. 340-352, 1993 https://doi.org/10.1109/12.210176
  8. S. Nandi, B.K. Kar and P.P. Chaudhuri, Theory and Application of Cellular Automata in Cryptography, IEEE Trans. Computers, Vol. 43, pp. 1346-1357, 1994 https://doi.org/10.1109/12.338094
  9. R. Cichelli, Minimal Perfect Hash Functions made simple, Comm. ACM, Vol. 23, pp. 17-19, Jan. 1980 https://doi.org/10.1145/358808.358813
  10. C. Cook and R. Oldehoeft, More on Minimal Perfect Hash Table, Tech. Report TR-82, 1982
  11. S.J. Cho, H.D. Kim and u.s. Choi, Analysis of complemented CA derived from a linear TPMACA, Computers & Mathematics with Applications, Vol. 45. pp. 689-698, 2003 https://doi.org/10.1016/S0898-1221(03)00028-2
  12. S.J. Cho, H.D. Kim and u.s. Choi, Behavior of Complemented cellular automata derived from a linear cellular automata, Mathematical and Computer Modelling Vol. 36, pp. 979-986, 2002 https://doi.org/10.1016/S0895-7177(02)00251-0