State-conditioned semantics in databases

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Integrity constraints are usually modeled based on the assumption that they are valid in any database state. This approach underdetermine integrity constraints, leads to strong influence of exceptions and requires complex operational support. However, for operating databases finer granularity in integrity and operational modeling is required. This paper proposes dynamic state-oriented modeling of integrity constraints. It has several advantages over other approaches: modeling is simpler; exceptions are modeled together with states; integrity maintenance is simpler; modeling granularity is higher; incorrect operations can be corrected; generic operations have greatest consistent specializations; parallelism is supported. Further, transactions can be distinguished into state preserving transactions and state transformation transactions. This distinction supports specialized handling of special transactions.

Cite

CITATION STYLE

APA

Thalheim, B. (1994). State-conditioned semantics in databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 881 LNCS, pp. 171–188). Springer Verlag. https://doi.org/10.1007/3-540-58786-1_79

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free