- From: Kumar Pandit <kumarp@windows.microsoft.com>
- Date: Wed, 26 Sep 2007 23:40:39 -0700
- To: "public-sml@w3.org" <public-sml@w3.org>
- CC: Kumar Pandit <kumarp@windows.microsoft.com>
- Message-ID: <D95F90884B51CF4F83E887862D5D3708C56C732411@NA-EXMSG-W601.wingroup.windeploy.ntd>
During Toronto f2f meeting, we discussed this proposal but did not reach a consensus. We decided to continue the discussion over email. I had raised questions during the f2f meeting about the following 2 scenarios. [1] Suppose there are 2 instance documents D1 & D2 corresponding to 2 conflicting versions of a schema. If there is a reference R from D1 to D2 and if R has a targetType/Element constraint on it, how do we enforce the constraint if the type/element involved in the constraint has a conflicting definition? How do we determine if the types/elements are equal? What does type equality mean across 2 conflicting schemas? [2] How would one enforce an identity constraint if its definition conflicts between the 2 schemas? That is, for example, one identity constraint defines 2 fields and the other defines 3 fields. How would one compute and compare key-sequences? We could come up with more cases like this. May be we should enumerate them all and address them one by one. However, I would like to take a step back, better understand the underlying scenarios and weigh them against the added complexity. I completely agree with the intent of schema binding proposal. It aims to make interop more deterministic which is the right thing to do. I believe, much of the complexity in this proposal is the result of the desire to support conflicting schemas. If that aspect is removed, the proposal becomes straightforward. In my opinion, this would be a good thing to do in the first version of SML spec.
Received on Thursday, 27 September 2007 06:46:54 UTC