Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können kommenden Montag und Dienstag keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted next Monday and Tuesday.)

Rolling Boles, Optimal XML Structure Integrity for Updating Operations

Cite This

Files in this item

Checksum: MD5:07f8824c24cf8f75e022e6410af69cbd

GRAF, Sebastian, Sebastian 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

@inproceedings{Graf2011Rolli-12622, title={Rolling Boles, Optimal XML Structure Integrity for Updating Operations}, year={2011}, 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 and Waldvogel, Marcel} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <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:rights rdf:resource=""/> <dcterms:title>Rolling Boles, Optimal XML Structure Integrity for Updating Operations</dcterms:title> <dcterms:issued>2011</dcterms:issued> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:language>eng</dc:language> <dspace:hasBitstream rdf:resource=""/> <dcterms:isPartOf rdf:resource=""/> <dc:creator>Waldvogel, Marcel</dc:creator> <dcterms:bibliographicCitation>Proceedings of the WWW 2011, March 28–April 1, 2011, Hyderabad, India</dcterms:bibliographicCitation> <dcterms:available rdf:datatype="">2011-05-12T08:13:55Z</dcterms:available> <dc:contributor>Waldvogel, Marcel</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Belle, Sebastian</dc:contributor> <bibo:uri rdf:resource=""/> <dc:date rdf:datatype="">2011-05-12T08:13:55Z</dc:date> <dcterms:hasPart rdf:resource=""/> <dc:contributor>Graf, Sebastian</dc:contributor> <dc:creator>Graf, Sebastian</dc:creator> <dc:creator>Belle, Sebastian</dc:creator> <dc:rights>terms-of-use</dc:rights> <dspace:isPartOfCollection rdf:resource=""/> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

graf_Waldvogel_Belle.pdf 1026

This item appears in the following Collection(s)

Search KOPS


My Account