Algorithms for analysing related constraint business rules

Fu, Gaihua, Shao, Jianhua ORCID: https://orcid.org/0000-0001-8461-1471, Embury, Suzanne Marie and Gray, William Alexander 2004. Algorithms for analysing related constraint business rules. Data & knowledge engineering 50 (2) , pp. 215-240. 10.1016/j.datak.2004.01.006

Full text not available from this repository.

Abstract

Constraints represent a class of business rules that describe the conditions under which an organisation operates. It is common that organisations implement a large number of constraints in their supporting information systems. To remain competitive in today's ever-changing business environment, organisations are increasingly recognising the ability to evolve the implemented constraints timely and correctly. While many techniques have been proposed to assist constraint specification and enforcement in information systems, little has been done so far to help constraint evolution. In this paper, we introduce a form of constraint analysis that is particularly geared towards constraint evolution. More specifically, we propose several algorithms for determining which constraints collectively restrict a specified set of business objects, and we study their performance. Since the constraints contained in an information system are typically in large quantities and tend to be fragmented during implementation, this type of analysis is desirable and valuable in the process of their evolution.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Uncontrolled Keywords:	Constraints; Business rules; Constraint analysis
Publisher:	Elsevier
ISSN:	0169-023X
Last Modified:	17 Oct 2022 09:01
URI:	https://orca.cardiff.ac.uk/id/eprint/1855

Citation Data

Cited 4 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item