Abstract

It is a crucial problem for XML data query system to determine the structural relationship between any two nodes efficiently. By assigning a unique label which implies the position relationship to each XML tree node, the structural relationship between any two nodes can be judged directly with the label of each node. We propose a new XML tree labeling scheme named EBCL which depends on prefix-based labeling scheme. The EBCL can not only support dynamic update to XML document fully and efficiently, but also reduce the space cost extremely.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call