About one algorithm of relational database schema optimization

被引：0
|
作者：
Buslik, N.N.
机构：
来源：
Programmirovanie | 1993年 / 03期
关键词：
Algorithms - Data structures - Formal logic - Optimization - Polynomials - Set theory;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
An algorithm of exhaustive search of the 3NF relational schema, minimum from all equivalent schemes which are synthesized with Ling-Tompa-Kameda algorithm, is proposed. The reduction of search area is obtained owing to exclusion from examination the unkey attributes in subschemes of each equivalent schema. A polynomial time is necessary to find such attributes.
引用
收藏
页码：40 / 47
相关论文
共 50 条
12345