A New Method for Simplifying Relation Schema With Keeping Equal Candidate Keys by Successive Elimination

ZHOU Dingkang

ZHOU Dingkang. A New Method for Simplifying Relation Schema With Keeping Equal Candidate Keys by Successive EliminationJ. Journal of Computer Research and Development, 1995, 32(5).

Citation:

ZHOU Dingkang. A New Method for Simplifying Relation Schema With Keeping Equal Candidate Keys by Successive EliminationJ. Journal of Computer Research and Development, 1995, 32(5).

Citation:

ZHOU Dingkang. A New Method for Simplifying Relation Schema With Keeping Equal Candidate Keys by Successive EliminationJ. Journal of Computer Research and Development, 1995, 32(5).

A New Method for Simplifying Relation Schema With Keeping Equal Candidate Keys by Successive Elimination

ZHOU Dingkang

Graphical Abstract

Abstract

Abstract

In this paper, the theories and methods to simplify the relation schema with keeping equal candidate keys by successive elimination technologies are given.

FullText(HTML)

References (0)

Cited By

Turn off MathJax

Article Contents

A New Method for Simplifying Relation Schema With Keeping Equal Candidate Keys by Successive Elimination

Abstract

Catalog

Export File

Citation

Format

Content