The algorithm for identical object searching with bounded worst-case complexity and linear memory. (English. Russian original) Zbl 1392.68161

Discrete Math. Appl. 26, No. 5, 273-278 (2016); translation from Diskretn. Mat. 28, No. 2, 3-11 (2016).
Summary: We propose and investigate new algorithms permitting to find an identical object in the database using the number of operations not depending on the volume of the database. One algorithm requires memory size that depends linearly on the database volume in the average.


68P10 Searching and sorting
68P15 Database theory
68Q25 Analysis of algorithms and problem complexity


Full Text: DOI


[1] Gasanov E. E., Lugovskaya Yu. P., “A constant, in the worst case, algorithm to search for identical objects”, Discrete Math. Appl., 9:6 (1999), 679-684. · Zbl 0968.68039
[2] Klykova N. V., Fast algorithms for fnding objects in the database, Degree thesis, MGU, 2001 (in Russian), 13 pp.
[3] Gasanov E.E., “The solution to the problem of optimal synthesis of information graphs for background problems of information search”, Doklady Mathematics, 62:2 (2000), 304-305.
[4] Gasanov E. E., Kudryavtsev V. B., The theory of information storage and retrieval, M.: Fizmatlit, 2002 (in Russian). · Zbl 1042.68039
[5] Gasanov E. E., The theory of information retrieval complexity, M.: Izd-vo MGU, 2005 (in Russian).
[6] Knuth. D.E., The Art of Computer Programming. Volume 3. Sorting and searching, Addison-Wesley, 1973, 723 pp.
[7] Borodin A. B., “Computational complexity — Theory and practice” (Current Trends in Theory of Computing), 1973, 35-89.
[8] Bottenbruch H., “Structure and use of ALGOL 60”, J. ACM, 9 (1962), 161-221. · Zbl 0109.35201
[9] Dumey A., “Indexing for rapid random access memory systems”, Computers and Automation, 4:12 (1956), 6-9.
[10] Hagerup T., “Fast deterministic construction of static dictionaries” (SODA’99 Proc. 10th Annu. ACM-SIAM Symp. Discrete algorithms), 1999, 414-418. · Zbl 0934.68041
[11] Hagerup T., Miltersen P. B., Pagh R., “Deterministic dictionaries”, J. Algorithms, 41:1 (2001), 69-85. · Zbl 1002.68503
[12] Hagerup T., “Simpler and faster dictionaries on the AC0 RAM”, ICALP, Lect. Notes Comput. Sci., 1443, Springer-Verlag, 1998, 79-90.
[13] Maurer W. D., Lewis T. G., “Hash table methods”, Computing Surveys, 7 (1975), 5-20. · Zbl 0301.68032
[14] Pletnev A. A., “The dynamic database allowing parallel processing of arbitrary stream queries”, Intellektual’nye sistemy, 19:1 (2014), 117-142 (in Russian).
[15] Pletnev A. A., “Parallel processing by automaton of arbitrary stream queries to the dynamic database with logarithmic complexity”, Intellektual’nye sistemy, 19:1 (2014), 171-212 (in Russian).
[16] Pletnev A. A., “The information-graph model of dynamic database and its application”, Intellektual’nye sistemy, 18:1 (2014),111-140 (in Russian).
[17] Perper E. M., “Lower bounds of temporal and spatial complexity of the substring search problem”, Discrete Math. Appl., 24:6 (2014), 373-382. · Zbl 1344.68314
[18] Gasanov E. E., Efremov D. V., “Background algorithm for solving two-dimensional domination problem”, Intellektual’nye sistemy, 18:3 (2014), 133-158 (in Russian).
[19] Shutkin Yu. S., “Simulation of circuit control systems”, Intellektual’nye sistemy, 18:3 (2014), 253-261 (in Russian).
[20] Perper E. M., “The order of complexity of the subword search problem in the set of words”, Intellektual’nye sistemy, 19:1 (2014), 99-116 (in Russian).
[21] Il’in V.A., SadovnichiyV. A., Sendov Bl. Kh., Mathematical analysis. Continuation of the course / Ed. A.N.Tikhonova, M.: Izd-vo MGU, 1987 (in Russian), 358 pp.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.