"Serge Rielau" <sr*****@ca.ibm.comwrote in message
news:6e************@mid.individual.net...
Well, XML documents don't fall out the sky I s'pose.
XML can be a better approach than relational when the schema evolves a
lot. If you have trouble making (and keeping) it square.. XML may be your
friend.
Cheers
Serge
--
Serge Rielau
DB2 Solutions Development
IBM Toronto Lab
I do understand the advantages of XML schemas, but now I need some
information of performance.
I have seen the performance comparison between PureXML and XML Extender, but
I am particularly interested in the performance differences between PureXML
and relational.
If PureXML just uses CLOBs then I already have numbers for the difference
between a CLOB and VARCHAR (or any relational schema without a CLOB).
In the implementation I am looking at, large documents are not really
involved, and all individual segments(?) of the XML schema (what we call
columns in relational) are less than 1K. I want to make sure I am not
misunderstanding something about how PureXML data is stored in this type of
situation. In other words, if each segment (column) is small, can it be
configured to use DB2 bufferpools, or does the whole XML document have to be
small?..