CN1632784A - Method for quick executing XSLT - Google Patents
Method for quick executing XSLT Download PDFInfo
- Publication number
- CN1632784A CN1632784A CN 200410099274 CN200410099274A CN1632784A CN 1632784 A CN1632784 A CN 1632784A CN 200410099274 CN200410099274 CN 200410099274 CN 200410099274 A CN200410099274 A CN 200410099274A CN 1632784 A CN1632784 A CN 1632784A
- Authority
- CN
- China
- Prior art keywords
- node
- xslt
- tree
- document
- xml
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Abstract
This invention belongs to database technique field and in detail is a method of rapid extension style list language conversion. This method comprises the following steps: first to combine the XML file structure information and XSLT conversion need structure through forming conversion tree; then to establish flow process mode from conversion tree; to scan the XML source file and to convert the XSLT program into multi-affair processor through flow process mode; to get the whole result file after scanning.
Description
Technical field
The invention belongs to database technical field, but be specifically related to a kind of method of quick execution extensible stylesheet Formad lanaguage conversion (XSLT) of novelty.Adopt this method, can fast and efficiently the XML file conversion be become the XML file of text, html file or other form.
Background technology
XML (extend markup language) is a kind of meta-language, also is a kind of text based SGML.It is a subclass of standard generalized markup language.XML comprises one group of primitive rule, and anyone can utilize the SGML of this rule creation at specific application area, and these marks are the display mode of descriptor not, but information itself.Its allows tagged element type, element is nested and element between quote etc.The formulation of XML standard has promoted the development of Web (internet) greatly, and it will become the basis of Web of future generation.
Along with increasing company they data management and the exchanges data strategy in adopt the standard of XML as data representation and exchange, on a lot of operating system platforms, all begin to provide can the processing XML data instrument.XSLT (but the conversion of extensible stylesheet Formad lanaguage) as the standard that W3C organizes to set up, has obtained a lot of Software tool supports.XSLT is a kind of language that is used for changing, and is very easy to use, so a lot of developer is willing to adopt it to come the processing XML data very much.The XSLT transform engine that some can isolated operation has been arranged at present, and such as SAXON, XALAN also has the MS XML of Microsoft etc.The developer uses these instruments, the XML data can be converted to HTML (HTML (Hypertext Markup Language)) file or other form.
In applications such as biological information, people usually adopt XML to represent large-scale data.The XML data file that obtains like this is often very big.Present existing XSLT engine can only be handled little XML document, and when document was big, their execution performance descended very soon.These XSLT engine internal almost do not adopt any optimisation technique, and before carrying out conversion, they need read whole XML source document in the middle of the internal memory.Data structure in the internal memory is a tree, because need the additional informations such as pointer between the record node, so its size is several times of source document.When handling very big XML document, need to consume very many internal memories.When physical memory uses inadequately, system will use virtual memory in a large number.Excessive use to virtual memory is the most critical reason that causes system performance to descend.
Summary of the invention
The objective of the invention is to propose a kind of high efficiency method of the XSLT of execution conversion.This method guarantees can handle very large XML document under the situation of using little memory.
The quick execution XSLT conversion method that the present invention proposes is to carry out the XSLT conversion by a stream transaction module.Scanning MML source document, by this stream transaction module, the structural information of XML source document known (DTD represents with DTD (Document Type Definition)), an XSLT converse routine is converted to and is a lot of event handlers.In the process that reads the XML source document from the beginning to the end, can trigger a lot of incidents,, the output segment of a correspondence be arranged all each class incident; The most at first, result document is empty, and along with the carrying out to the scanning process of source document, the output segment of corresponding event is added to the back of the result document that has produced gradually; After scanning process finished, the user just can obtain final complete results document at once.In described stream treatment conversion model, the output segment of each class incident may be a constant character string, the PCDATA value of current leaf node, or the serial connection of the two.So, in the process of conversion, do not need extra buffer area to deposit intermediate result.
1. the basic concepts relevant with the present invention
DTD (Document Type Definition) DTD:
The structure of XML document can be represented with DTD (DTD (Document Type Definition)), and DTD can be expressed as the form of an ordered tree, is called the DTD tree.As shown in Figure 1, tree root is represented the root element of XML document, and other nodes correspond respectively to an element type among the DTD, and internodal set membership is corresponding to the nest relation between the DTD element.All child nodes of a node from left to right sort.
The XSLT converse routine:
An XSLT program L comprises a lot of pattern rules, and every pattern rule is made up of pattern and two parts of template, the match pattern that modal representation should rule wherein, and the output template that template representation should rule correspondence incident.Output template is a sequence, each sequential element or constant character string, or the applying template order of calling other pattern rules.Suppose adjacent constant character string is connected in series, therefore in output template, can not occur the situation of continuous two constant strings again.An XSLT converse routine (example 1) is as follows:
＜xsl：template match＝″/″＞ ＜html＞＜head＞＜title＞Books Information＜/title＞＜/head＞ ＜body＞＜table＞ ＜xsl：apply-templates select＝″publication/book″/＞ ＜/table＞＜/body＞ ＜/html＞ ＜/xsl：template＞ ＜xsl：template match＝″book″＞ ＜tr＞＜td＞＜xsl：apply-templates select＝″title″/＞＜/td＞ ＜td＞＜table＞ ＜xsl：apply-templates select＝″author″/＞ ＜/table＞＜/td＞ ＜/tr＞ ＜/xsl：template＞ ＜xsl：template match＝″author″＞ ＜tr＞＜td＞＜xsl：apply-templates select＝″name″/＞＜/td＞＜/tr＞ ＜/xsl：template＞ ＜xsl：template match＝″title″＞ ＜xsl：value-of select＝″.″/＞ ＜/xsl：template＞ ＜xsl：template match＝″name″＞ ＜xsl：value-of select＝″.″/＞ ＜/xsl：template＞
The SAX DLL (dynamic link library):
When using the XML resolver to come analyzing XML file, it will trigger a series of incidents with driver application.Based on the SAX interface (at the simple programming interface of XML) of incident by the incident of callback method in application program report XML document resolving, such as the beginning of an element or end etc.User program wants these call back functions of specific implementation to handle different incidents.The present invention will change into a series of event handlers to the XSLT converse routine.
2. transition tree and structure thereof
In the XSLT converse routine, each bar pattern rule or applying template order will be mated a node or the one group of brotgher of node in the XML document of source, so they are corresponding to the unique node in the DTD tree.For structural information and XSLT conversion with XML document require to combine to consider, the present invention proposes the notion of transition tree.In essence, transition tree is the DTD tree through having expanded.Fig. 2 is an example of transition tree, and it combines the DTD among Fig. 1 and the information of above-mentioned XSLT converse routine (example 1).In transition tree, circular node is represented an element type, and the rectangle node represents to come from a constant character string in the XSLT converse routine, and dotted line represents to call a certain applying template order, and solid line is represented the set membership between the element.Below transition tree is specifically defined.
The DTD of given document to be converted and an XSLT converse routine, corresponding transition tree is an ordered tree.This ordered tree comprises two category nodes, node element and constant character string node.In transition tree, there are three class limits.The set membership between the element is represented on first kind limit, is represented by solid line; The second class limit connects node element and constant character string node, is represented by dot-and-dash line; The 3rd class limit is represented to call and the relation of being called, and dots.Two class limits, front are to come out according to the information structuring among the DTD, and the 3rd class limit is to obtain according to the XSLT converse routine.
Hereinafter tell about the step of structure transition tree for convenience, at first provide the definition of several terms.Each bar pattern rule r in the XSLT converse routine
iA node with in the coupling DTD tree claims that this node is r
iMatched node, be designated as mnode (r
i).r
iOutput template be a sequence (o
I1, o
I2..., o
It), if o
IjBe the applying template order, it also can choose the unique node in the DTD tree, is called o
IjChoose node, be designated as selnode (o
Ij).
The step of structure transition tree is as follows: the DTD tree T that at first constructs the XML document type definition; Investigate each bar transformation rule r of XSLT converse routine L, in T, find the matched node n of r; Continue to investigate each the element o in the output template sequence of r, if o is a constant character string, T creates a leaf node n ' for tree, adds one from n to n ' the limit; If o calls template command, choose node n ' from what tree was found o the T, add one equally from n to n ' the limit.
3. stream transaction module and foundation thereof
Introduce stream transaction module (SPM) below.To each incident e, no matter it is that element tags begins incident, or the element tags End Event, an output segment and e correspondence are all arranged.Begin incident for each element, its output segment start (e) is a constant string.To the element End Event of non-leaf node, its output segment end (e) also is a constant string.But the element End Event of leaf node and top situation are different.For each this class incident, its output fragment is a tlv triple (c
1, pcdata, c
2), c wherein
1And c
2Be the constant string, pcdata represents the PCDATA value of current leaf node, may be sky.
In with the process of source XML document, can produce a sequence of events with the conversion of XSLT program.The output segment of all these incidents is connected in series according to sequencing, just the result document after the conversion.In the process of scan source document, the new output result who produces will be added to the afterbody that had before born results gradually.So before obtaining the complete results document, processing engine can be exported a part of result of front earlier.
The step that obtains flowing transaction module from transition tree is as follows: setting up the stream transaction module is the process of a recurrence, to arbitrary node n of transition tree, and end (n), start (n) initial value is an empty string; If n is a leaf node, then make end (n) :=pcdata+end (n); With c
1, c
2..., c
pAll come from the child nodes of DTD tree below the expression node n, and p is this child nodes number, with d
1, d
2..., d
qAll come from the child nodes of XSLT converse routine below the expression node n, and q is this child nodes number, if d
1Be a constant character string node, then make start (n) :=start (n)+d
1, and counter i is set is 2, otherwise it is 1 that counter i is set; When i is not more than q, repeat following steps: suppose that c is positioned at from node n to node d
iThe child nodes of n on this paths, if the limit from n to c not by the asterisk mark, and d
I+1Be constant string node, then make end (c) :=end (c)+d
I+1And i:=i+2, otherwise make i:=i+1; If d
I+1Be constant string node, suppose that c ' is positioned at from node n to node d
I+2The child nodes of n on this paths then makes start (c ') :=d
I+1+ start (c ') and i:=i+2, otherwise make i:=i+1; To each child nodes d
j, the above process of recursive call.
See a concrete example, the stream transaction module example of the transition tree correspondence among Fig. 2 is as follows:
start(publication)＝″<html>...<table>″
end(publication)＝″</table>...</html>″
start(book)＝″<tr><td>″
end(book)＝″</table></td></tr>″
end(title)＝concat(PCDATA?value?of?title，″</td><td><table>″)
begin(author)＝″<tr><td>″
end(name)＝concat(PCDATA?value?of?name，″</td></tr>″)
In sum, the method for the quick execution XSLT conversion that the present invention proposes is to handle mould by a stream to carry out the XSLT conversion, and concrete steps are as follows:
(1), the structural information of XML source document and XSLT conversion are required to combine at first by the structure transition tree;
(2) set up the stream transaction module from transition tree, it is a recursive procedure;
(3) scanning XLM source document by the stream transaction module, can trigger a lot of incidents in the process that reads the XML source document from the beginning to the end, to each class incident, the output segment of a correspondence is arranged all; The most at first, result document is empty, and along with the carrying out to the scanning process of source document, the output segment of corresponding event is added to the back of the result document that has produced gradually; After scanning process finished, the user just can obtain final complete results document at once.
In the stream transaction module of Ti Chuing, each element begins with End Event an output segment correspondence is arranged all in the present invention.In the process of scan source document, will produce a lot of output segments.In the process of conversion source document, there is not extra buffer memory expense.Before source data does not also run through fully, just can export the beginning part of result document.So even a given very large XML data instance, the inventive method also can be finished transfer process by a scanning.Stream transaction module in the inventive method has avoided existing transform engine to need in advance whole source document to be written into the defective of internal memory fully, has reduced memory consumption, has greatly improved execution efficient.Simultaneously, the stream transaction module has good expandability, is disposing on ordinary individual's computer of 256 MB of memory, can handle more than the 500M even the XML data of several G.
For example,, in the scan source XML document and utilize in the process that the SAX interface resolves, run into the beginning of publication element at every turn, will export＜html for above-mentioned stream transaction module ...＜table 〉; Run into the beginning of book element at every turn, will export＜tr＜td 〉; Run into the end of title element at every turn, will at first export the leaf values of this title element, output then＜/td〉＜td〉＜table 〉; ....The output of all these individual events is connected in series, and is final result document.
Description of drawings
Fig. 1 is a DTD tree.
Fig. 2 is the transition tree in conjunction with the XSLT converse routine in DTD among Fig. 1 and the example 1.
Embodiment
Further specify foregoing invention below by an example.
The DTD of XML document to be converted is as follows:
＜! ELEMENT publication (book)
*
＜! ELEMENT book (title, book number, author
*)
＜! ELEMENT title (#PCDATA) 〉
＜! ELEMENT book number (#PCDATA) 〉
＜! ELEMENT author's (name) 〉
＜! ELEMENT name (#PCDATA) 〉
As shown in Figure 1, corresponding DTD tree has 6 nodes, corresponds respectively to publication, book, title, book number, these 6 elements of author and name.Because publication does not have father's element, it becomes root node.Between publication and book, there is father and son's element relation, so in the DTD tree, book is the child nodes of publication.Since book can be below publication repeatedly occur (by "
*" mark), so have on the limit from the publication to the book label "
*".Similarly, from this node of book the limit of pointing to title, book number and author is arranged; Between author and name, also there is a limit.
XSLT converse routine in the example 1 has 5 transformation rules.Article one, the pattern of rule is "/", will mate root node (node of promptly representing publication).Its output template comprises three parts, and first is＜html〉＜head〉＜title〉Books Information＜/title〉＜/head〉and＜body〉＜table〉serial connection of two constant character strings; Second is the applying template order of calling the second pattern rule; The 3rd be the constant string＜/table＜/body＜/html.
On the basis of the DTD of Fig. 1 tree, in order to construct transition tree, increase by two constant string nodes, and they are connected with the publication node with dot-and-dash line.Because applying template order wherein will be chosen this node of book, so between publication and these two nodes of book, need to increase a dotted line limit.
To the second transformation rule, its match pattern is " book ", will mate the book node.Its output template comprises four parts, be respectively constant string＜tr〉＜td 〉, the applying template order of calling the 4th transformation rule, the constant string＜/td〉＜td〉＜table 〉, call the applying template order of the 3rd rule and constant string＜/table＜/td＜/tr.So, need to add two constant character string nodes, they are connected with the book node.In addition, also need be in book and title node, and increase the dotted line limit between book and the author's node and connect.
Three remaining transformation rules are similarly handled, finally can be obtained the transition tree among Fig. 2.
Set up the stream transaction module from transition tree below.
At first, start (publication), start (book), start (title), start (book number), start (author), start (name), end (publication), end (book), end (title), end (book number), end (author), the initial value of end (name) is sky.Setting up the stream transaction module is the process of a recurrence.From root node (being the publication node), because its first child is a constant string node, so add this constant string after the old value of start (publication), its new value is:＜html〉＜head〉＜title〉Books Information＜/title〉＜/head〉＜body〉＜table 〉.
The 4th child of root node also is a constant string, so revise the value of end (publication) is:＜/table〉＜/body〉＜/html 〉.
Next the book node being carried out recurrence handles.Its first child is a constant string node, so will add this constant string after the old value of start (book), amended new value is＜tr〉＜td 〉.The 3rd child nodes of book node also is a constant string, second child is title node, the 4th child is the book number node, and all only occur once, so after the old value of end (title), add the constant string＜/td＜td＜table, the leaf values (representing) that amended new value is a title node and the splicing of this constant string with PCDATA.Last child of book node is a constant, so revise end (book) and be＜/table〉＜/td〉＜/tr 〉.
The book node is not by any applying template command calls; So it can not handled by recurrence.Next system continues to handle author's node; And its first child is the constant string; So revise start (author) is＜tr〉＜td〉.The 3rd child of author's node is the constant string; So this constant string is appended to the back of end (name); obtains the splicing of end （ name ） for the leaf values of name node and this constant string.Because need not deal with again， so program fair termination to the name node.：start （ ） ＝"＜html〉＜head〉＜title〉Books Information＜／title〉＜／head〉＜body〉＜table〉"end （ ） ＝"＜／table〉＜／body〉＜／html〉"start （ ） ＝"＜tr〉＜td〉"end （ ） ＝"＜／table〉＜／td〉＜／tr〉"end （ ） ＝"＜／td〉＜td〉＜table〉"begin （ ） ＝"＜tr〉＜td〉"end （ ） ＝"＜／td〉＜／tr〉"。
Given XML source document is following, and (left-hand digit does not belong to document content; Be used for representing line number; With convenient narration), 01＜publication〉02＜book〉03＜title〉Java Handbook＜/title〉04＜isbn〉1234-5678＜/isbn〉05＜author〉06＜name〉Mary Fernandez＜/name〉07＜/author〉08＜author〉09＜name〉Michael Kay＜/name〉10＜/author〉11＜/book〉12＜book〉13＜title〉XSLT Programmer ' s Reference＜/title〉14＜isbn〉1234-3134-x＜/isbn〉15＜author〉16＜name〉Michael Kay＜/name〉17＜/author〉18＜/book〉19＜/publication 〉
The document is scanned; When scanning the 1st row; Discovery is the beginning of publication element; Finds corresponding output segment in the stream transaction module; So output＜html〉＜head〉＜title〉Books Information＜/title〉＜/head〉＜body〉＜table〉.Scan the 2nd row; Discovery is the beginning of book element; So output＜tr〉＜td〉.Scan the 3rd the row; Export the output segment Java Handbook corresponding with end (title)＜/td＜td＜table.Here the leaf values of tltle is specialized with Java Handbook.Scan the 4th row; Do not do any processing.Scanning the 5th row; Is the beginning of author's element; So output＜tr〉＜td〉.Scan the 6th row; Output Mary Fernandez＜/td〉＜/tr〉.It is capable to scan 6-17; Carries out similar processing.Scan the 18th row; The book element finishes; Thus output＜/table〉＜/td〉＜/tr〉.Scan the 19th row; The publication element finishes; output＜／table〉＜／body〉＜／html 〉.，：＜html〉＜head〉＜title〉Books Information＜／title〉＜／head〉＜body〉＜table〉＜tr〉＜td〉Java Handbook＜／td〉＜td〉＜table〉＜tr〉＜td〉Mary Fernandez＜／td〉＜／tr〉＜tr〉＜td〉Michael Kay＜／td〉＜／tr〉＜／table〉＜／td〉＜／tr〉＜tr〉＜td〉XSLT Programmer’s Reference＜／td〉＜td〉＜table〉＜tr〉＜td〉Michael Kay＜／td〉＜／tr〉＜／table〉＜／td〉＜／tr〉＜／table〉＜／body〉＜／html〉。
Claims (1)
1, a kind of method of quick execution XSLT conversion is characterized in that carrying out the XSLT conversion by a stream transaction module, and concrete steps are as follows:
(1) at first by the structure transition tree, the structural information of XML source document and XSLT conversion are required to combine, the steps include: to construct the DTD tree T of XML document type definition; Investigate each bar transformation rule r of XSLT converse routine L, in T, find the matched node n of r; Continue to investigate each the element o in the output template sequence of r, if o is a constant character string, T creates a leaf node n ' for tree, adds one from n to n ' the limit; If o calls template command, choose node n ' from what tree was found o the T, add one equally from n to n ' the limit;
(2) set up the stream transaction module from transition tree, it is a recursive procedure, the steps include: the arbitrary node n to transition tree, end (n), and start (n) initial value is an empty string; If n is a leaf node, then make end (n) :=pcdata+end (n); With c
1, c
2..., c
pAll come from the child nodes of DTD tree below the expression node n, with d
1, d
2..., d
qAll come from the child nodes of XSLT converse routine below the expression node n, if d
1Be a constant character string node, then make start (n) :=start (n)+d
1, and counter i is set is 2, otherwise it is 1 that counter i is set; When i is not more than q, repeat following steps: suppose that c is positioned at from node n to node d
iThe child nodes of n on this paths, if the limit from n to c not by the asterisk mark, and d
I+1Be constant string node, then make end (c) :=end (c)+d
I+1And i:=i+2, otherwise make i:=i+1; If d
I+1Be constant string node, suppose that c ' is positioned at from node n to node d
I+2The child nodes of n on this paths then makes start (c ') :=d
I+1+ start (c ') and i:=i+2, otherwise make i:=i+1; To each child nodes d
j, the above process of recursive call;
(3) scanning XLM source document by the stream transaction module, changes into a lot of event handlers with an XSLT converse routine; In reading the process that XML gets source document from the beginning to the end, can trigger a lot of incidents,, the output segment of a correspondence be arranged all each class incident; The most at first, result document is empty, and along with the carrying out to the scanning process of source document, the output segment of corresponding event is added to the back of the result document that has produced gradually; After scanning process finished, the user just can obtain final complete results document at once;
Wherein, end (n) is the output fragment of element End Event, and start (n) begins the output fragment of incident for element, and pcdata is the PCDATA value of current leaf node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100992747A CN100557601C (en) | 2004-12-29 | 2004-12-29 | But a kind of method of quick execution extensible stylesheet Formad lanaguage conversion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100992747A CN100557601C (en) | 2004-12-29 | 2004-12-29 | But a kind of method of quick execution extensible stylesheet Formad lanaguage conversion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1632784A true CN1632784A (en) | 2005-06-29 |
| CN100557601C CN100557601C (en) | 2009-11-04 |
Family
ID=34848015
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100992747A Expired - Fee Related CN100557601C (en) | 2004-12-29 | 2004-12-29 | But a kind of method of quick execution extensible stylesheet Formad lanaguage conversion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100557601C (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101039185B (en) * | 2007-04-29 | 2010-05-26 | 清华大学 | Method for resolving expandable label language in safety application of expandable label language |
| CN101609463B (en) * | 2009-08-04 | 2011-04-20 | 北京环太中科软件股份有限公司 | Method for establishing data conversion relation among notes and method for data migration among notes |
| CN101350007B (en) * | 2007-06-26 | 2011-12-14 | 英特尔公司 | Method and apparatus for parallel XSL transformation with low contention and load balancing |
| CN101154239B (en) * | 2006-09-29 | 2012-06-20 | 株式会社东芝 | System and method for transforming tabular form date into structured document |
-
2004
- 2004-12-29 CN CNB2004100992747A patent/CN100557601C/en not_active Expired - Fee Related
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101154239B (en) * | 2006-09-29 | 2012-06-20 | 株式会社东芝 | System and method for transforming tabular form date into structured document |
| CN101039185B (en) * | 2007-04-29 | 2010-05-26 | 清华大学 | Method for resolving expandable label language in safety application of expandable label language |
| CN101350007B (en) * | 2007-06-26 | 2011-12-14 | 英特尔公司 | Method and apparatus for parallel XSL transformation with low contention and load balancing |
| CN101609463B (en) * | 2009-08-04 | 2011-04-20 | 北京环太中科软件股份有限公司 | Method for establishing data conversion relation among notes and method for data migration among notes |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100557601C (en) | 2009-11-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7634515B2 (en) | Data model and schema evolution | |
| Buneman et al. | Programming constructs for unstructured data | |
| US7043487B2 (en) | Method for storing XML documents in a relational database system while exploiting XML schema | |
| Bruggemann-Klein et al. | Regular tree and regular hedge languages over unranked alphabets | |
| Al-Ekram et al. | diffX: an algorithm to detect changes in multi-version XML documents | |
| US20040210573A1 (en) | Method, system and program for generating structure pattern candidates | |
| US20050138052A1 (en) | Method, computer program product, and system converting relational data into hierarchical data structure based upon tagging trees | |
| JP2004530225A (en) | System and method for mapping between software objects and document-based structured language elements | |
| US7409636B2 (en) | Lightweight application program interface (API) for extensible markup language (XML) | |
| JP2002533842A (en) | Query processing method | |
| CN114547619B (en) | Vulnerability restoration system and restoration method based on tree | |
| Gardner et al. | XSLT and XPATH: a Guide to XML Transformations | |
| CN100397397C (en) | XML data storage and access method based on relational database | |
| JP4796108B2 (en) | Structured document retrieval apparatus, method and program | |
| CN1632784A (en) | Method for quick executing XSLT | |
| JP2002534741A (en) | Method and apparatus for processing semi-structured text data | |
| JP2008165403A (en) | Processing method and processing program for xml document | |
| CN1564161A (en) | Method of constituting and browsing semantic links | |
| CN1484174A (en) | Universal inquiry statement dynamic generation system and method | |
| Han et al. | RDF123: a mechanism to transform spreadsheets to RDF | |
| Al-Wasil et al. | Establishing an XML metadata klnowledge base to assist integration of structured and semi-structured databases | |
| JP2003140960A (en) | Data conversion method and program for xml data | |
| Takasu et al. | A rule learning method for academic document image processing | |
| Ahmed | Resource capability discovery and description management system for bioinformatics data and service integration-an experiment with gene regulatory networks | |
| Vercoustre et al. | Reuse of linked documents through virtual document prescriptions |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20091104 Termination date: 20121229 |