In the relational database theory the most desirable normal form is the Boyce-Codd normal form (BCNF). This paper investigates some computational problems concerning BCNF relation scheme and BCNF relations. We give an effective algorithm finding a BCNF relation r such that r represents a given BCNF relation scheme s (i.e., K; = Ks, where K; and Ks are sets of all minimal keys of T and s). This paper also gives an effective algorithm which from a given BCNF relation finds a BCNF relation scheme such that K; = K8• Based on these algorithms we prove that the time complexity of the problem that finds a BCNF relation T representing a given BCNF relation scheme s is exponential in the size of s and conversely, the complexity of finding a BCNF relation scheme s from a given BCNF relation T such that T represents s also is exponential in the number of attributes. We give a new characterization of the relations and the relation schemes that• are uniquely determined by their minimal keys. It is known that these relations and the relation schemes are in the BCNF class. From this characterization we give a polynomial time algorithm deciding whether an arbitrary relation is uniquely determined by its set of all minimal keys. In the rest of this paper some new bounds of the size of minimal Armstrong relations for BCNF relation scheme are given. We show that given a Sperner system K and BCNF relation scheme s a set of minimal keys of which is K, tl.l.enumber of antikeys (maximal nonkeys) of K is polynomial in the number of attributes iff so is the size of minimal Armstrong relation of s.
Abstract. The purpose of this paper to examine the first-name and family-names indentification problem in database for persons' management. Some algorithms are proposed, based on errors probability of occurrences of alphabets and frequence of occurrences of alphabets in the first and family-names in database. It is shown that these algorithms are very effective in application.Khi xay dirng phan dam bao toan hoc cho nhieu h~thong thong tin ttr d9ng hoa, thirong g~p bai toan truy nguyen dong nhfit, nghia la xac dinh tfnh dong nhat cac m~u tin cila cimg m9t doi tirong.Co hai ki~u dong nhfit co ban: Dong nhat theo khoa va dong nhat theo thong
The problems for automatical indentification algorithm in databases with Latinized names has discussed overview in [2], [3], this paper is issuing detail algorithms that compares words of Latinized name following occurrences probability. Trong cac h~thong thong tin khong day du , vi~c tlrn kiern, dang nhat m<}t doi tirong dira tren mot so dele trirng nao d6 luon la mot van de diroc nhieu nha ... .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.