计算机应用研究2016，Vol.33Issue(4)：993-996,4.DOI:10.3969/j.issn.1001-3695.2016.04.007
时态强简单候选关键字算法研究
Research of temporal strong simple candidate key algorithm
摘要
Abstract
In real application system design,the researchers should design temporal scheme according to the application envi-ronment,and make it normative.No matter which normal form needed to meet,the issue of candidate keywords was involved. Temporal elementary candidate key corresponding to TEKNF and the temporal simple candidate key corresponding to TSNF had been proposed already.Based on it,this paper gave the definite conception of temporal strong simple candidate key under strong totally ordered temporal module scheme.It also gave strong totally ordered candidate key algorithm and the strong simple candidate key set algorithm.It proved the algorithms’termination and correction and discussed their complexities.At the same time,it also gave the preliminary definition of temporal strong simple normal form.关键词
时态模式/时态模式规范化/强全序模块模式/时态强简单候选Key words
temporal scheme/temporal scheme normalization/strong totally ordered temporal module scheme/temporal strong simple candidate key分类
信息技术与安全科学引用本文复制引用
万静,张晓东,刘芳,何云斌..时态强简单候选关键字算法研究[J].计算机应用研究,2016,33(4):993-996,4.基金项目
黑龙江省教育厅科学技术研究项目 （）
