Agric. Econ. - Czech, 2005, 51(2):84-92 | DOI: 10.17221/5081-AGRICECON

Approach to comparing complex software implementation methods

I. Vrana, J. Vrána
1 Czech University of Agriculture, Prague, Czech Republic
2 Komix a.s. Prague

Some of agriculture-food sector information systems are characterised by a high complexity and a large size. There are often many alternative solutions or technologies (implementation methods) and more then one possible way or approach to an information system design. Individual alternatives could considerably differ by their properties, e.g. costs of design of initial functionality, development and operational costs, run-time costs and technical parameters of the resulting information system (e.g. the access time). Unfortunately, existing metrics for quantification of this task usually do not deliver precise results but a rough estimate depending on many variable conditions. The paper will outline typical implementation methods and show approaches to assessment and comparison of certain types of properties of information systems for a computer support for management of large data systems, which use relational database. Authors presented part of these results also at the Agrarian Perspectives conference 2004 in the Applied Informatics session (Vrana I., Vrána J. 2004).

Keywords: Information system, implementation method, quality assessment

Published: February 28, 2005  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Vrana I, Vrána J. Approach to comparing complex software implementation methods. Agric. Econ. - Czech. 2005;51(2):84-92. doi: 10.17221/5081-AGRICECON.
Share...
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. Aho V. (1974): The design and analysis of computer algorithms. Addison-Wesley.
    2. Aho V. (1983): Data structures and algorithms. Addison-Wesley.
    3. Flaatten P.O. (1991): Foundation of Bussiness Systems. Andersen Consulting, The Dryden Press; ISBN 0-03-076481-5.
    4. Greene D.H. (1981): Mathematics for the analysis of algorithms. Boston, Birkhauser.
    5. Horowitz E. (1978): Fundamentals of computer algorithms. Potomac, Md, Computer Science Press.
    6. Kingston J.H. (1990): Algorithms and data structures: Design, correctness, analysis. Sydney, AddisonWesley.
    7. Vrána J. (2002): Methods of employing metadata for managing large systems. DATESO'02 -Proceedings of Workshop on Databases. Ostrava: 44-56; ISBN 80-248-0080-2.
    8. Vrána J. (2003): Dynamic relational data storing method for management of large data systems. [Doctoral dissertation.] Czech University of Technology, Prague.
    9. Vrana I., Vrána J. (2004): Metody porovnávání vlastností informačních systémů (Methods of comparison of properties of information systems). Agrarian perspectives, CUA Prague.
    10. Wirth N. (1976): Algorithms + data structures = programs. Englewood Cliffs, N.J., Prentice-Hall.

    This is an open access article distributed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International (CC BY NC 4.0), which permits non-comercial use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content