## Rolling Boles, Optimal XML Structure Integrity for Updating Operations

2011
##### Project
Secure Networking and Storage
##### Publication type
Contribution to a conference collection
##### Published in
Proceedings of the WWW 2011, March 28 – April 1, 2011, Hyderabad, India. - ISBN 978-1-4503-0637-9
##### Abstract
While multiple techniques exist to utilize the tree structure of the Extensible Markup Language(XML) regarding integrity checks, they all rely on adaptions of the Merkle Tree: All children are acting as one slice regarding the checksum of one node with the help of an one-way hash concat nation. This results in postorder traversals regarding the (re-)computation of the integrity structure within modification operations. With our approach we perform nearly in-time updates of the entire integrity structure. We therefore equipped an XHash-based approach with an incremental hash function. This replaces postorder traversals by adapting only the incremental modifications to the checksums of a node and its ancestors. With experimental results we prove that our approach only generates a constant overhead depending on the depth of the tree while native DOMHash implementations produce an overhead based on the depth and the number of all nodes in the tree. Consequently, our approach called Rolling Boles generates sustainable impact since it facilitates instant integrity updates in constant time.
##### Subject (DDC)
004 Computer Science
##### Keywords
DOMHash,XML data integrity,XHash
##### Conference
WWW, Mar 28, 2011 - Apr 1, 2011, Hyderabad, India
##### Cite This
ISO 690GRAF, Sebastian, Sebastian Kay BELLE, Marcel WALDVOGEL, 2011. Rolling Boles, Optimal XML Structure Integrity for Updating Operations. WWW. Hyderabad, India, Mar 28, 2011 - Apr 1, 2011. In: Proceedings of the WWW 2011, March 28 – April 1, 2011, Hyderabad, India. ISBN 978-1-4503-0637-9
BibTex
@inproceedings{Graf2011Rolli-12622,
year={2011},
title={Rolling Boles, Optimal XML Structure Integrity for Updating Operations},
isbn={978-1-4503-0637-9},
booktitle={Proceedings of the WWW 2011, March 28 – April 1, 2011, Hyderabad, India},
author={Graf, Sebastian and Belle, Sebastian Kay and Waldvogel, Marcel}
}

RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/12622/1/graf_Waldvogel_Belle.pdf"/>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/12622"/>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/12622/1/graf_Waldvogel_Belle.pdf"/>
<dcterms:bibliographicCitation>Proceedings of the WWW 2011, March 28–April 1, 2011, Hyderabad, India</dcterms:bibliographicCitation>
<dc:creator>Graf, Sebastian</dc:creator>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dcterms:issued>2011</dcterms:issued>
<dcterms:title>Rolling Boles, Optimal XML Structure Integrity for Updating Operations</dcterms:title>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:language>eng</dc:language>
<dc:creator>Belle, Sebastian Kay</dc:creator>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:abstract xml:lang="eng">While multiple techniques exist to utilize the tree structure of the Extensible Markup Language(XML) regarding integrity checks, they all rely on adaptions of the Merkle Tree: All children are acting as one slice regarding the checksum of one node with the help of an one-way hash concat nation. This results in postorder traversals regarding the (re-)computation of the integrity structure within modification operations. With our approach we perform nearly in-time updates of the entire integrity structure. We therefore equipped an XHash-based approach with an incremental hash function. This replaces postorder traversals by adapting only the incremental modifications to the checksums of a node and its ancestors. With experimental results we prove that our approach only generates a constant overhead depending on the depth of the tree while native DOMHash implementations produce an overhead based on the depth and the number of all nodes in the tree. Consequently, our approach called Rolling Boles generates sustainable impact since it facilitates instant integrity updates in constant time.</dcterms:abstract>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-05-12T08:13:55Z</dcterms:available>
<dc:contributor>Waldvogel, Marcel</dc:contributor>
<dc:creator>Waldvogel, Marcel</dc:creator>
<dc:rights>terms-of-use</dc:rights>
<dc:contributor>Belle, Sebastian Kay</dc:contributor>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-05-12T08:13:55Z</dc:date>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:contributor>Graf, Sebastian</dc:contributor>
</rdf:Description>
</rdf:RDF>

Yes