Michel A. Melkanoff

Learn More
A formal approach is proposed to the definition and the design of conceptual database diagrams to be used as conceptual schemata in a system featuring a multilevel schema architecture, and as an aid for the design of other forms of schemata. We consider E-R (entity-relationship) diagrams, and we introduce a new representation called(More)
The purpose of this paper is to present an approach for verifying that explicitely stated integrity constraints are not violated by certain transactions. We utilize a relational model where-in constraints are given in a language based on the first order predicate calculus. Transactions are written in terms of an ALGOL.60 like host language with embedded(More)
Both in designing a new programming language and in extending an existing language, the designer is faced with the problem of deriving a “natural” grammar for the language. We are proposing an interactive approach to the grammar design problem wherein the designer presents a sample of sentences and structures as input to a grammatical inference(More)
The purpose of this paper is to present a new approach to the conceptual design of relational databases based on the complete relatability conditions (CRCs). It is shown that current database design methodology based upon the elimination of anomalies is not adequate. In contradistinction, the CRCs are shown to provide a powerful criticism for decomposition.(More)
We will attack this problem using the formal framework of the Relational Data Model [CODD 70, DATE 773. Requirement Cl), which has been called the comolete relatability requirement should, strictly speaking, include all the integrity constraints applicable to the data. However, tne state-of-the-art regarding the formal analysis of integrity constraints is(More)