关键词: XML文档, 插入更新, BSEPS编码

Abstract: In order to determine rapidly the ancestor-descendant and parent-child relationships between nodes in XML querying, some labeling schemes have been proposed. However, relabeling and recalculation will happen when a new node is inserted in order-sensitive XML document, which leads the label update cost to be high. A novel labeling scheme, called BSEPS（Binary String Encoding based on Path Scheme）, which supports order-sensitive updates without relabeling or recalculation, is proposed based on the path labeling. The experimental results show that the order-sensitive queries and leaf node/subtree updates can be processed efficiently by BSEPS.

Key words: XML document, inserting update, BSEPS（Binary String Encoding based on Path Scheme） labeling