'Publishing House for Science and Technology, Vietnam Academy of Science and Technology'
Doi
Abstract
In this paper we prove some additional properties of keys and superkeys for relation schemes. Basing on these properties, some algorithms finding keys for relation schemes are improved and their complexities are estimated. Finally, some remarks on the translations of relation schemes are given
