Algorithm to find out all candidate keys based on the cycle of an inverse FD hypergraph

被引：0

作者：

机构：

来源：

Jisuanji Yanjiu yu Fazhan | / 3卷 / 223-228期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 9 条

[1] Determining All Candidate Keys Based on Karnaugh Map
Zhang Yi-Shun
2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 4, PROCEEDINGS, 2009, : 226 - 229
[2] Synthesize algorithm of canonical relation based on inverse hypergraph
Liu, Wenyuan
Hao, Zhongxiao
Xiaoxing Weixing Jisuanji Xitong/Mini-Micro Systems, 1999, 20 (11): : 828 - 831
[3] Research on a hypergraph-based algorithm to find set of the equivalence attribute
Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 1995, 32 (09): : 27 - 30
[4] The algorithm and program scheme to find out all valid trees and valid tree-pairs
Li, X
Yin, ZM
2003 5TH INTERNATIONAL CONFERENCE ON ASIC, VOLS 1 AND 2, PROCEEDINGS, 2003, : 298 - 301
[5] Research on an algorithm to find all prime attributes based on the schema matrix
Hao, Zhongxiao
Chang, Jianghua
Shi, Hong
Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 1996, 33 (10): : 748 - 751
[6] Algorithm to find the candidate key whose cardinality is M based on the attributes analysis table
Jisuanji Yanjiu yu Fazhan, 10 (752-759):
[7] A new ILP-based p-cycle construction algorithm without candidate cycle enumeration
Wu, Bin
Yeung, Kwan L.
Lui, King-Shan
Xu, Shizhong
2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, : 2236 - +
[8] An improved research on algorithm of finding out all kinds of cycle deadlocks in AGVS using task-resource graph
Sun, Liang
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE INFORMATION COMPUTING AND AUTOMATION, VOLS 1-3, 2008, : 1236 - 1239
[9] A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
Huang, Ding-Hsiang
Huang, Cheng-Fu
Lin, Yi-Kuei
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (03) : 1107 - 1114

← 1 →