Authors A.V. Dagaev, Y.M.Borodyansky, O.D. Glod
Section .
Month, Year 02, 2009 @en
Index UDC 681.3
Abstract The main conception of hashing is presented in the article; also characteristics behavior of hash-tables in different hash algorithm is researched; class of storing sentences is developed and information system is created on the base it. The system allowed saving large information volume and practically momentary carry out the search of any data independently of it location in the information system. The one may be used in the library, inquiry and searching systems.

Download PDF

Keywords Information system; algorithm; element; class, hash-table; characteristic; store-house.
References 1. Томас Х. Кормен и др. Глава 32. Поиск подстрок // Алгоритмы: построение и анализ = INTRODUCTION TO ALGORITHMS. – 2-е изд. – М.: «Вильямс», 2006. – С. 1296.
2. Karp and Rabin’s original paper: Karp, Richard M.; Rabin, Michael O. (March 1987). «Efficient randomized pattern-matching algorithms». IBM Journal of Research and Development 31 (2), 249—260.
3. HashLib! 1.03 (C) Alex Demchenko, 2002, Moldova, Chishinev —библиотека, алгоритмов хэширования.
4. Шнайдер Б. Прикладная криптография.
5. Щербаков Л.Ю., Домашен А.В. Прикладная криптография.

Comments are closed.