Updating computing for XML document based on extended Dewey coding
XU Hong-zhi · Jisuanji gongcheng yu sheji · 2009
The low efficient problem of updating is encountered because of adjusting frequently the coding of subtree when some nodes of XML document are inserted or deleted. The cause of low efficiency is analyzed, then an extended Dewey coding is put forward. This coding scheme extending the continuity of Dewey coding and leading to the uncontinuous coding between sibling node is prepared for inserting new nodes. On that basis, an algorithm of inserting and splitting node supported by this coding scheme in XML document is designed. The experimental result shows, the proposed extended Dewey coding scheme achieves the updating computing of XML document effectively.