Adaptive Index Deletion in XML Document Based on Tree Traversal Order

How to rapidly delete the XML index item to improve the query efficiently has received many attentions in resent research. However, the deletion maintenance of the index on the XML document is important also in dynamic application, which may limit efficiency when the scale of modification operation is high because the index maintenances need lots of I/Os and CPU time. In this paper we introduce a tree traversal deletion order on the XML index, this algorithms build the sub-tree of the deletion index nodes before the nodes are deleted from the index to avoid the repeat traversal on the index tree. Experimental results from our prototype system implementation highlight the correctness and efficiency of our solution.