A UNIVERSAL MODEL FOR NON-PROCEDURAL DATABASE LANGUAGES

  • Authors:
  • Naphtali Rishe

  • Affiliations:
  • High-performance Database Research Center, School of Computer Science, Florida International University, University Park, Miami, FL 33199, USA

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.