Lien (4NF Decomposition for Conflict-Free Dependency Sets 4NF Decomposition)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(k^{2} n^{2})$

Space Complexity

$O(k^{2})$ words

(Derived: Uses an auxiliary array of size $k \times k$)

Description

Multiway Decomposition Algorithm

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1982

Reference

https://dl.acm.org/doi/abs/10.1145/319540.319546