Checking functional consistency in deductive databases

https://doi.org/10.1016/0020-0190(90)90059-7Get rights and content

Abstract

In this paper we address the problem of integrating functions in Datalog. We extend Datalog to a language L containing negation, functions, and a strong type system. This type system is used by an algorithm that, given a program, checks for its L-consistency (a stronger form of consistency) by using the notions of local dependencies and global dependencies.

References (13)

  • S. Abiteboul et al.

    COL: a logic-based language for complex objects

    Proc. European Conference Extending Database Technology (EDBT88)

    (1988)
  • S. Abiteboul et al.

    Data functions, Datalog and negation

    Proc. of the ACM-SIGMOD Conference

    (1988)
  • W.W. Armstrong

    Dependency structures of data base relationships

    Proc. 1974 IFIP Congress

    (1974)
  • A. Brodsky et al.

    Inference of monotonicity constraints in Datalog programs

    Proc. of the eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

    (1989)
  • P. Buneman et al.

    FQL-a functional query language

    Proc. ACM SIGMOD conference on Management of Data

    (1979)
  • S. Ceri et al.

    Logic Programming and Databases

    (1989)
There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 1990 Published by Elsevier B.V.