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
Method of identifying models of electronic equipment failure of automation control of dynamic systems
2014 A. A. Klavdiev, O. V. Afanasyeva
The application of the least squares method for approximation of periodic processes at forecasts construction
2014 V. A. Chiruhin
Enhancement of efficiency of underground coal mining development of complexity mining-and-geological parameters
2014 A. A. Sidorenko, S. A. Sidorenko
Conditions for the formation of networks in oil and gas complex for associated petroleum gas integrated use
2014 V. P. Skobelina, I. S. Andrievska