Abstract
In this paper, the concept of strong scheme is introduced. We prove that the membership problem for strong dependencies is solved by an algorithm in polynomial time. We give a necessary and sufficient condition for a relation to be Armstrong relation of a given strong scheme.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
