DML(ID:5708/dml004)

for Data manipulation language

part of the DDL/DML pair established at IBM Brazil and Pontificia Universidade Catolica do Rio de Janeiro, Brazil  

Related languages
DML => DDL   Co-development
References:
  • Casanova, M.A. and Furtado, A.L. "On the Description of Transition Constraints using Temporal Languages", view details
          in Advances in Database Theory, Vol. II, H. Gallaire, J. Minker and J-M. Nicolas (eds.), Plenum Press view details
  • Casanova, M.A.; de Castilho, J.M.V.; Furtado. A.L. "Properties of the Conceptual and External Schemas" view details
          in Advances in Database Theory, Vol. II, H. Gallaire, J. Minker and J-M. Nicolas (eds.), Plenum Press view details
  • Casanova, Marco R. and Bernstein, Phillip A. "A Formal System for Reasoning about Programs Accessing a Relational Database" pp386-414 view details Abstract: A formal system for proving properties of programs accessing a database is introduced. Proving that a program preserves consistency of the database is one of the possible applications of the system. The formal system is a variant of dynamic logic and incorporates a data definition language (DDL) for describing relational databases and a data manipulation language (DML) whose programs access data in a database. The DDL is a many-sorted first-order language that accounts for data aggregations. The DML features a many-sorted assignment in place of the usual data manipulation statements, in addition to the normal programming language constructs.
    DOI
          in TOPLAS 2(3) July 1980 view details
  • Marco A. Casanova, "A theory of data dependencies over relational expressions" view details Abstract: A formal system is developed for reasoning about a class of dependencies that includes all classes considered in the literature. The usefulness of the system is illustrated by applying it to various database design problems. The system is shown to be sound and complete by adapting the analytic tableaux method of first-order predicate calculus to the class of dependencies adopted. Finally, the method is shown to be a decision procedure for the inference problem of a subclass of the dependencies considered.


          in Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems, March 29-31, 1982, Los Angeles, California view details
  • Furtado, A.L. Veloso, P.A.S. and Casanova, M.A. "A Grammatical Approach to Data Bases" pp705-710 view details
          in Mason, R. E. A. (Ed.): Information Processing 83, Proceedings of the IFIP 9th World Computer Congress, Paris, France, September 19-23, 1983. North-Holland/IFIP, 1983, view details
  • Marco A. Casanova , Paulo A. S. Veloso , Antonio L. Furtado, "Formal data base specification: an eclectic perspective" view details Abstract: Logical, algebraic, programming language, grammatical and denotational formalisms are investigated with res pect to their applicability to formal data base speci fication. On applying each formalism for the purpose that originally motivated its proposal, it is shown that they all have a fundamental and well integrated role to play in different parts of the specification process. An example is included to illustrate the methodological aspects.
          in [ACM SIGACT-SIGMOD] Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems, April 02-04, 1984, Waterloo, Ontario, Canada view details