Computing unique canonical covers for simple FDs via transitive reduction (Q834931): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2004.07.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044786206 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Transitive Reduction of a Directed Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph Algorithms for Functional Dependency Manipulation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multidimensional normal forms for data warehouse design. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3668890 / rank | |||
Normal rank | |||
Latest revision as of 22:39, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing unique canonical covers for simple FDs via transitive reduction |
scientific article |
Statements
Computing unique canonical covers for simple FDs via transitive reduction (English)
0 references
27 August 2009
0 references
databases
0 references
simple functional dependency
0 references
canonical cover
0 references
transitive reduction
0 references
