The Strategies of Integrity Constraint on Deductive database
碩士 === 國立臺灣科技大學 === 工程技術研究所 === 83 === An operation algorithm of semantic update optimization for keeping he integrity in deductive databases is what this hesis all about. In order to promote the efficiency of the database updating, we comb...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1995
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/51710240430429914311 |
| Summary: | 碩士 === 國立臺灣科技大學 === 工程技術研究所 === 83 === An operation algorithm of semantic update optimization for
keeping he integrity in deductive databases is what this hesis
all about. In order to promote the efficiency of the database
updating, we combine the integrity constraints together with
the deductive rules by using emantic analysis, so that the
integrity checking an be moved ahead to the time of deducing
mplication facts instead of just before the commitment time in
the traditional database. an Augment Rule/Goal Graph (ARG
Graph) describing the entire database structure f a deductive
database is introduced. Through the ARG Graph, it is easy to
find all the relevant nodes and to decide directly whether the
integrity checking s necessary when an update transaction comes
up.
|
|---|