论文信息 - A Universal Model for Non-Procedural Database Languages

A Universal Model for Non-Procedural Database Languages

We propose a language which can express every computable query. The language is syntactically based on the first-order predicate calculus, but semantically is interpreted as post-conditions, unlike the customary calculus query languages. The language has a capability to restrict itself to reasonable queries, accepting criteria of reasonability as a parameter.

Naphtali Rishe

[1] John wiley & sons, inc. , 1981, Analytical chemistry.

[2] Alfred V. Aho,et al. Universality of data retrieval languages , 1979, POPL.

[3] Jack Minker,et al. Logic and Data Bases , 1978, Springer US.

[4] Jack Minker,et al. Advances in Data Base Theory , 1981, Springer US.

[5] E. F. Codd,et al. A relational model of data for large shared data banks , 1970, CACM.

[6] E. F. Codd,et al. A Relational Model for Large Shared Data Banks , 1970 .

[7] François Bancilhon,et al. On the Completeness of Query Languages for Relational Data Bases , 1978, MFCS.

[8] David Harel,et al. Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[9] David Harel,et al. Horn clauses and the fixpoint query hierarchy , 1982, PODS.

[10] Deyi Li. A PROLOG database system , 1984 .

[11] E. F. Codd,et al. Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

[12] Naphtali Rishe,et al. Database design: the semantic modeling approach , 1992 .

[13] Advances in Data Base Theory , 1984, Springer US.