An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database

@article{Galil1982AnAL,
  title={An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database},
  author={Zvi Galil},
  journal={J. ACM},
  year={1982},
  volume={29},
  pages={96-102}
}
All algonthm that constructs, for a given set of (functional and multwalued) dependencJes X and a set of attributes X, the dependency basis of X as described. The algorithm runs in time O((1 + min(E, logp))llZl[), where p is the number of sets m the dependency basas of X,/~ Js the number of multivalued dependencies in X, and IlXll as the length of ~. a A variant of the algorithm tests whether a dependency a is unplied by X m time O((1 + mm(/~, log p-))ll~.ll), where ff is the number of sets m… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
49 Extracted Citations
0 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 49 extracted citations

Similar Papers

Loading similar papers…