Abstract
Constraints are a class of business rules that most information systems implement. However, due to sta. turnover and lackof documentation, precise knowledge of what constraints are enforced by a system is often not available. This can seriously hinder an organisation’s ability to understand the data stored in its systems, and to evolve the systems to implement new business policies. To help the situation, researchers have considered how to extract constraints out of legacy systems. While some powerful methods have been proposed for identifying constraints in application programs, little has been done so far to help users to comprehend the recovered constraints. To step up research in this direction, we study in this paper how the recovered constraints should be represented, so that they can be analysed, processed and then presented to the user in a comprehensible manner. We introduce a representation language that offers a balance between expressiveness, comprehensibility and reasoning power in handling the recovered constraints.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Bassiliades and P. M. D. Gray. CoLan: A Functional Constraint Language and Its Implementation. Data and Knowledge Engineering, 14(3):203–249, 1994.
A. Borgida. Description Logics in Data Management. IEEE Transactions on Knowledge and Data Engineering, 7(5):671–682, 1995.
A. Borgida, R. J. Brachman, D. L. McGuinness, and L. A. Resnick. Classic: A Structural Data Model for Objects. In SIGMOD Conference, pages 58–67, 1989.
J. A. Chudziak, H. Rybinski, and J. Vorbach. Towards a Unifying Logic Formalism for Semantic Data Models. In Proceedings of 12th International Conference on the Entity-Relationship Approach, pages 492–507, 1993.
S. Embury, J. Shao, G. Fu, X. Liu, and W. Gray. A Frameworkfor the Recovery of Data Semantics from Information Systems. Submitted for Publication, Department of Computer Science, Cardi. University, 2002.
G. Fu, J. Shao, S. M. Embury, and W. A. Gray. An Algorithm for Determining Related Constraints. In Proceedings of 19th British National Conference on Databases (BNCOD2002) (to appear), 2002.
M. Morgenster. Constraint Equations: Declarative Expression of Constraints with Automatic Enforcement. In Proceedings of 10th International Conference on Very Large Data Bases, pages 291–300, 1984.
ORM. UML 2.0 OCL RFP. Available online http://www.omg.org/techprocess/meetings/schedule/uml 2.0 ocl rfp.html, 2002.
P. Ruttan. Recovering Business Rules to Enable Legacy Transformation. Technical report, Netron Inc., 1999.
S. Urban. ALICE: An Assertion Language for Integrity Constraint Expression. In Proceedings of the 13th Annual Conference on Computer Software and Application, pages 292–299, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fu, G., Shao, J., Embury, S., Gray, W. (2002). Representing Constraint Business Rules Extracted from Legacy Systems. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds) Database and Expert Systems Applications. DEXA 2002. Lecture Notes in Computer Science, vol 2453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46146-9_46
Download citation
DOI: https://doi.org/10.1007/3-540-46146-9_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44126-7
Online ISBN: 978-3-540-46146-3
eBook Packages: Springer Book Archive