依赖模式和其蕴涵.doc

Preliminary Notations We start with reviewing basic features of a simple XML tree model. Within this paper, all graphs considered are directed, without parallel arcs and finite unless stated otherwise. 本文中，所有的图皆为有向的，有限的和无并联弧的，除非单独提到。 For every graph G, let VG denote its set of vertices and AG its set of arcs. 对每一图G图，VG表示其节点集合，AG表示其弧的集合。 A rooted graph is a graph G with one distinguished vertex rG, called the root of G, such that there is a directed path from rG to every other vertex in VG. A rooted tree is a rooted graph T without any (non-directed) cycles. A graph G is empty if AG is empty. Specifically, G is an empty rooted graph if it consists of a single vertex rG. For every vertex v, let SuccG(v) denote its (possibly empty) set of successors, called children, in G. A non-isolated vertex without children is a leaf of G. Let LG denote the set of all leaves of G. Definition 1. Given a vertex v ∈ VG and a subset W ? LG of leaves, a v-subgraph of G is the graph union of all directed walks from v to some w ∈ W. A v-walk of G is a directed walk from v to a single leaf w of G. Every v-walk or v-subgraph of a rooted tree is again a rooted tree. Let ENames and ANames be fixed sets of element names and attribute names, respectively. Also let the symbols E,A and S reflect whether a vertex represents an element, attribute or text data respectively. Definition 2. An XML graph is a rooted graph G together with the mappings name : VG → ENames∪ANames and kind: VG →{E,A,S} assigning every vertex its name and kind, respectively. If G is a rooted tree, then we speak of an XML tree Definition 3. Let G_ and G be two XML graphs, and consider a mapping φ : VG_ → VG. φ is said to be kind-preserving if the image of a vertex is of the same kind as the vertex itself, that is, kind(v_) = kind(φ(v_)) for all v_ ∈ VG_ . Further, φ is name-preserving if the image of a vertex carries the same name as the vertex itself, that is, name(v_) = name(φ(v_)) for all v_ ∈ VG_ . The mapping φ is