Sets and negation in a logic data base language (LDL1)

  • Authors:

  • C. Beeri;S. Naqvi;R. Ramakrishnan;O. Shmueli;S. Tsur

  • Affiliations:

  • MOC, P O Box 200195, Austin, TX;MOC, P O Box 200195, Austin, TX;MOC, P O Box 200195, Austin, TX;MOC, P O Box 200195, Austin, TX;MOC, P O Box 200195, Austin, TX

  • Venue:
  • PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
  • Year:
  • 1987

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper we extend LDL, a Logic Based Database Language, to include finite sets and negation. The new language is called LDL1. We define the notion of a model and show that a negation-free program need not have a model, and that it may have more than one minimal model. We impose syntactic restriction in order to define a deterministic language. These restrictions allow only layered (stratified) programs. We prove that for any program satisfying the syntactic restrictions of layering, there is a minimal model, and that this model can be constructed in a bottom-up fashion. Extensions to the basic grouping mechanism are proposed. We show that these extensions can be translated into equivalent LDL1 programs. Finally, we show how the technique of magic sets can be extended to translate LDL1 programs into equivalent programs which can often be executed more efficiently