2025-02-23T20:24:54-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-21101%22&qt=morelikethis&rows=5
2025-02-23T20:24:54-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-21101%22&qt=morelikethis&rows=5
2025-02-23T20:24:54-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T20:24:54-05:00 DEBUG: Deserialized SOLR response

Використання методу найменших квадратів для побудови наближених методів пошуку інформації у файлах баз даних

A new approximated method of information search in database files is proposed. It is based on the use of the least-squares method. Approximation functions for records search are built. These functions are linear combinations of Chebyshew systems functions on proper intervals. By choosing different s...

Full description

Saved in:
Bibliographic Details
Main Authors: Мельничин, А., Цегелик, Г.
Format: Article
Language:Ukrainian
Published: Центр математичного моделювання Інституту прикладних проблем механіки і математики ім. Я.С. Підстригача НАН України 2007
Series:Фізико-математичне моделювання та інформаційні технології
Online Access:http://dspace.nbuv.gov.ua/handle/123456789/21101
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new approximated method of information search in database files is proposed. It is based on the use of the least-squares method. Approximation functions for records search are built. These functions are linear combinations of Chebyshew systems functions on proper intervals. By choosing different systems of Chebyshew functions, we obtain the different approximations. For such approach the approximated methods counts for distribution value of the key only and does not consider probability distribution of requests to the records. The efficiency of proposed approach is investigated by comparison with the linear search method, block search method with the optimum size of blocks and binary search method. The mathematical expectation of number of comparisons was used as an efficiency criterion.