Year: 1982
Type: article
Abstract: Determmmg whether a single relation satisfies a set of funcnonal dependencies is a straightforward task However, determining whether a set of relations sattsfies a set of functional dependencies is a more d~fficult problem Even the meaning of th~s notion of "satisfaction" needs to be settled Several definitions for sat~sfactton are considered, one of which is determmed to be most sound This definition requires that one can construct a single relatton that satisfies the dependencies while containing all of the information m the set of relations A polynomial-time algorithm as then developed to test satisfacnon using this definition Categories and Subject Descriptors H 2 1 [Database Management] Logical Design General
Source: Journal of the ACM
Author: Peter Honeyman
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder: National Science Foundation
Award: Database Theory
OpenAlex ID: W235476604