Статья 'Использование бинарного поиска для оптимизации запроса на выборку данных' - журнал 'Кибернетика и программирование' - NotaBene.ru
по
Journal Menu
> Issues > Rubrics > About journal > Authors > About the Journal > Requirements for publication > Council of Editors > Peer-review process > Policy of publication. Aims & Scope. > Article retraction > Ethics > Online First Pre-Publication > Copyright & Licensing Policy > Digital archiving policy > Open Access Policy > Open access publishing costs > Article Identification Policy > Plagiarism check policy
Journals in science databases
About the Journal

MAIN PAGE > Back to contents
Cybernetics and programming
Reference:

Using a binary search to optimize the query to retrieve data

Milushkov Vitalii Igorevich



197101, Russia, g. Saint Petersburg, Kronverkskii prosp., 49

milushkoff@yandex.ru
Gatchin Yurii Armenakovich

Doctor of Technical Science

associate professor of the Department of Computing Systems Design and Safety at Saint Petersburg National Research University of Information Technologies, Mechanics and Optics

197101, Russia, Saint Petersburg, Kronverkskii prosp., 49

gatchin@mail.ifmo.ru
Другие публикации этого автора
 

 

Review date:

20-11-2014


Publish date:

04-12-2014


Abstract: With the increasing popularity of DBMS its use inevitably begins to demand more and more resources. The first time is possible (and, of course, necessary) to lower the load through optimization of algorithms and / or architecture of the application. However, what if anything that can be optimized is already optimized, and the application still cannot cope with the load? In this article the methods and ways to use binary search to optimize the query to retrieve data are reviewed. Authors giv an overview of php + MySQL and solved the problem of the transfering the queue from fields without indexes to tables with primary keys, which significantly speeds up the query and the database itself. Proposed solution greatly accelerates the search for the desired item by reducing the search range but at the same time sacrificing some accuracy computations. For statistical reasons it is not critical if a few elements of millions will not be taken into account. Otherwise, it is necessary to make and complete epsilon zero search only after reaching the last level of the tree.


Keywords: bisection method, scaling, search range, query optimization, binary search, data structure, index, primary key, database, DBMS
This article written in Russian. You can find full text of article in Russian here .

References
1.
«Intrusion Detection with Artificial Neural Networks (Anomaly based Intrusion Detection using Backpropagation Neural Networks)», Moazzam Hossain, ISBN 978-3-6392-1038-5, 2010 g.
2.
«Snort Cookbook», Angela Orebaugh, ISBN 0596007914, 2005 g.
3.
«A New Host-Based Hybrid IDS Architecture-A Mind Of Its Own (The Know-how Of Host-Based Hybrid Intrusion Detection System Architecture Using Machine Learning Algorithms With Feature Selection)», Murat Topallar, ISBN 978-3-6391-7288-1, 2010 g.
4.
«Intrusion Detection System», Frederic P. Miller, ISBN 978-6-1328-6369-0, 2010 g.
Link to this article

You can simply select and copy link from below text field.


Other our sites:
Official Website of NOTA BENE / Aurora Group s.r.o.
"History Illustrated" Website