D. Plexousakis and J. Mylopoulos. Accommodating Integrity Constraints During Database Design. In of the International Conference on Extending Database Technology, pp. 497--513, Avignon, France (1996). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Behavioural Conflicts in a Causal Specification - Moffett, Vickers (1999) (2 citations) (Correct)
....in addition to those constraints which can be expressed directly through an ER diagram, enables the expression of application specific constraints. They then go on to show how it can be automatically verified that individual transactions conform to these constraints. Plexousakis Mylopoulos [19] demonstrate an integrity maintenance technique that modifies transaction specifications by incorporating in them conditions necessary to constraint satisfaction, thus eliminating the need for subsequent verification. Techniques such as these could be useful, in a causal specification, for ....
Plexousakis, D. and J. Mylopoulos. Accommodating Integrity Constraints during Database Design. in EDBT-96. 1996. Avignon, France.
Unknown - Information Systems Vol Self-citation (Plexousakis) (Correct)
No context found.
D. Plexousakis and J. Mylopoulos. Accommodating Integrity Constraints During Database Design. In of the International Conference on Extending Database Technology, pp. 497--513, Avignon, France (1996).
On the Efficient Maintenance of Temporal Integrity in Knowledge .. - Plexousakis (1996) Self-citation (Plexousakis) (Correct)
.... temporal integrity constraints and deductive rules, defined using a variation of the assertion language of Telos [Ple93a] Ple95a] Ple94] As far as integrity enforcement by transactions is concerned, we propose an incremental transaction modification technique for deterministic transactions [PM96] based on results from [BMR93] LR92] and [Pin94] The problems of constraint satisfiability and integrity recovery will not be dealt with in this dissertation since they constitute major research problems in their own right. Results on the integration of integrity checking in a knowledge base ....
....dealt with by restricting attention to the predicates changed by transactions and by eliminating inertial terms from the theorems that have to be proven in order to verify integrity. The concept of constraint protectors discussed in [SMS87] resembles that of constraint ramifications [LR92] PM96] and on which we expand on in chapter 5. The generation however of constraint protectors assumes the existence of a fairly general theory of lemmas that is independent of the transactions. Transaction Logic [BK95] alleviates the frame and ramification problems by the use of both procedural and ....
[Article contains additional citation context not shown here]
D. Plexousakis and J. Mylopoulos. Accommodating Integrity Constraints During Database Design. In Proceedings of the International Conference on Extending Database Technology, 1996. To appear.
Building Knowledge Base Management Systems - Mylopoulos, Chaudhri.. (1995) (3 citations) Self-citation (Plexousakis Mylopoulos) (Correct)
....in (Stonebraker, 1975) and (Wallace, 1991) Along the same lines, a transaction modification technique for temporal constraints has been proposed in (Lipeck, 1990) but does not account for implicit updates. A transaction modification method for temporal constraints and implicit updates appears in (Plexousakis, 1995). Transaction modification is less flexible than constraint simplification since each transaction has to be modified for each relevant constraint. Most promising, as a basis for enforcing more expressive constraints such as the ones expressible in the assertion language of Telos, are the ....
....possible intersection operator : t : right endpoint : left endpoint difference operator t no simp. F: false Formal Properties of Simplification The following properties have been proven for the simplification method described in the previous paragraphs. Detailed proofs can be found elsewhere (Plexousakis, 1995). Theorem 7.1 The simplification rules PF1 PF6 are sound. Temporal simplification (rule PF6) is also complete. The simplification method consists of a number of truth preserving transformations that produce formulae which, if proven not to be satisfied in the resulting knowledge base state, imply ....
[Article contains additional citation context not shown here]
Plexousakis, D. and Mylopoulos, J. (1995). Accommodating Integrity Constraints During Database Design.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC