Skip to main content

An Algorithm for Determining Related Constraints

  • Conference paper
  • First Online:
Book cover Advances in Databases (BNCOD 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2405))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Bassiliades and P. M. D. Gray. CoLan: A Functional Constraint Language and Its Implementation. Data and Knowledge Engineering(DKE), 14(3):203–249, 1994.

    Article  Google Scholar 

  2. A. Borgida. Description Logics in Data Management. IEEE Transactions on Knowledge and Data Engineering, 7(5):671–682, 1995.

    Article  Google Scholar 

  3. 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.

    Google Scholar 

  4. R. J. Brachman. An Overview of KL-ONE knowledge System. Cognitive Science, 9(2):171–216, 1985.

    Article  Google Scholar 

  5. R. H. L. Chiang, T. M. Barron, and V. C. Storey. Reverse Engineering of Relational Databases: Extraction of an EER Model from a Relational Database. Data and Knowledge Engineering, 12:107–142, 1994.

    Article  Google Scholar 

  6. 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.

    Google Scholar 

  7. S. Embury and J. Shao. Assisting the Comprehension of Legacy Transactions. In Proceedings of Second International Workshop of Data Reverse Engineering, 2001.

    Google Scholar 

  8. G. Fu. Comprehension of Constraint Business Rule Extracted from Legacy Systems. Brulee project techniqual report, Department of Computer Science, Cardiff University, 2000.

    Google Scholar 

  9. G. Fu, J. Shao, S.M. Embury, and W.A. Gray. Representing Constraint Business Rules Extracted from Legacy Systems. Submitted for Publication, Department of Computer Science, Cardiff University, 2002.

    Google Scholar 

  10. P. Grefen and P. Apers. Integrity Control in Relational Database System-An Overview. Data and Knowledge Engineering, 10:187–223, 1993.

    Article  Google Scholar 

  11. R.M. Gregor. The Evolving Technology of Classification-Based Knowledge Representation Systems. In J. Sowa, editor, Principle of Semantic Networks. 1991.

    Google Scholar 

  12. D. Hay and K. Healy. Defining Business Rules-What are They Really. Guide Business Rule Project Report, 1996.

    Google Scholar 

  13. H. Huang, W. Tsai, and et al. Business Rule Extraction from Legacy Code. Technical Report TR 95-034, Department of Computer Science and Engineering, University of Minnesota, 1995.

    Google Scholar 

  14. P. McBrien, A.H. Seltveit, and B. Wangler. Rule Based Specification of Information Systems. In Proceedings of the International Conference on Information Systems and Management of Data, pages 212–228, 1994.

    Google Scholar 

  15. 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.

    Google Scholar 

  16. ORM. UML 2.0 OCL RFP. Available online http://www.omg.org/techprocess/meetings/schedule/uml_2.0_ocl_rfp.html, 2002.

  17. P. Ruttan. Recovering Business Rules to Enable Legacy Transformation. Technical report, Netron Inc., 1999.

    Google Scholar 

  18. J. Shao, X. Liu, G. Fu, S. Embury, and W. Gray. Querying Data-Intensive Programs for Data Design. In proceeding of 13th International Conference for Advanced information System Engineering (CAiSE’01), 2001.

    Google Scholar 

  19. J. Shao and C. Pound. Reverse Engineering Business Rules from Legacy System. BT Journal, 17(4), 1999.

    Google Scholar 

  20. V. C. Storey, H. L. Yang, and R. C. Goldstein. Semantic Integrity Constraints in Knowledge-Based Database Design Systems. Data and Knowledge Engineering(DKE), 20(1): 1–37, 1996.

    Article  MATH  Google Scholar 

  21. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fu, G., Shao, J., Embury, S.M., Gray, W.A. (2002). An Algorithm for Determining Related Constraints. In: Eaglestone, B., North, S., Poulovassilis, A. (eds) Advances in Databases. BNCOD 2002. Lecture Notes in Computer Science, vol 2405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45495-0_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45495-0_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43905-9

  • Online ISBN: 978-3-540-45495-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics