There are class implications, problems of privilege and access, the lingering taint of monikers like Fratagonia and Patagucci.
The process of migration to the cloud may involve: a number of risks, loss of privacy, disruption to business processes, legal implications, problems with interoperability, data integrity, application portability, and security issues [20, 46 48].
We characterize the associated implication problem axiomatically and algorithmically in linear input time.
We also show that the general probabilistic CI implication problem can be reduced to that for elementary CI statements.
Our second contribution is to investigate the implication problem for XFDs in the presence of a Document Type Definition (DTD).
We introduce a lattice-theoretic framework that permits the study of the conditional independence (CI) implication problem relative to the class of discrete probability measures.
In particular, we characterize the associated implication problem axiomatically and develop a low-degree polynomial time algorithm that can be readily applied for deciding implication.
The implication problem is the most important one in dependency theory, and is the problem of determining if a set of dependencies logically implies another dependency.
More specifically, we investigate the implication problem for weak 'closest node' XFDs in the context of XML documents with no missing information.
In this paper, we study the implication problem of functional dependencies (FDs) in the presence of records, sets, multisets and lists.
