Automated validation of conceptual schema constraints

T. A. Halpin, J. I. McCormack

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

5 Citations (Scopus)

Abstract

For a database application, conceptual design methods such as fact-oriented modelling and entity-relationship modelling are commonly used to specify a conceptual schema, which may then be mapped to a structure in a chosen data model (e.g. a relational database schema). Since conceptual data models support a rich variety of constraints, and these constraints may impact on one another, the task of ensuring mat the constraints expressed in a conceptual schema are consistent is non-trivial. Moreover, because different constraint patterns may be equivalent, some optimization may be needed to select the best constraint pattern for explicit assertion. With reference to conceptual schemas expressed in FOrML (an enhanced version of NIAM) mis paper discusses metarules for strong satisfiability and constraint preference, and outlines an efficient algorithm for validating four main types of constraints. Complexity analyses and benchmarks of the implemented algorithm are included.

Original languageEnglish
Title of host publicationAdvanced Information Systems Engineering - 4th International Conference CAiSE 1992, Proceedings
EditorsPericles Loucopoulos
PublisherSpringer
Pages445-462
Number of pages18
ISBN (Print)9783540554813
DOIs
Publication statusPublished - 1992
Externally publishedYes
Event4th International Conference on Advanced Information Systems Engineering, CAiSE 1992 - Manchester, United Kingdom
Duration: 12 May 199215 May 1992

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume593
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Advanced Information Systems Engineering, CAiSE 1992
CountryUnited Kingdom
CityManchester
Period12/05/9215/05/92

Cite this

Halpin, T. A., & McCormack, J. I. (1992). Automated validation of conceptual schema constraints. In P. Loucopoulos (Ed.), Advanced Information Systems Engineering - 4th International Conference CAiSE 1992, Proceedings (pp. 445-462). (Lecture Notes in Computer Science; Vol. 593 ). Springer. https://doi.org/10.1007/BFb0035147
Halpin, T. A. ; McCormack, J. I. / Automated validation of conceptual schema constraints. Advanced Information Systems Engineering - 4th International Conference CAiSE 1992, Proceedings. editor / Pericles Loucopoulos. Springer, 1992. pp. 445-462 (Lecture Notes in Computer Science).
@inproceedings{6ca05d09760b4aff9b322c4b348db6ac,
title = "Automated validation of conceptual schema constraints",
abstract = "For a database application, conceptual design methods such as fact-oriented modelling and entity-relationship modelling are commonly used to specify a conceptual schema, which may then be mapped to a structure in a chosen data model (e.g. a relational database schema). Since conceptual data models support a rich variety of constraints, and these constraints may impact on one another, the task of ensuring mat the constraints expressed in a conceptual schema are consistent is non-trivial. Moreover, because different constraint patterns may be equivalent, some optimization may be needed to select the best constraint pattern for explicit assertion. With reference to conceptual schemas expressed in FOrML (an enhanced version of NIAM) mis paper discusses metarules for strong satisfiability and constraint preference, and outlines an efficient algorithm for validating four main types of constraints. Complexity analyses and benchmarks of the implemented algorithm are included.",
author = "Halpin, {T. A.} and McCormack, {J. I.}",
year = "1992",
doi = "10.1007/BFb0035147",
language = "English",
isbn = "9783540554813",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "445--462",
editor = "Pericles Loucopoulos",
booktitle = "Advanced Information Systems Engineering - 4th International Conference CAiSE 1992, Proceedings",

}

Halpin, TA & McCormack, JI 1992, Automated validation of conceptual schema constraints. in P Loucopoulos (ed.), Advanced Information Systems Engineering - 4th International Conference CAiSE 1992, Proceedings. Lecture Notes in Computer Science, vol. 593 , Springer, pp. 445-462, 4th International Conference on Advanced Information Systems Engineering, CAiSE 1992, Manchester, United Kingdom, 12/05/92. https://doi.org/10.1007/BFb0035147

Automated validation of conceptual schema constraints. / Halpin, T. A.; McCormack, J. I.

Advanced Information Systems Engineering - 4th International Conference CAiSE 1992, Proceedings. ed. / Pericles Loucopoulos. Springer, 1992. p. 445-462 (Lecture Notes in Computer Science; Vol. 593 ).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

TY - GEN

T1 - Automated validation of conceptual schema constraints

AU - Halpin, T. A.

AU - McCormack, J. I.

PY - 1992

Y1 - 1992

N2 - For a database application, conceptual design methods such as fact-oriented modelling and entity-relationship modelling are commonly used to specify a conceptual schema, which may then be mapped to a structure in a chosen data model (e.g. a relational database schema). Since conceptual data models support a rich variety of constraints, and these constraints may impact on one another, the task of ensuring mat the constraints expressed in a conceptual schema are consistent is non-trivial. Moreover, because different constraint patterns may be equivalent, some optimization may be needed to select the best constraint pattern for explicit assertion. With reference to conceptual schemas expressed in FOrML (an enhanced version of NIAM) mis paper discusses metarules for strong satisfiability and constraint preference, and outlines an efficient algorithm for validating four main types of constraints. Complexity analyses and benchmarks of the implemented algorithm are included.

AB - For a database application, conceptual design methods such as fact-oriented modelling and entity-relationship modelling are commonly used to specify a conceptual schema, which may then be mapped to a structure in a chosen data model (e.g. a relational database schema). Since conceptual data models support a rich variety of constraints, and these constraints may impact on one another, the task of ensuring mat the constraints expressed in a conceptual schema are consistent is non-trivial. Moreover, because different constraint patterns may be equivalent, some optimization may be needed to select the best constraint pattern for explicit assertion. With reference to conceptual schemas expressed in FOrML (an enhanced version of NIAM) mis paper discusses metarules for strong satisfiability and constraint preference, and outlines an efficient algorithm for validating four main types of constraints. Complexity analyses and benchmarks of the implemented algorithm are included.

UR - http://www.scopus.com/inward/record.url?scp=85028842876&partnerID=8YFLogxK

U2 - 10.1007/BFb0035147

DO - 10.1007/BFb0035147

M3 - Conference Paper

SN - 9783540554813

T3 - Lecture Notes in Computer Science

SP - 445

EP - 462

BT - Advanced Information Systems Engineering - 4th International Conference CAiSE 1992, Proceedings

A2 - Loucopoulos, Pericles

PB - Springer

ER -

Halpin TA, McCormack JI. Automated validation of conceptual schema constraints. In Loucopoulos P, editor, Advanced Information Systems Engineering - 4th International Conference CAiSE 1992, Proceedings. Springer. 1992. p. 445-462. (Lecture Notes in Computer Science). https://doi.org/10.1007/BFb0035147