The aim of this paper is to investigate the connections between minimal keys and antikeys for special Sperner-systems by hypergraphs. The BoyceCodd normal form and some related problems are also studied in this paper.