Perzistentní XML DOM

Abstract

This thesis evaluates usage of persistent array as a key component of persistent DOM implementation. Proposes my own implementation of persistent DOM using not only persistent array but also B-tree and ordering schemes Range order, Coontainment order and Dewey order as means to identify XML nodes. At the end there are presented comparsion tests, evaluating persistent DOM throughput based on usage of ordering schemes and ways of evaluating queries. This solution is also compared with DOM implementation from Xerces library.