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.
Funding:
None
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
Optimization of work of mining complexes on the basis of calculation of material balance of technological process
2014 E. M. Pronin
Impact analysis coal mining enterprises of Kuzbass on the environment
2014 L. S. Sinkov, A. N. Martemyanova
Analytical method for determining the parameters transmarginal deformation ore for bump hazard assessment for ore deposits at great depths when using room-and-pillar system
2014 D. V. Sidorov
The impact of Russia's accession to the World Trade Organization on the exploration industry
2014 A. A. Fedchenko