Database Reference
In-Depth Information
For 1≤j≤n
{
IF (t
i(temp)
[A
j
]
∈
[A
j
]
*
)
{
t
i
[A
j
]=E(K,t
i(temp)
[A
j
])
}
Else
{
t
i
[A
j
]= null
}
j = j +1
}
Tuple t will be inserted
}
Else
{
i = i+1
}
The UPLEVEL statement is permitted if the database state satis-
fies the entity integrity, the foreign key integrity, and the referential
integrity properties.
6.5 Soundness
The soundness of the encryption-based multilevel database model will
be proven in this section. The following two definitions will clarify
the meaning of the soundness in the encryption-based multilevel
database model [83].
Definition 6.5.1: If all the multilevel relational instances satisfy the
integrity properties, the multilevel relational database will be in a
legal state.
Definition 6.5.2: If the sequences of the data manipulation operational
statements transform any legal database state to another legal database
state, the multilevel relational database will be sound.
To prove the soundness of the encryption-based multilevel database
model, four cases should be proven.
Search WWH ::
Custom Search