Статья 'Эффективная структура данных' - журнал 'Кибернетика и программирование' - 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

Публикация за 72 часа - теперь это реальность!
При необходимости издательство предоставляет авторам услугу сверхсрочной полноценной публикации. Уже через 72 часа статья появляется в числе опубликованных на сайте издательства с DOI и номерами страниц.
По первому требованию предоставляем все подтверждающие публикацию документы!
MAIN PAGE > Back to contents
Cybernetics and programming
Reference:

Efficient data structure

Malashkevich Vasilii Borisovich

PhD in Technical Science



424000, Russia, Marii El oblast', g. Ioshkar-Ola, ul. Pl. Lenina, 3

MalashkevichVB@volgatech.net
Malashkevich Irina Ardalionovna



424000, Russia, Marii El oblast', g. Ioshkar-Ola, pl. Lenina, 3

MalashkevichIA@volgatech.net

Review date:

20-11-2014


Publish date:

04-12-2014


Abstract: The efficiency of information retrieval systems depends significantly on the structure of the data. The selected data structure determines the speed of data operations (search, insert, delete), and the necessary cost of memory. Due to the importance of the problem of optimizing the structure of data in modern scientific and technical literature are well represented implement a variety of data structures and analysis of their effectiveness. A wide range of known effective data structures uses the properties of linear arrays of data, and binary trees. The article deals with one of the special data structure known as a digital trie (Trie unlike Tree). Search speed in the proposed structure is the statistical value and the worst value is characterized by O (log (N / 2)) and the average value of O (log (N / 2) / 2) operations. It also has the best memory cost in comparison with the traditional characteristics of a digital tree. Thus the aturhos propose and implemented an efficient data structure - "vertical" digital tree, which is characterized by high-speed data retrieval and low memory consumption.


Keywords: key, feathered trees, red-black trees, array of pointers, digital tree, tree structure, data structure, node, memory costs, search
This article written in Russian. You can find full text of article in Russian here .

References
1.
ru.wikipedia.org/wiki/Spisok struktur dannykh
2.
en.wikipedia.org/wiki/Trie
3.
Knut D. E. Iskusstvo programmirovaniya. Tom 3. Sortirovka i poisk.: M., Dialektika/Vil'yams, 2009
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