ALGORITHMS FOR CALCULATING COMPLEX INDICATORS IN DYNAMIC STRUCTURES OF DATA REPRESENTATION


Citar

Texto integral

Resumo

This paper presents algorithms for calculating complex indicators on set factual data, represented in dynamic structures with the application of the graph theory.

Texto integral

The problem of rupture between scientific methods of representing (describing) real world objects and the storage of this information in information systems has existed for a long time and has not yet been solved satisfyingly. The database management system (DBMS) is the best system available today, which allows the storage of information in the form of objects [1; 2] (the object-oriented approach [3]) or globals [1] (hierarchical representation of the information in the form of a tree). However, even such an approach can capture only part of the variety represented in the information of modern scientific methods [4]. Such rupture substantially slows the development of science and engineering in the field of information technology. According to this, the essential restriction for information system design is the standard way of data storage, which is based on static structures (i. e. for the description of a subjected field’s objects in order to store information, a database of the data storage structure is created in advance). This results in the fact that such structures should be created by the designer of information system during a stage of its designing and it (this structure) cannot change during the development of this system and its maintenance. It is not necessary to speak about the expenses at which changes in the system come…
×

Sobre autores

Yu. Yakunin

Siberian Federal University

Russia, Krasnoyarsk

A. Gorodilov

Siberian Federal University

Russia, Krasnoyarsk

Bibliografia

  1. Post-relational SUBD Cache 5. Objectiveorientated development of applications / V. Kirsten, M. Iringer, M. Kjun, B. Rerig. 2 ed. Moscow : LLC «BinomPress», 2005.
  2. Kite T. Oracle for professionals. Saint-Petersburg : DiaSoftUP, 2005.
  3. Faulmer M., Scot К. UML. Basics. Saint-Petersburg : Symbol-Plus, 2002.
  4. Volkov V. N., Denisov A. A. System theory : textbook. Moscow : Higher School, 2006.
  5. Shovkun A. V. Constructing a corporative informative-analytical system in conditions of constantly changing business // Scientific-technical information. Moscow : VINITI, 2004. № 9. P. 1–6. Series 1.
  6. Harari F. Graphs theory. Moscow : Editorial URS, 2003.
  7. Ananiy V., Levitin А. Algorothms: Introduction to the design and analysis of algorithms. Мoscow : Williams, 2006. P. 189–195.

Arquivos suplementares

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Yakunin Y.Y., Gorodilov A.A., 2010

Creative Commons License
Este artigo é disponível sob a Licença Creative Commons Atribuição 4.0 Internacional.

Este site utiliza cookies

Ao continuar usando nosso site, você concorda com o procedimento de cookies que mantêm o site funcionando normalmente.

Informação sobre cookies