Updating Disjunctive Datbases via Model Trees

Thumbnail Image
Files
CS-TR-3407.ps(223.3 KB)
No. of downloads: 117
CS-TR-3407.pdf(209.49 KB)
No. of downloads: 402
Publication or External Link
Date
1998-10-15
Authors
Grant, John
Gryz, J.
Minker, Jack
Advisor
Citation
DRUM DOI
Abstract
In this paper we study the problem of updating disjunctive databases, which contain indefinite data given as positive injunctive closes. We give correct algorithms for the insertion of a clause into and the deletion of a clause from such databases. Although the algorithms presented here are oriented towards model trees, they apply to any representation of minimal models. (Also cross-referenced as UMIACS-TR-95-11)
Notes
Rights