Real-time database structure optimization

The problem of real-time database structure optimization is considered. The objective is to minimize the information redundancy with respect to real-time usage. There is a set of active processes, each process uses several data fields from a given database. The fields should be divided into a set of files such that each process need not use more than one file for normal operation. Different measures are proposed for intra-file, inter-file and inter-process redundancies. We focus on the problem of inter- and intra-file redundancy minimization which can be reduced to a Boolean programming problem. We propose two algorithms for the database structure optimization problem. The first algorithm is based on the Boolean programming reduction and the second one is heuristics with a polynomial computational complexity. An illustrative example is provided. The algorithms are included into a CAD for real-time systems which can be used for flight experiments, ecological monitoring and other fields.