Time characteristics estimate of data structures at the project level

Authors

  • Віктор Іванович Шинкаренко Dnipropetrovsk National University of Railway Transport Lazaryana st., 2, Dnipropetrovsk, Ukraine, 49010, Ukraine https://orcid.org/0000-0001-8738-7225
  • Дмитро Олегович Пєтін Dnipropetrovsk National University of Railway Transport Lazaryana st., 2, Dnipropetrovsk, Ukraine, 49010, Ukraine https://orcid.org/0000-0002-2909-0893
  • Геннадій Володимирович Забула Dnipropetrovsk National University of Railway Transport Lazaryana st., 2, Dnipropetrovsk, Ukraine, 49010, Ukraine https://orcid.org/0000-0002-8607-5729

DOI:

https://doi.org/10.15587/1729-4061.2014.20110

Keywords:

data structure, computational complexity, efficiency, data operations, probability, indicators

Abstract

The approaches to estimating temporal properties of data structures without executing the program have been considered in the paper. Temporal properties of data structures take into account the total time of data access operations during the algorithm execution. The paper considers the following approaches: direct analysis of the algorithm and a probabilistic computation of operations.

The method for determining the computational complexity of algorithms has been adapted in relation to data structures. The computational complexity of data structures is defined as the computational complexity of the combination of data processing algorithms (operations). This method should be used in programs with processing large amounts of data or with a repetitive processing.

The example of the probabilistic method of calculating operations for solving problems of the development of efficient data structures is given. The performance evaluation of data access operations for alternative data structures is given in the paper. The evaluation of the computational complexity of the operations is carried out using combinatorial and probabilistic approaches. The obtained results are used for selecting optimal data structures.

Author Biographies

Віктор Іванович Шинкаренко, Dnipropetrovsk National University of Railway Transport Lazaryana st., 2, Dnipropetrovsk, Ukraine, 49010

Doctor of Technical Sciences, Professor

Department of Computer Information Technologies

Дмитро Олегович Пєтін, Dnipropetrovsk National University of Railway Transport Lazaryana st., 2, Dnipropetrovsk, Ukraine, 49010

Postgraduate

Department of Computer Information Technologies

Геннадій Володимирович Забула, Dnipropetrovsk National University of Railway Transport Lazaryana st., 2, Dnipropetrovsk, Ukraine, 49010

Postgraduate

Department of Computer Information Technologies

References

  1. Вирт, Н. Алгоритмы и структуры данных [Текст] / Н. Вирт – М.: ДМК, 2010. – 274 с.
  2. Шинкаренко, В. И. Экспериментальные исследования алгоритмов в программно-аппаратных средах [Текст] / В. И. Шинкаренко – Д.: Изд-во Днепропетр. нац. ун-та железнодор. трансп. им. акад. В. Лазаряна, 2009. – 279 с.
  3. Макконнелл, Дж. Анализ алгоритмов. Вводный курс [Текст] / Дж. Макконнелл. – М.: Техносфера, 2002. – 304 с.
  4. Кнут, Д. Искусство программирования, том 1. Основные алгоритмы [Текст] / Д. Кнут. – [3-е изд.]. – М.: Издательский дом ”Вильямс”, 2000. – 720 с.
  5. Кнут, Д. Искусство программирования, том 3. Сортировка и поиск [Текст] / Д. Кнут. – [3-е изд.]. – М.: Издательский дом ”Вильямс”, 2000. – 832 с.
  6. Кормен, Т. Алгоритмы: построение и анализ [Текст] / Т. Кормен, Ч. Лейзерсон, Р. Ривест. – М.: МЦНМО, 2001. – 960 с.
  7. Ахо, А. Построение и анализ вычислительных алгоритмов [Текст] / А. Ахо, Дж. Хопкрофт, Дж. Ульман. – М.: Мир, 1979. – 536 с.
  8. Ахо, А. В. Структуры данных и алгоритмы [Текст] / А. В. Ахо, Дж. Хопкрофт, Дж. Д. Ульман. – М.: Изд. дом «Вильямс», 2001. – 384 с.
  9. Грин, Д. Математические методы анализа алгоритмов [Текст] / Д. Грин Д. Кнут. – М.: Мир, 1987. – 120 с.
  10. Гудман, С. Введение в разработку и анализ алгоритмов [Текст] / С. Гудман, С. Хидетниеми. – М.: Мир, 1981. – 366 с.
  11. Гудрич, М. Т. Структуры данных и алгоритмы в Java [Текст] / М. Т. Гудрич, Р. Тамассия. – Мн.: Новое знание, 2003. – 671 с.
  12. Virt, N. (2010). Algoritmy i struktury dannykh. Moskva: DMK, 274.
  13. Shinkarienko, V. I. (2009). Ekspierimientalnyie issliedovaniia algoritmov v programmno-apparatnykh sriedakh. Dniepropietrovsk: Izd-vo Dniepropietr. V. Lazarian National University of railway transport, 279.3. Makkonniell, Dj. (2002). Analiz algoritmov. Vvodnyi kurs. Moskva: Tiekhnosfiera, 304.
  14. Knut, D. (2000). Iskusstvo programmirovaniia. Tom 1. Osnovnyie algoritmy, Moskva: Izdatielskii dom ”Viliams”, 720.
  15. Knut, D. (2000). Iskusstvo programmirovaniia. Cortirovka i poisk. Moskva: Izdatielskii dom “Viliams”, Vol. 3, 832.
  16. Kormien, T. (2001). Algoritmy: postroieniie i analiz. Moskva, 960.
  17. Akho, A. (1979). Postroieniie i analiz vychislitielnykh algoritmov. Moskva: Mir, 536.
  18. Akho, A. (2001). Ctruktury dannykh i algoritmy. Moskva: Izd. dom «Viliams», 384.
  19. Grin, D. (1987). Matiematichieskiie mietody analiza algoritmov. Moskva: Mir, 120.
  20. Gudman, C. (1981). Vviedieniie v razrabotku i analiz algoritmov. Moskva: Mir, 366.
  21. Gudrich, M.T. (2003). Ctruktury dannykh i algoritmy v Java. Minsk: Novoie znaniie, 671.

Downloads

Published

2014-02-05

How to Cite

Шинкаренко, В. І., Пєтін, Д. О., & Забула, Г. В. (2014). Time characteristics estimate of data structures at the project level. Eastern-European Journal of Enterprise Technologies, 1(9(67), 39–45. https://doi.org/10.15587/1729-4061.2014.20110

Issue

Vol. 1 No. 9(67) (2014): Information and controlling system

Section

Information and controlling system

License

Copyright (c) 2014 Віктор Іванович Шинкаренко, Дмитро Олегович Пєтін, Геннадій Володимирович Забула

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.

A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.