Hi, <musings> If compression is characterised as "encoding information while reducing the bandwidth or bits required" , and note that in lossy compression "The lost information is usually removed because it is subjectively less important to the quality of the data" . Then isn't it possible to characterise a transformation of TREX (or RELAX or XML Schemas) into something terse like Hook  as lossy schema compression? Hook is 'ultra-terse' and so is 'compressed' in the general sense. However it is also lossy because it is coarse-grained. The loss in this case is in the available 'semantics' (and I'm using that term recklessly) of the schema validation. However in some (many?) cases the essential features of the desired constraints may be retained. </musings> A different perspective, or has this been covered elsewhere? . http://www.dictionary.com/cgi-bin/dict.pl?term=compression . http://www.dictionary.com/cgi-bin/dict.pl?term=lossy . http://www.ascc.net/xml/hook/ Cheers, L. -- Leigh Dodds, Systems Architect | "Pluralitas non est ponenda http://weblogs.userland.com/eclectic | sine necessitate" http://www.xml.com/pub/xmldeviant | -- William of Ockham
PURCHASE STYLUS STUDIO ONLINE TODAY!
Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!
Download The World's Best XML IDE!
Accelerate XML development with our award-winning XML IDE - Download a free trial today!
Subscribe in XML format