Download - Academy Publisher

its first child q 1 on the left, that they have a
q→ α q .
relationship : 1
3) p in G points to all child nodes
in C = p , p , L,
p ) , but there has its corresponding
(
2 3 n
C' = ( q2 , q3,
L,
qn
) in G', starting from q 1
, build the
same name item from the same name pointer and build
the different name item from the next name chain.
4) Similarly, we can define the relationship from
nodes in G' to nodes in G. It’s omitted at here.
Figure 2. CSTP Index
Converted map is shown in Fig.2. Fig.1 and Fig.2
show that the two structures are equivalent, but due to the
query on the index, so this need for further analysis of
their relationship and the corresponding characters.
Theorem 1: CSTP compressed query index designed
by this paper is a tree -graph, that has hierarchy of a tree
that the parent node is unique,and also has connectivity of
a graph on the same layer node.We could query from the
root firstly and aslo do the breadth-first . The findings and
order is the same as the original XML content.
C. Expand Events of SAX Parser
For the need of establishing index CSTP, this paper
extend API of the event-driven SAX parser to judgement
event after combining two adjacent events of SAX.
For example, XML data:
element contents 1
element contents 2
... ....
SAX after the expansion is disposed as following:
Judgement (Start element (a), Characters (element
contents 1)) in order to send a judgement event, and then
build node and dispose corresponding 7 judgement events
proved and summed up at the later. SAX continues
reading: Judgement (Characters (element contents 1), End
element (a)) after completion, as described above for the
corresponding treatment, SAX continues reading and
puting out Judgement (End element (a), Start element
(b) ), ... ..., and so on, in order to guarantee building the
CSTP index proposed in this paper only by reading
through SAX.
D. The Building of The Index
Lemma 1: For a pure XML document (such as the
DTD, Schema or CSS which is separated from XML
data), all of the information in it can be divided into five
kinds:
1 :
2 :
3 :
4 :
5 : element content
Prove: According to the W3C’s definition and
specifications for XML documents, it is not difficult to
prove the lemma above.
Character 1: XML has a total of five kinds of generic
events, and a maximum of 25 judgement events.
Because the SAX sends generic event from the start
tag, end tag and element content in XML, each
information of the five kinds divided above lemma is
corresponded to a genetic event. Expand the genetic event
of SAX API, 2 genetic events constitute a judgement
event, then five kinds of genetic events could constitute
25 species of judgement events. They are (It illustrates
the relationship or their characters between the two
genetic events behind genetic each event):
(1)
(2)
(3)
(4)
(5) element contents
(6)
(7)
(8)
(9)
(10) element contents
(11)
(12)
(13)
(14)
(15) element
contents
(16)
(17)
(18)
(19)
(20) element contents
(21) element contents
(22) element contents
(23) element contents