[dsdl-discuss] Re: FW: [office-comment] Ambiguity problems caused bya:defaultValue

Dear,

Does it mean we need a lightweight tool for doing less powerful thing
than Schematron is able to do ?

The problem in the example give is that is not a simple Parent/Child relation

I thing there few path here we can discuss :

1) Adding something like key/keyref *in* Relax NG
2) Adding something like key/keyref as an extension language to Relax
NG (as Schematron does today) which would do this lightweight job
3) Planning to add such step in Validation Management (Part 10)

Mohamed

On Mon, May 12, 2008 at 7:12 AM, Alex Brown <alexb@griffinbrown.co.uk> wrote:
> Murata-san
>
> Schematron can do anything :-)
>
> My worry is that, practically speaking, it entails the building of an
> in-memory tree. To do that for a (potentially big) ODF document, just to
> test for keyref constraints seems wasteful of resources - especially
> when this kind of test is naturally streamable.
>
> - Alex.
>
>
> > -----Original Message-----
> > From: dsdl-discuss-bounce@dsdl.org
> > [mailto:dsdl-discuss-bounce@dsdl.org] On Behalf Of MURATA Makoto
> > Sent: 12 May 2008 00:30
> > To: dsdl-discuss@dsdl.org
> > Subject: [dsdl-discuss] Re: FW: [office-comment] Ambiguity
> > problems caused bya:defaultValue
> >
>
>
> > Alex and Rick,
> >
> > > One thing maybe this raises is that we (DSDL'ers) have lost
> > sight of
> > > the need for a specialised key/keyref type validation
> > mechanism which
> > > (I
> > > believe) at one time was seen as a necessary part of the Standard.
> >
> > Let's make sure whether Schematron does the job.
> >
> > Consider the following schema. It is correct (as defined by the RNG
> > spec) but not compatible (as defined by the DTD compatibility spec).
> >
> > start = element foo {bar1, bar2, ttt*}
> > bar1 = element bar1 {baz1}
> > bar2 = element bar2 {baz2}
> > baz1 = element baz {attribute id { ID }, xsd:string}
> > baz2 = element baz {xsd:int}
> > ttt = element ttt {attribute ref { IDREF } }
> >
> > In Schematron, how can we say the following conditions?
> >
> > 1) bar/baz/@id are identifiers
> > 2) ttt/@ref references to the identifiers
> >
> > Application programmers can easily write programs for
> > maintaining hath tables if they understand 1) and 2).
> >
> > If Schematron can meet the challenge, I am not sure if we
> > need something more.
> >
> > Cheers,
> >
> > --
> > MURATA Makoto <murata@hokkaido.email.ne.jp>
> >
> > --
> > DSDL members discussion list
> >
> > To unsubscribe, please send a message with the command
> > "unsubscribe" to dsdl-discuss-request@dsdl.org
> > (mailto:dsdl-discuss-request@dsdl.org?Subject=unsubscribe)
> >
> >
> --
> DSDL members discussion list
>
> To unsubscribe, please send a message with the
> command "unsubscribe" to dsdl-discuss-request@dsdl.org
> (mailto:dsdl-discuss-request@dsdl.org?Subjectunsubscribe)
>
>

-- 
Innovimax SARL
Consulting, Training & XML Development
9, impasse des Orteaux
75020 Paris
Tel : +33 9 52 475787
Fax : +33 1 4356 1746
http://www.innovimax.fr
RCS Paris 488.018.631
SARL au capital de 10.000 €
--
DSDL members discussion list
To unsubscribe, please send a message with the
command  "unsubscribe" to dsdl-discuss-request@dsdl.org
(mailto:dsdl-discuss-request@dsdl.org?Subject=unsubscribe)