A Minimum Path Decomposition of the Hasse Diagram for Testing the Consistency of Functional Dependencies

スポンサーリンク

概要

• 論文の詳細を見る

• An optimal algorithm for decomposing a special type of the Hasse diagram into a minimum set of disjoint paths is described. It is useful for testing the consistency of functional dependencies.

• 社団法人電子情報通信学会の論文
• 1993-02-25

著者

• Akutsu Tatsuya

  Mechanical Engineering Laboratory

• TAKASU Atsuhiro

  National Institute of Informatics

• Takasu Atsuhiro

  National Center For Science Information Systems

関連論文

• Algorithms for Finding the Largest Subtree whose Copies Cover All the Leaves
• Probabilistic Automaton-Based Fuzzy English-Text Retrieval(Software Systems)
• Load Balancing Scheme on the Basis of Huffman Coding for P2P Information Retrieval
• A Minimum Path Decomposition of the Hasse Diagram for Testing the Consistency of Functional Dependencies
• Margin-Based Pivot Selection for Similarity Search Indexes
• Optimal Pivot Selection Method Based on the Partition and the Pruning Effect for Metric Space Indexes
• An RNC Algorithm for Finding a Largest Common Subtree of Two Trees
• A Linear Time Pattern Matching Algorithm between a String and a Tree

スポンサーリンク