Uniquest: Determining the Semantics of Complex Uniqueness Constraints (1993)
| Venue: | The Computer Journal |
| Citations: | 21 - 14 self |
BibTeX
@ARTICLE{Weide93uniquest:determining,
author = {Th. P. Van Der Weide and A. H. M. Ter Hofstede and P. Van Bommel},
title = {Uniquest: Determining the Semantics of Complex Uniqueness Constraints},
journal = {The Computer Journal},
year = {1993},
volume = {35},
pages = {15--6}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this article the Uniquest Algorithm (the "quest for uniqueness"), defined in the Predicator Model, is discussed in depth. The Predicator Model is a general platform for object-role models. The Uniquest Algorithm is a constructive formal definition of the semantics of uniqueness constraints. As such, it facilitates the implementation in so-called CASE-tools. The Uniquest Algorithm provides a systematic approach for the interpretation of complex uniqueness constraints. This interpretation process is easily traced, using an extra formalism, called the Object Relation Network (ORN). The ORN is a directed graph with labelled edges, representing an object-role information structure. Intermediate results that are outside the scope of the information structure at hand, are represented elegantly as an ORN. A number of theoretical and practical examples prove the power of the Uniquest Algorithm. In these examples we will encouter complex uniqueness constraints, that are missed easily. The Un...
