The choice of data relations storing in informational systems
About authors
- 1 — National Mineral Resources University (Mining University)
- 2 — National Mineral Resources University (Mining University)
- 3 — National Mineral Resources University (Mining University)
Abstract
Storing and processing data of mineral resources usually imply large amounts of data. So increasing data search operation speed is the subject of a notable interest. User of any relational data base, as a rule, imagines it as a set of normalized relations (tables). These tables, at the physical level, can be represented in the different ways. The paper is dedicated to the analysis and comparison of cortege (traditional) and domain (transposed) ways of storing data relations.
References
- Алгоритмы: Построение и анализ: Пер. с англ. / Томас Х.Кормен, Чарльз И.Лейзерсон, Рональд Л.Ривест, Клиффорд Штайн. М., 2007.
- Кнут Д. Искусство программирования для ЭВМ. Сортировка и поиск. М., 2000. Т.3.
- Конноли Т. Базы данных: проектирование, реализация и сопровождение. Теория и практика / Т.Конноли, К.Бегг, A.Страчан. М., 2000.
Similar articles
Model of formation market value vertically integrated oil company
2014 I. V. Burenina, A. K. Barieva, S. V. Ermish
Effectiveness complex approach for development group metal ore fields
2014 V. R. Kabirov, E. I. Reishakhrit