I have to teach someone XML revalidation by tomorrow morning and I don't have much idea about it.
It is something about XML schema and you have to revalidate it...
Can you give me some idea about how I should go about it?
Given two abstract XML Schemas, S = (, T , ,R) and S0 = (, T 0, 0,R0), and
an ordered labeled tree, T, that is valid according to S, our algorithm validates
T with respect to S and S0 in parallel. Suppose that during the validation of T
with respect to S0 we wish to validate a subtree of T, T0, with respect to a type
0. Let be the type assigned to T0 during the validation of T with respect to
S. If one can assert that every ordered labeled tree that is valid according to
is also valid according to 0, then one can immediately deduce the validity of
T0 according to 0. Conversely, if no ordered labeled tree that is valid according