Minimal covering problem and redundancy reduction in databases

Autor:	L. M. Novozhilova
Rok vydání:	1993
Předmět:	Statistics and Probability Triple modular redundancy Theoretical computer science Database business.industry Applied Mathematics General Mathematics Standard methods computer.software_genre Matrix (mathematics) Software Redundancy (information theory) Minification business computer Mathematics
Zdroj:	Journal of Soviet Mathematics. 66:2353-2355
ISSN:	1573-8795 0090-4104
DOI:	10.1007/bf01229611
Popis:	One of the main problems in efficient organization of a database system is minimization of the redundancy of information. In this paper, we enumerate the causes of redundancy and reduce the problem of redundancy minimization to the minimum covering problem. This requires inclusion in the database management system of a module for aggregation of data elements into larger constructs — segments, records, files. The module can be software or hardware implemented. Regardless of its implementation, the module has the structure of a 0–1 matrix, which can be transformed by the standard methods of block matrices. A “compression” algorithm is proposed, which reduces the redundancy introduced by the designer or by the users in single and multiuser queries.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::b36da4630ed21f5836582642ab7f14db https://doi.org/10.1007/bf01229611 Zobrazit plný text záznamu Full text from SpringerLink