A Data Base Search Problem
暂无分享,去创建一个
The problem of constructing an efficient retrieval algorithm for responding to queries of arbitrary complexity on a relational data base is considered. A query, represented by a relation-defining expression in the relational calculus, is translated into a retrieval algorithm.
[1] E. F. Codd,et al. A data base sublanguage founded on the relational calculus , 1971, SIGFIDET '71.
[2] E. F. Codd,et al. Further Normalization of the Data Base Relational Model , 1971, Research Report / RJ / IBM / San Jose, California.