![](\"http:\/\/journals.khnu.km.ua\/vestnik\/wp-content\/uploads\/2021\/01\/pdf.png\")
<\/a> \u0421\u0442\u043e\u0440\u0456\u043d\u043a\u0438: 204-207. \u041d\u043e\u043c\u0435\u0440: \u21163, 2019 (273)<\/strong>\n\u0410\u0432\u0442\u043e\u0440\u0438:<\/strong>
\n\u041b.\u0406. \u0424\u0423\u041d\u0414\u0410\u041a, \u0413.\u0413. \u0426\u0415\u0413\u0415\u041b\u0418\u041a
\n\u041b\u044c\u0432\u0456\u0432\u0441\u044c\u043a\u0438\u0439 \u043d\u0430\u0446\u0456\u043e\u043d\u0430\u043b\u044c\u043d\u0438\u0439 \u0443\u043d\u0456\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442 \u0456\u043c\u0435\u043d\u0456 \u0406\u0432\u0430\u043d\u0430 \u0424\u0440\u0430\u043d\u043a\u0430
\nL.I. FUNDAK, H.H. TSEHELYK
\nIvan Franko Lviv National University
\nDOI:<\/strong> https:\/\/www.doi.org\/10.31891\/2307-5732-2019-273-3-204-207<\/a>
\n\u0420\u0435\u0446\u0435\u043d\u0437\u0456\u044f\/Peer review :<\/strong> 15.05.2019 \u0440.
\n\u041d\u0430\u0434\u0440\u0443\u043a\u043e\u0432\u0430\u043d\u0430\/Printed :<\/strong> 02.06.2019 \u0440.<\/p>\n
\u0410\u043d\u043e\u0442\u0430\u0446\u0456\u044f \u043c\u043e\u0432\u043e\u044e \u043e\u0440\u0438\u0433\u0456\u043d\u0430\u043b\u0443<\/strong><\/p>\n \u0423 \u0440\u043e\u0431\u043e\u0442\u0456 \u0440\u043e\u0437\u0433\u043b\u044f\u043d\u0443\u0442\u0438\u0439 \u043e\u043f\u0442\u0438\u043c\u0430\u043b\u044c\u043d\u0438\u0439 \u0431\u043b\u043e\u043a\u043e\u0432\u0438\u0439 \u043f\u043e\u0448\u0443\u043a \u0443 \u0432\u0438\u043f\u0430\u0434\u043a\u0443 \u0440\u0456\u0432\u043d\u043e\u043c\u0456\u0440\u043d\u043e\u0433\u043e \u0440\u043e\u0437\u043f\u043e\u0434\u0456\u043b\u0443 \u0439\u043c\u043e\u0432\u0456\u0440\u043d\u043e\u0441\u0442\u0435\u0439 \u0437\u0432\u0435\u0440\u0442\u0430\u043d\u043d\u044f \u0434\u043e \u0437\u0430\u043f\u0438\u0441\u0456\u0432, \u044f\u043a\u0449\u043e \u0432 \u043b\u043e\u043a\u0430\u043b\u0456\u0437\u043e\u0432\u0430\u043d\u043e\u043c\u0443 \u0431\u043b\u043e\u0446\u0456 \u0432\u0438\u043a\u043e\u0440\u0438\u0441\u0442\u043e\u0432\u0443\u0454\u0442\u044c\u0441\u044f \u043c\u0435\u0442\u043e\u0434 \u0434\u0432\u0456\u0439\u043a\u043e\u0432\u043e\u0433\u043e \u043f\u043e\u0448\u0443\u043a\u0443. \u041f\u0440\u043e\u0432\u0435\u0434\u0435\u043d\u043e \u0434\u043e\u0441\u043b\u0456\u0434\u0436\u0435\u043d\u043d\u044f \u043e\u043f\u0442\u0438\u043c\u0430\u043b\u044c\u043d\u043e\u0457 \u043a\u0456\u043b\u044c\u043a\u043e\u0441\u0442\u0456 \u043f\u043e\u0440\u0456\u0432\u043d\u044f\u043d\u044c, \u043d\u0435\u043e\u0431\u0445\u0456\u0434\u043d\u0438\u0445 \u0434\u043b\u044f \u043f\u043e\u0448\u0443\u043a\u0443 \u0437\u0430\u043f\u0438\u0441\u0443 \u0443 \u0444\u0430\u0439\u043b\u0456. \u041f\u043e\u043a\u0430\u0437\u0430\u043d\u043e \u0435\u0444\u0435\u043a\u0442\u0438\u0432\u043d\u0456\u0441\u0442\u044c \u043c\u0435\u0442\u043e\u0434\u0443 \u0434\u0432\u0456\u0439\u043a\u043e\u0432\u043e\u0433\u043e \u043f\u043e\u0448\u0443\u043a\u0443 \u0443 \u043f\u043e\u0440\u0456\u0432\u043d\u044f\u043d\u043d\u0456 \u0437 \u0432\u0438\u043a\u043e\u0440\u0438\u0441\u0442\u0430\u043d\u043d\u044f\u043c \u043c\u0435\u0442\u043e\u0434\u0443 \u043f\u043e\u0441\u043b\u0456\u0434\u043e\u0432\u043d\u043e\u0433\u043e \u043f\u0435\u0440\u0435\u0433\u043b\u044f\u0434\u0443 \u0434\u043b\u044f \u043f\u043e\u0448\u0443\u043a\u0443 \u0437\u0430\u043f\u0438\u0441\u0443 \u0443 \u043b\u043e\u043a\u0430\u043b\u0456\u0437\u043e\u0432\u0430\u043d\u043e\u043c\u0443 \u0431\u043b\u043e\u0446\u0456. \u0420\u043e\u0437\u0448\u0438\u0440\u0435\u043d\u0430 \u0430\u043d\u043e\u0442\u0430\u0446\u0456\u044f \u0430\u043d\u0433\u043b\u0456\u0439\u0441\u044c\u043a\u043e\u044e \u043c\u043e\u0432\u043e\u044e<\/strong><\/p>\n The purpose of the article is to investigate the effectiveness of the optimal block search in the case of a uniform distribution of the probabilities of access to records if the localized block uses the binary search method. Among the methods for finding information in large databases, the block search method is most effective. The essence of this method is as follows. If file entries ordered in ascending or decreasing values of a key, then it is not necessary to view all records preceding the searched for the record. Entries can be split into blocks and first locate the block containing the desired entry by viewing the latest block records. After the record block is localized, the search for the desired record in the block is continued using one of the methods below. Block search method investigated for different laws of distribution of the probabilities of access to records when used in a localized block to search for the method of sequential viewing. However, in the case of a uniform distribution of probabilities, the block search method can be made much more efficient by using the binary search method in the localized block. This case investigated in the work. The graphs show the dependence of the average number of comparisons between the number of records in the file and the number of blocks on which the file is split. A comparison of the effectiveness of two block search options (with using in block sequential viewing and binary search) is conducted. The average number of comparisons for the different number of records in the file for both methods was calculated and compared. It is shown, that using a binary search method to search for a record in a localized block, you can significantly reduce the average number of comparisons required to search for a record in a file. References<\/strong><\/p>\n \u041e\u041f\u0422\u0418\u041c\u0410\u041b\u042c\u041d\u0418\u0419 \u0411\u041b\u041e\u041a\u041e\u0412\u0418\u0419 \u041f\u041e\u0428\u0423\u041a \u0423 \u0412\u0418\u041f\u0410\u0414\u041a\u0423 \u0420\u0406\u0412\u041d\u041e\u041c\u0406\u0420\u041d\u041e\u0413\u041e \u0420\u041e\u0417\u041f\u041e\u0414\u0406\u041b\u0423 \u0419\u041c\u041e\u0412\u0406\u0420\u041d\u041e\u0421\u0422\u0415\u0419 \u0417\u0412\u0415\u0420\u0422\u0410\u041d\u041d\u042f \u0414\u041e \u0417\u0410\u041f\u0418\u0421\u0406\u0412 OPTIMAL BLOCK SEARCH IN THE CASE OF A UNIFORM DISTRIBUTION OF PROBABILITIES OF ACCESS TO RECORDS \u0421\u0442\u043e\u0440\u0456\u043d\u043a\u0438: 204-207. \u041d\u043e\u043c\u0435\u0440: \u21163, 2019 (273) \u0410\u0432\u0442\u043e\u0440\u0438: \u041b.\u0406. \u0424\u0423\u041d\u0414\u0410\u041a, \u0413.\u0413. \u0426\u0415\u0413\u0415\u041b\u0418\u041a \u041b\u044c\u0432\u0456\u0432\u0441\u044c\u043a\u0438\u0439 \u043d\u0430\u0446\u0456\u043e\u043d\u0430\u043b\u044c\u043d\u0438\u0439 \u0443\u043d\u0456\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442 \u0456\u043c\u0435\u043d\u0456 \u0406\u0432\u0430\u043d\u0430 \u0424\u0440\u0430\u043d\u043a\u0430 L.I. FUNDAK, H.H. TSEHELYK Ivan Franko Lviv National University DOI: https:\/\/www.doi.org\/10.31891\/2307-5732-2019-273-3-204-207 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[20],"tags":[],"_links":{"self":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts\/1464"}],"collection":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1464"}],"version-history":[{"count":4,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts\/1464\/revisions"}],"predecessor-version":[{"id":5790,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts\/1464\/revisions\/5790"}],"wp:attachment":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1464"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1464"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1464"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\n\u041a\u043b\u044e\u0447\u043e\u0432\u0456 \u0441\u043b\u043e\u0432\u0430:<\/strong> \u0440\u0456\u0432\u043d\u043e\u043c\u0456\u0440\u043d\u0438\u0439 \u0440\u043e\u0437\u043f\u043e\u0434\u0456\u043b \u0439\u043c\u043e\u0432\u0456\u0440\u043d\u043e\u0441\u0442\u0435\u0439 \u0437\u0432\u0435\u0440\u0442\u0430\u043d\u043d\u044f \u0434\u043e \u0437\u0430\u043f\u0438\u0441\u0456\u0432, \u0431\u043b\u043e\u043a\u043e\u0432\u0438\u0439 \u043f\u043e\u0448\u0443\u043a, \u043c\u0435\u0442\u043e\u0434 \u0434\u0432\u0456\u0439\u043a\u043e\u0432\u043e\u0433\u043e \u043f\u043e\u0448\u0443\u043a\u0443, \u043c\u0435\u0442\u043e\u0434 \u043f\u043e\u0441\u043b\u0456\u0434\u043e\u0432\u043d\u043e\u0433\u043e \u043f\u0435\u0440\u0435\u0433\u043b\u044f\u0434\u0443.<\/p>\n
\nKeywords:\u00a0<\/strong>uniform distribution of probabilities of access to records, block search, binary search method, sequential search.<\/p>\n\n