The choice of data relations storing in informational systems
About authors
- 1 — Ph.D. associate professor National Mineral Resources University (Mining University)
- 2 — Ph.D. associate professor National Mineral Resources University (Mining University)
- 3 — senior lecturer 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
- Cormen Thomas H., Leiserson Charles E., Rivest Donald L., Stein Clifford: Introduction to Algorithms, Мoscow, 2007.
- Knuth Donald E. The Art of Computer Programming. Sorting and Searching. Мoscow, 2000. Vol.3.
- Connolly T., Begg C., Strachan A. Database systems: a practical approach to design, implementation and management. Мoscow, 2000.
Similar articles
Impact analysis coal mining enterprises of Kuzbass on the environment
2014 L. S. Sinkov, A. N. Martemyanova
Improvement of the mechanism of corporate governance in the large companies at change of structure of joint-stock property
2014 S. V. Korotkii, N. A. Putivlskya
Multicriteria decision making based on marginal criteria concessions and rates of substitution
2014 G. I. Ankudinov, I. G. Ankudinov
Classification of the finite algebra concepts for the description of neural network elements
2014 I. V. Ivanova