CLASSIC: a structural data model for objects
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Integrity control in relational database systems: an overview
Data & Knowledge Engineering
Reverse engineering of relational databases: extraction of an EER model from a relational database
Data & Knowledge Engineering
CoLan: a functional constraint language and its implementation
Data & Knowledge Engineering
Semantic integrity constraints in knowledge-based database design systems
Data & Knowledge Engineering
Description Logics in Data Management
IEEE Transactions on Knowledge and Data Engineering
Querying Data-Intensive Programs for Data Design
CAiSE '01 Proceedings of the 13th International Conference on Advanced Information Systems Engineering
Towards a Unifying Logic Formalism for Semantic Data Models
ER '93 Proceedings of the 12th International Conference on the Entity-Relationship Approach: Entity-Relationship Approach
Representing Constraint Business Rules Extracted from Legacy Systems
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Constraint Equations: Declarative Expression of Constraints With Automatic Enforcement
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Assisting the Comprehension of Legacy Transactions
WCRE '01 Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01)
Representing Constraint Business Rules Extracted from Legacy Systems
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
Constraints are a class of business rules that many organisations implement in their information systems. However, it is common that many implemented constraints do not get documented. This has led researchers to consider how to recover constraints from implementations. In this paper, we consider the problem of how to analyse the set of constraints extracted from legacy systems. More specifically, we introduce an algorithm for determining which constraints are related according to some criteria. Since constraints are typically fragmented during their implementation, the ability to determine a set of related constraints is useful and important to the comprehension of extracted constraints.