The Community for Technology Leaders
RSS Icon
Venice/Mestre, Italy
May 24, 2009 to May 28, 2009
ISBN: 978-0-7695-3613-2
pp: 304-309
Comparing different versions of large tree structured data is a CPU and memory intensive task. State of the art techniques require the complete XML trees and their internal representations to be loaded into memory before any comparison may start. Furthermore, comparing sanitized XML trees is not addressed by these techniques. We propose a comparison technique for sanitized XML documents which ultimately results into a minimum cost edit script transforming the initial tree into the target tree. This method uses encrypted integer labels to encode the original XML structure and content, making the encrypted XML readable only by a legitimate party. Encoded tree nodes can be compared by a third party with a limited intermediate representation.
XML, Minimum cost edit script, Encryption
Mohammad Ashiqur Rahaman, Yves Roudier, Andreas Schaad, "A Secure Comparison Technique for Tree Structured Data", ICIW, 2009, Internet and Web Applications and Services, International Conference on, Internet and Web Applications and Services, International Conference on 2009, pp. 304-309, doi:10.1109/ICIW.2009.51
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool