A path finding method for constraint checking in deductive databases

Subrata K. Das, M. Howard Williams

Research output: Contribution to journalArticle

Abstract

A method is presented for checking integrity constraints in a deductive database in which verification of the integrity constraints in the updated database is reduced to the process of constructing paths from update literals to the heads of integrity constraints. In constructing such paths, the method takes advantage of the assumption that the database satisfies the integrity constraints prior to the update. If such a path can be constructed, the integrity of the database has been violated. Correctness of the method has been proved for checking integrity constraints in stratified deductive databases. An explanation of how this method may be realised efficiently in Prolog is given. © 1989.

Original languageEnglish
Pages (from-to)223-244
Number of pages22
JournalData and Knowledge Engineering
Volume4
Issue number3
Publication statusPublished - Sep 1989

Fingerprint

Intelligent databases

Keywords

  • Deductive databases
  • Integrity constraints

Cite this

Das, Subrata K. ; Howard Williams, M. / A path finding method for constraint checking in deductive databases. In: Data and Knowledge Engineering. 1989 ; Vol. 4, No. 3. pp. 223-244.
@article{cf6698fd8e134002bbc29ecf7581308f,
title = "A path finding method for constraint checking in deductive databases",
abstract = "A method is presented for checking integrity constraints in a deductive database in which verification of the integrity constraints in the updated database is reduced to the process of constructing paths from update literals to the heads of integrity constraints. In constructing such paths, the method takes advantage of the assumption that the database satisfies the integrity constraints prior to the update. If such a path can be constructed, the integrity of the database has been violated. Correctness of the method has been proved for checking integrity constraints in stratified deductive databases. An explanation of how this method may be realised efficiently in Prolog is given. {\circledC} 1989.",
keywords = "Deductive databases, Integrity constraints",
author = "Das, {Subrata K.} and {Howard Williams}, M.",
year = "1989",
month = "9",
language = "English",
volume = "4",
pages = "223--244",
journal = "Data and Knowledge Engineering",
issn = "0169-023X",
publisher = "Elsevier",
number = "3",

}

Das, SK & Howard Williams, M 1989, 'A path finding method for constraint checking in deductive databases', Data and Knowledge Engineering, vol. 4, no. 3, pp. 223-244.

A path finding method for constraint checking in deductive databases. / Das, Subrata K.; Howard Williams, M.

In: Data and Knowledge Engineering, Vol. 4, No. 3, 09.1989, p. 223-244.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A path finding method for constraint checking in deductive databases

AU - Das, Subrata K.

AU - Howard Williams, M.

PY - 1989/9

Y1 - 1989/9

N2 - A method is presented for checking integrity constraints in a deductive database in which verification of the integrity constraints in the updated database is reduced to the process of constructing paths from update literals to the heads of integrity constraints. In constructing such paths, the method takes advantage of the assumption that the database satisfies the integrity constraints prior to the update. If such a path can be constructed, the integrity of the database has been violated. Correctness of the method has been proved for checking integrity constraints in stratified deductive databases. An explanation of how this method may be realised efficiently in Prolog is given. © 1989.

AB - A method is presented for checking integrity constraints in a deductive database in which verification of the integrity constraints in the updated database is reduced to the process of constructing paths from update literals to the heads of integrity constraints. In constructing such paths, the method takes advantage of the assumption that the database satisfies the integrity constraints prior to the update. If such a path can be constructed, the integrity of the database has been violated. Correctness of the method has been proved for checking integrity constraints in stratified deductive databases. An explanation of how this method may be realised efficiently in Prolog is given. © 1989.

KW - Deductive databases

KW - Integrity constraints

UR - http://www.scopus.com/inward/record.url?scp=0024733266&partnerID=8YFLogxK

M3 - Article

VL - 4

SP - 223

EP - 244

JO - Data and Knowledge Engineering

JF - Data and Knowledge Engineering

SN - 0169-023X

IS - 3

ER -