<<< zurück

Rolling Boles, Optimal XML Structure Integrity for Updating Operations

Dokumenttyp: Konferenzveröffentlichung
URI:
(zitierfähiger Link)
http://nbn-resolving.de/urn:nbn:de:bsz:352-126226
Autor/in: Graf, Sebastian; Belle, Sebastian; Waldvogel, Marcel;
Erscheinungsdatum: 2011
Erschienen in: Proceedings of the WWW 2011, March 28–April 1, 2011, Hyderabad, India
ISBN: 978-1-4503-0637-9
Zusammenfassung: 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.
Kontrollierte Schlagwörter: XML Hash-Algorithmus Integrität<Informatik>;
Freie Schlagwörter: DOMHash; XML data integrity; XHash;
DDC: 004 Informatik
Lizenz: http://kops.ub.uni-konstanz.de/depositlicense2011
Projekt: Secure Networking and Storage
Fachbereich: Fachbereich Informatik und Informationswissenschaft

Dateien zu dieser Publikation

Dateien Größe Format
graf_Waldvogel_Belle.pdf 218.8Kb pdf

Das Dokument erscheint in: