Izvorni znanstveni članak

AN EFFICIENT ALGORITHM FOR INFORMATION SYSTEM DECOMPOSITION

Alen Lovrenčić ; Faculty of Organization and Informatics, University of Zagreb, Varaždin, Croatia

Sažetak

A general context for the problem of decomposition within an information system is described in [3]. The problem has been classified as a NP-complete problem, which excludes the possibility of an optimal solution of the problem in polynomial time. This paper has two goals: first, to solve the problem with in some additional limitations that are usual in the praxis of decomposition and, second, to provide for an on average faster algorithm to calculate the optimal decomposition of an information system into subsystems.

Ključne riječi

information systems; algorithm; optimization; complexity

Hrčak ID:

78884

URI

https://hrcak.srce.hr/78884

Datum izdavanja:

14.12.1998.

Posjeta: 1.290 *