A Shorter Algorithm for Determining Intra Fact Type Uniqueness Constraints
We present a general algorithm for determining all intra fact type uniqueness constraints in a fact type with n roles. For Fact Oriented Methods of information modeling that work with elementary fact types, a top-down ap-proach is shorter than a bottom-up approach for fact types with more than two roles. The algorithm is shorter (in terms of the number of tests to be performed) than the one published earlier in our book on FCO-IM. For its most important steps, we prove that no shorter algorithm exists.
Title: A Shorter Algorithm for Determining Intra Fact Type Uniqueness Constraints
Written by: Jan Pieter Zwart, Guido Bakema
Published: LNCS 4806(719-728), OTM 2007 Workshops, Springer 2007, ISBN-13 978-3-540-76889-0, ISSN 0302-9743.
Language: English