[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] is there a way to hash an element?
Hello all -- So I've got about half a gibabyte of XML messages describing various health care actions. Many of these are structural duplicates of each other; the top elements differ by their attribute values, but the structure and values of the descendant elements is the same. The amount of duplication varies from none to thousands. I've got an apparently useful heuristic based on descendant attribute values, but would -- it is health care data -- really like to have a more robust way to group the elements into set of equivalent top-level names by their structural sameness. (I can't hand-check the whole data set.) So I find myself wanting an equivalent of sha256sum for elements so I could generate a grouping key from the descendant elements and their associated attributes as a unit. Is there such a thing? Equivalent approaches? Thanks! Graydon
|
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
|