CN1704932A - Extendible marked language key constraint verification method based on structural analysis - Google Patents

Extendible marked language key constraint verification method based on structural analysis Download PDF

Info

Publication number
CN1704932A
CN1704932A CN 200410042943 CN200410042943A CN1704932A CN 1704932 A CN1704932 A CN 1704932A CN 200410042943 CN200410042943 CN 200410042943 CN 200410042943 A CN200410042943 A CN 200410042943A CN 1704932 A CN1704932 A CN 1704932A
Authority
CN
China
Prior art keywords
key
document
constraint
value
path
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
Application number
CN 200410042943
Other languages
Chinese (zh)
Other versions
CN100347702C (en
Inventor
王腾蛟
杨冬青
唐世渭
刘云峰
高军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Peking University
Original Assignee
Peking University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Peking University filed Critical Peking University
Priority to CNB2004100429437A priority Critical patent/CN100347702C/en
Publication of CN1704932A publication Critical patent/CN1704932A/en
Application granted granted Critical
Publication of CN100347702C publication Critical patent/CN100347702C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

This invention discloses a key restriction verification method for scalable tag language keys based on the structure analysis including extracting the key value in XML document to generate key value document based on the input verified XML documents and the key restriction, examining if the key value document meets the structure restriction of DTD, if so, the being verified XML document meets the defined key restriction, otherwise the XML document does not meet the key restriction.

Description

Extend markup language key constraint verification method based on structure analysis
Technical field
The present invention relates to a kind of expandable mark language XML (eXtensible Markup Language) key constraint verification method; Relate in particular to a kind of XML document verification method, belong to the data management technique field towards XML pattern (XML Schema) key constraint.
Background technology
XML has been widely used in the exchanges data on the Internet.And the data representation on the Internet and the de facto standard of exchange have been become.The increasing application system of applications such as present telecommunications both domestic and external, finance, medical treatment, ecommerce, journalism adopts XML as the standard format swap data.
In the data exchange process based on XML, the XML data not only comprise element type information, also comprise semantic information.Because XML pattern (being called for short XML Schema) has become the standard of describing XML data structure and constraint, and support the key constraint of XML among the XML Schema, therefore, in the data exchange process based on XML, the XML data should be deferred to the requirement of XML Schema, should satisfy structural constraint, satisfy constraint semantically again.
The validating parser of present most of XML document or instrument can't be supported the checking of consistency constraint in the XML Schema standard fully.
Although the definition of the key constraint among the XML Schema provides, how to verify the problem that these constraints still do not obtain, so, set up effective verification system (Validator) and be faced with some problems:
1, be different from relational database, the XML key is not local, might spread in the entire document;
2, key can define in a specific upper and lower civilian environment;
3, an element can have a plurality of key constraints, or appears in document on the different levels.
In general, set up the simplest strategy of verification system and be to use SAX (Simple API forXML, XML simple application routine interface) or DOM (Document Object Model, DOM Document Object Model) exploitation is as Microsoft XML Parser 4.0 (MSXML), XML Schema Validator (XSV) etc.; But these systems can not support the key constraint among the XML Schema fully.
Document [XKvalidator:A constraint validator for XML, CIKM 2002] proposes to set up the key index structure for the key of all definition when analyzing XML file.On XML document, use a SAX resolver and one group of finite-state automata (DFAs:Deterministic Finite Automata) can create index through going over scanning; Automat can be discerned the context (Q) of an XML key K, destination node (Q ') and key path (P 1..., P p).The establishment and the file structure of automat are closely related, if file structure changes, then need to create again or safeguard automat, handle underaction.
Document [Tree Automata to Verify XML Key Constraints, WebDB03] utilizes the theory of tree automaton.Tree automaton (tree automata) can effectively description schemeization constraint.Yet, need the value of service data in order to verify key constraint.(tree automata) expands to tree automaton, uses the tree transducer (tree transducer) of bottom-up (bottom-up) to solve the problem of simultaneous verification pattern and key constraint; But this method once can only be verified a key.
From top analysis as can be seen, relevant XML key constraint verification system and the instrument that exists can not be supported the key constraint among the XML Schema mostly fully at present; Even the method for the key constraint among the minority support XML Schema also all needs to develop proprietary key constraint verification system, cost is very high.
Summary of the invention
Technical matters to be solved by this invention is: provide a kind of based on the XML document verification method towards XML Schema key constraint, guarantee correctness and integrality based on data in the data exchange process of XML.
Extend markup language key constraint verification method based on structure analysis of the present invention comprises the steps:
Step 1, according to the XML document to be verified and the key constraint definition information of input, the DOM analytic tree file of creating XML document is gone forward side by side one one and is resolved corresponding key constraint;
Step 2, the key assignments that extracts in the XML document generate the key assignments document, and create the information of the needed auxiliary element of confirmation of secretarial document in the key assignments document;
Whether step 3, inspection key assignments document satisfy key assignments document D TD, if satisfy, XML document then to be verified satisfies key constraint; Otherwise this XML document to be verified does not satisfy key constraint.
The present invention proposes the method based on the XML key constraint checking of structure analysis, extracts by the key assignments based on XPath, and according to key constraint, automatically the key assignments in the XML document is extracted, and create the key assignments document according to key assignments document create-rule; Guaranteed that any XML data management system with structure verification can the application of the invention, key constraint be converted into structure verification of equal value automatically solve that whole transfer process full automation is without any need for manual intervention.
The present invention can be widely used under the current network environment each application system based on the data exchange process of XML, has satisfied Internet and has gone up between each application system based on the demand of XML exchanges data, has broad application prospects.
Description of drawings
Fig. 1 is an overall flow synoptic diagram of the present invention;
Fig. 2 is a treatment scheme synoptic diagram of the present invention;
Fig. 3 is the partial data of an XML document to be verified, uses tree represenation.
Fig. 4 is the partial data of another XML document to be verified, uses tree represenation.
Embodiment
The present invention be directed to each application system under the current network environment based on the demand that keeps the data semantic correctness in the exchanges data of XML, and a kind of XML key constraint verification method based on structure analysis that proposes.The main thought of technical scheme of the present invention is, with XML document and key constraint as input, use based on the key assignments extraction technique of XPath and create the key assignments document, utilize the key assignments document D TD (DTD (Document Type Definition) that designs according to XML key definition form then, Document Type Definition) checking, whether the XML document of analyzing input satisfies the requirement of XML Schema key constraint.
The inventive method is specific as follows:
Referring to Fig. 1,2, according to key constraint among the XML Schema, utilize the key assignments in the XPath inquiring technology extraction XML document, generate the key assignments document according to rule, and create key assignments document D TD (DTD (Document Type Definition), Document Type Definition); Then, whether satisfy key assignments document D TD by the key assignments document of checking former XML document and verify whether former XML document satisfies the key constraint of XML Schema.
The present invention utilizes key constraint to extract key assignments in the XML document, sets up the key assignments document, checks whether XML document satisfies the problem of given DTD structural constraint thereby dexterously the validation problem of key constraint is converted into one; Because the current constraint inspection that has had ripe microcomputer data processing can support the DTD structure, therefore, as long as the XML key uses XPath to express, the checking of key constraint just can be finished by the inspection of XPath inquiry and structural constraint.
Since check whether the key assignments document satisfies key assignments document D TD and can utilize the verification tool of existing structural constraint to finish, thus the key assignments in the XPath inquiring technology extraction XML document utilized, and generation key assignments document is the key issue of the technical program.
As shown in Figure 1 and Figure 2, specifically, technical scheme of the present invention comprises the steps:
Step 1, according to the XML document to be verified and the key constraint definition information of input, create DOM (DOM Document Object Model, the Document Object Model) resolution file of XML document, go forward side by side one one and resolve corresponding key constraint;
Step 2, the key assignments that extracts in the XML document generate the key assignments document, and create the information of the needed auxiliary element of confirmation of secretarial document in the key assignments document;
Whether step 3, inspection key assignments document satisfy key assignments document D TD, if satisfy, XML document then to be verified satisfies key constraint; Otherwise this XML document to be verified does not satisfy key constraint.
In the step 1 of the present invention, those skilled in the art can adopt common means to set up the DOM analytic tree fully, for example: use existing XML resolver; Comprise and resolve given key constraint operation: analyze each key constraint, its context, destination node, key path part are represented with XPath respectively.
In the step 2 of the present invention, be specifically as follows: on dom tree,, create the key assignments document with each key of XPath query processing; And the while generates the information of the auxiliary element of this key in the key assignments document.Specifically comprise: find the context node in all key constraints, each context node is extracted key assignments in its each key path; To each key assignments, extract corresponding destination node, create the key assignments document; Generate the required auxiliary element node of checking simultaneously.
In the step 2 of the present invention, set up the key assignments document, specifically comprise according to key assignments document create-rule:
Suppose that key constraint is: K i=(C, (T, { P 1..., P p))), wherein, K iRepresent a key constraint, C represents context, T presentation selector, P jExpression key path, the key path has many: 1≤j≤p, j represent the sequence number in key path:
Step 200: create empty key assignments document, and increase root element XMLKeys therein, what expression was write down is the information of key constraint; Then, each key of circular treatment generates the counterpart of each key in the key assignments document;
Step 201, key constraint of every appearance increase an element in root element, its element tags is made as Key, and this element representation writes down the information of this key, and attribute is made as KID, the processing sequence of expression key constraint, and the value of attribute is the sequence number of key;
Step 202, carry out the XPath of context node path part (C part) in this key constraint, if non-NULL, be to increase an element in the element of Key then at element tags, this element tags is made as ContextNode, attribute is made as CID, the value of attribute belongs to carries out node corresponding sequence number collection on the dom tree that XPath C returns, and this sequence number collection is designated as C_Set;
Step 203, to the value c among each C_Set (c represents a context node), extract the value in each key path of part, key path; Key path of every processing, at element tags is that to increase element tags in the element of ContextNode be the element of Field, and an attribute of this element is designated as Number, and its value is the key path sequence number, another attribute of element is designated as Value, and its value is the value in this key path;
Step 204, extract corresponding c, key path sequence number be i, key assignments is the destination node collection of v, this destination node collection is designated as S_Set, each value s (destination node) among the S_Set is created a element in the element that element tags is Field, this element tags is Selector, element tags is that the value of the element of Selector is s, i.e. the element sequence number of destination node.
Value c among each C_Set is obtained supplementary in the XML document, comprise the steps:
All Field elements have the common factor of the destination node collection of identical Value property value in step 210, the calculating ContextNode node;
If step 211 common factor number is greater than 1, in the key Key element of pre-treatment, creating daughter element Selector_ShareKeyValue, promptly under the same context node of this nodes records, to the destination node collection of the shared same key assignments in key paths all in this key, the Selector_ShareKeyValue node element is the supplementary whether identifying file meets the key constraint definition.
Be the element in the record common factor, in Selector_ShareKeyValue, create Intersection element (this element is used to write down the relevant information that destination node that each key path key assignments all equates occurs simultaneously), and further in Intersection, create F_path daughter element (being used for record common factor key routing information); F_path has two attribute: Number and Value, and value is respectively the sequence number in key path, the corresponding key assignments of corresponding each sequence number.In the Intersection element, also to create S_Node element (being used to represent the element of destination node), be used for writing down the element sequence number value of current common factor destination node.
Step 212:, continue to handle next element among the C_Set, up to handling all elements if the common factor number less than 1, is not then carried out any processing.
XML document to be verified is set up the key assignments document according to the above-mentioned create-rule of key assignments document, and the content of key assignments document is to determine according to the XML document content of the definition of key and needs checking.
In the step 3 of the present invention, as follows in the key assignments document D TD of checking according to the definition form design specialized of XML key constraint:
<！DOCTYPE?XMLKeys[
<！ELEMENT?Key(ContextNode+，Selector_ShareKeyValue*)>
<！ATTLIST?Key?KID?CDATA?#REQUIRED>
<！ELEMENT?ContextNode(Field*>
<！ATTLIST?ContextNode?CID?CDATA?#REQUIRED>
<！ELEMENT?Field(Selector+)>
<！ATTLIST?Field
Number?CDATA?#REQUIRED
Value?CDATA?#REQUIRED>
<！ELEMENT?Selector(#PCDATA)>
<！ELEMENT?Selector_ShareKeyValue(Intersection*)>
<！ELEMENT?Intersection(F_Path+，S_Node)>
<！ELEMENT?S_Node(#PCDATA)>
<！ATTLIST?F_Path
Number?CDATA?#REQUIRED
Value?CDATA?#REQUIRED>
]>
The pattern information that the key assignments document that this DTD represents to set up is deferred to is stipulated the content that can appear in the key assignments document.If the key assignments document meets the structural constraint of this DTD, then be legal XML document, illustrate that former XML document satisfies key constraint, otherwise illustrate that former XML document does not satisfy key constraint.
Selector_ShareKeyValue node element wherein is the supplementary whether identifying file meets key constraint.By calculating the related data in the ContextNode node, under the same context node of this nodes records, all key paths are shared the destination node collection of same key assignments.
In the step 3 of the present invention, be the problem that prior art has solved for the inspection of the structural constraint of document, for example the XML analyzer all has one group of self-defining characteristic or attribute to be used for control function.Can set the value of attribute and open the DTD authentication function in resolver, whether meet all constraints described in the DTD to judge example, whether all element and the attribute of proof procedure in can test case meets corresponding dtd.This also is the reason that the present invention changes into key constraint the DTD check problem.
Whether the key assignments document of checking former XML document according to key assignments document D TD is effective.Utilize prior art can realize checking whether XML document satisfies the structural constraint of DTD, if do not satisfy, the source XML document does not satisfy given key constraint; Otherwise the source XML document satisfies key constraint.
There has been the support of XML resolver whether effective at present with DTD verifying XML document example, so any XML data management system with structure verification, can be by using present technique, key constraint is converted into structure verification of equal value automatically, thereby reaches the purpose of quick verifying XML document key constraint., below by two concrete examples, further specify technical scheme of the present invention.
Fig. 3 is an XML document that needs are verified, represents with tree structure, supposes that the key constraint that document need defer to is as follows:
KS 1：(/，(./corporation，{./@ID}))
KS 2：(/corporation，(./section，{./name}))
KS 3：(/，(//mgr，{./name，./tel}))
According to rule, from former XML document, extract the relevant portion of each key by the XPath of the intrafascicular approximately correspondence of execute key, the main contents that make up the key assignments document are as follows:
<XMLKeys> ?<Key?KID＝1> <ContextNode?CID＝1> <Field?Number＝1?Value＝06> <Selector>2</Selector> </Field> <Field?Number＝1?Value＝32> <Selector>80</Selector> </Field> </ContextNode> ?</Key> ?<Key?KID＝2> <ContextNode?CID＝2> <Field?Number＝1?Value＝“CS”> <Selector>7</Selector> </Field> <Field?Number＝1?Value＝“Bio”> <Selector>15</Selector> </Field> </ContextNode> <ContextNode?CID＝80> <Field?Number＝1?Value＝”Geo”> <Selector>85</Selector> </Field> </ContextNode> ?</Key> <Key?KID＝3> <ContextNode CID＝1> <Field?Number＝1?Value＝“Tom”> <Selector>4</Selector> <Selector>87</Selector> </Field> <Field?Number＝1?Value＝“Lee”> <Selector>9</Selector> </Field> <Field?Number＝1?Value＝“Rose”> <Selector>17</Selector> </Field> <Field?Number＝2?Value＝3001> <Selector>4</Selector> </Field> <Field?Number＝2?Value＝6600> <Selector>9</Selector> <Selector>17</Selector> </Field> <Field?Number＝2?Value＝5000> <Selector>87</Selector> </Field> </ContextNode> </Key> ?</XMLKeys>
Utilize existing XML analyzer that the key assignments document that generates is verified that with key assignments document D TD above-mentioned XML document meets the DTD structure, so former XML document satisfies the XML key constraint with structure verification function.
Be the example of the partial data of another XML document as shown in Figure 4,, comprise following a part of content in the key assignments document according to key assignments document create-rule:
<Key?KID＝3> <ContextNode?CID＝1>
<Field?Number＝1?Value＝“Tom”> <Selector>4</Selector> <Selector>87</Selector> </Field> <Field?Number＝1?Value＝“Lee”> <Selector>9</Selector> </Field> <Field?Number＝1?Value＝“Rose”> <Selector>17</Selector> </Field> <Field?Number＝2?Value＝3001> <Selector>4</Selector> <Selector>87</Selector> </Field> <Field?Number＝2?Value＝6600> <Selector>9</Selector> <Selector>17</Selector> </Field> </ContextNode> <Selector?ShareKeyValue> <Intersection> <F_path?Number＝1?Value＝”Tom”/> <F_path?Number＝2?Value＝”3001”/> <S_Node>4</S_Node> <S_Node>87</S_Node> </Intersection> </Selector_ShareKeyValue> </Key>
Supplementary＜Selector_ShareKeyValue〉in the element, intersection unit have a plurality of S_Node daughter elements, and promptly same key assignments is all shared in each bar key path of 4 and 87 nodes, and therefore, the key assignments document does not meet the constraint of key assignments document D TD.Thereby do not meet the definition of key constraint.So reach a conclusion: XML document does not satisfy K 3Constraint.
The present invention is used for the structure verification mechanism of key constraint checking, has guaranteed any XML data management system with structure verification, can the application of the invention, and key constraint is converted into structure verification of equal value automatically solves.Thereby reach the purpose of quick verifying XML document key constraint.
It should be noted last that: above embodiment is the unrestricted technical scheme of the present invention in order to explanation only, although the present invention is had been described in detail with reference to the foregoing description, those of ordinary skill in the art is to be understood that: still can make amendment or be equal to replacement the present invention, and not breaking away from any modification or partial replacement of the spirit and scope of the present invention, it all should be encompassed in the middle of the claim scope of the present invention.

Claims (9)

1, a kind of extend markup language key constraint verification method based on structure analysis is characterized in that: comprise the steps:
Step 1, according to the XML document to be verified and the key constraint definition information of input, create the DOM analytic tree file of XML document and further resolve corresponding key constraint;
Step 2, the key assignments that extracts in the XML document generate the key assignments document, and create the information of the needed auxiliary element of confirmation of secretarial document in the key assignments document;
Whether step 3, inspection key assignments document satisfy key assignments document D TD, if satisfy, XML document then to be verified satisfies key constraint; Otherwise this XML document to be verified does not satisfy key constraint.
2, the extend markup language key constraint verification method based on structure analysis according to claim 1, it is characterized in that: in the described step 1, the concrete operations of resolving key constraint are: analyze each key constraint, its context, destination node, key path part are represented with XPath respectively.
3, the extend markup language key constraint verification method based on structure analysis according to claim 1 is characterized in that: in the described step 2, be specifically as follows: with each key of XPath query processing, create corresponding key assignments document on dom tree; And the while generates the information of the auxiliary element of this key in the key assignments document.
4, the extend markup language key constraint verification method based on structure analysis according to claim 3, it is characterized in that: in the described step 2, be specifically as follows: on dom tree, inquire about with XPath, find the context node in all key constraints, each context node is extracted key assignments in its each key path; To each key assignments, extract corresponding destination node, create corresponding key assignments document; Generate the required auxiliary element node of checking simultaneously.
5, the extend markup language key constraint verification method based on structure analysis according to claim 4 is characterized in that: in the described step 2, set up the key assignments document, specifically comprise:
Suppose that key constraint is: K i=(C, (T, { P 1..., P p)), wherein, K iRepresent a key constraint, C represents context, T presentation selector, P jExpression key path, the key path has many: 1≤j≤p, the sequence number in expression key path:
Step 200, the empty key assignments document of establishment, and increase root element XMLKeys therein, what expression was write down is the information of key constraint; Then, each key of circular treatment generates the counterpart of each key in the key assignments document;
Step 201, key constraint of every appearance increase an element in root element, its element tags is made as Key, and this element representation writes down the information of this key, and attribute is made as KID, the processing sequence of expression key constraint, and the value of attribute is the sequence number of key;
Step 202, carry out the XPath of context node path part in this key constraint, if non-NULL, be to increase an element in the element of Key then at element tags, this element tags is made as ContextNode, attribute is made as CID, the value of attribute belongs to carries out node corresponding sequence number collection on the dom tree that XPath C returns, and this sequence number collection is designated as C_Set;
Step 203:, extract the value in each key path of part, key path to the context node value among each C_Set; Key path of every processing, at element tags is that to increase element tags in the element of ContextNode be the element of Field, and an attribute of this element is designated as Number, and its value is the key path sequence number, another attribute of element is designated as Value, and its value is the value in this key path;
Step 204: extract corresponding context node value, key path sequence number and be i, key assignments is the destination node collection of v, this destination node collection is designated as S_Set, each destination node value among the S_Set is created a element in the element that element tags is Field, this element tags is Selector, element tags is that the value of the element of Selector is the destination node value, i.e. the element sequence number of destination node.
6, the extend markup language key constraint verification method based on structure analysis according to claim 5, it is characterized in that: in the described step 2, obtain the supplementary in the XML document, the value c among each C_Set comprises the steps:
Step 210, to calculate all elements label in the node element that element tags is ContextNode be the common factor that the element of Field has the destination node collection of identical Value property value;
If step 211 common factor number is greater than 1, be the daughter element of Selector_ShareKeyValue then in the key Key element of pre-treatment, creating element tags, promptly under the same context node of this nodes records, to the destination node collection of all shared same key assignments in key path of this key, described Selector_ShareKeyValue node element is the supplementary whether identifying file meets key constraint;
If step 212 common factor number less than 1, is not then carried out any processing, continue to handle next element among the C_Set, up to handling all elements.
7, the extend markup language key constraint verification method based on structure analysis according to claim 6, it is characterized in that: comprise at least among the described Selector_ShareKeyValue: the Intersection element, be used for writing down the information of common factor, and further in Intersection, create the F_path daughter element; Two attribute: the Number of F_path and Value, value is respectively the corresponding key assignments of sequence number and corresponding each sequence number in key path.
8, the extend markup language key constraint verification method based on structure analysis according to claim 7 is characterized in that: comprise at least in Intersection: the S_Node element is used for writing down the element sequence number value of current common factor destination node.
9, the extend markup language key constraint verification method based on structure analysis according to claim 1, it is characterized in that: described step 3, check whether XML document satisfies the structural constraint of DTD, be specially in having the XML schema processor of authentication function and open the DTD authentication function, check whether the key assignments document meets the structural constraint of key assignments document D TD, if do not meet, XML document then to be tested does not satisfy given key constraint; Otherwise XML document to be tested satisfies key constraint.
CNB2004100429437A 2004-06-01 2004-06-01 Extendible marked language key constraint verification method based on structural analysis Expired - Fee Related CN100347702C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2004100429437A CN100347702C (en) 2004-06-01 2004-06-01 Extendible marked language key constraint verification method based on structural analysis

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2004100429437A CN100347702C (en) 2004-06-01 2004-06-01 Extendible marked language key constraint verification method based on structural analysis

Publications (2)

Publication Number Publication Date
CN1704932A true CN1704932A (en) 2005-12-07
CN100347702C CN100347702C (en) 2007-11-07

Family

ID=35577252

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2004100429437A Expired - Fee Related CN100347702C (en) 2004-06-01 2004-06-01 Extendible marked language key constraint verification method based on structural analysis

Country Status (1)

Country Link
CN (1) CN100347702C (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101971176A (en) * 2009-05-20 2011-02-09 甲骨文国际公司 Type system for building extensible business applications
CN103049544A (en) * 2012-12-27 2013-04-17 南京新与力文化传播有限公司 Interactive digital document format realizing method based on NXML (newpower extensible markup language)
US9146908B2 (en) 2008-07-24 2015-09-29 International Business Machines Corporation Validating an XML document
US9582488B2 (en) 2010-05-18 2017-02-28 Oracle International Corporation Techniques for validating hierarchically structured data containing open content
CN109241501A (en) * 2018-08-15 2019-01-18 北京北信源信息安全技术有限公司 Document analysis method and apparatus

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7054857B2 (en) * 2002-05-08 2006-05-30 Overture Services, Inc. Use of extensible markup language in a system and method for influencing a position on a search result list generated by a computer network search engine

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9146908B2 (en) 2008-07-24 2015-09-29 International Business Machines Corporation Validating an XML document
US10372809B2 (en) 2008-07-24 2019-08-06 International Business Machines Corporation Validating an XML document
US10915703B2 (en) 2008-07-24 2021-02-09 International Business Machines Corporation Validating an XML document
US10929598B2 (en) 2008-07-24 2021-02-23 International Business Machines Corporation Validating an XML document
CN101971176A (en) * 2009-05-20 2011-02-09 甲骨文国际公司 Type system for building extensible business applications
US8473506B2 (en) 2009-05-20 2013-06-25 Oracle International Corporation Type system for building extensible business applications
CN101971176B (en) * 2009-05-20 2014-04-30 甲骨文国际公司 Type system for building extensible business applications
US9582488B2 (en) 2010-05-18 2017-02-28 Oracle International Corporation Techniques for validating hierarchically structured data containing open content
CN103049544A (en) * 2012-12-27 2013-04-17 南京新与力文化传播有限公司 Interactive digital document format realizing method based on NXML (newpower extensible markup language)
CN109241501A (en) * 2018-08-15 2019-01-18 北京北信源信息安全技术有限公司 Document analysis method and apparatus

Also Published As

Publication number Publication date
CN100347702C (en) 2007-11-07

Similar Documents

Publication Publication Date Title
Balmin et al. Incremental validation of XML documents
US7587415B2 (en) Single-pass translation of flat-file documents into XML format including validation, ambiguity resolution, and acknowledgement generation
US7398265B2 (en) Efficient query processing of XML data using XML index
US7941420B2 (en) Method for organizing structurally similar web pages from a web site
US7630993B2 (en) Generating database schemas for relational and markup language data from a conceptual model
US8892599B2 (en) Apparatus and method for securing preliminary information about database fragments for utilization in mapreduce processing
CN1297936C (en) Method and system for comparing files of two computers
CN100337227C (en) Methods and apparatus for summarizing document content for mobile communication devices
US7467149B2 (en) Complex syntax validation and business logic validation rules, using VAXs (value-added XSDs) compliant with W3C-XML schema specification
US20070112851A1 (en) Partial XML validation
US20060242563A1 (en) Optimizing XSLT based on input XML document structure description and translating XSLT into equivalent XQuery expressions
CN1906609A (en) System for data format conversion for use in data centers
US20120310868A1 (en) Method and system for extracting and managing information contained in electronic documents
US20040103124A1 (en) Hierarchical differential document representative of changes between versions of hierarchical document
US20080172408A1 (en) Converting Recursive Hierarchical Data to Relational Data
CN102043808B (en) Method and equipment for extracting bilingual terms using webpage structure
CN105868204A (en) Method and apparatus for converting script language SQL of Oracle
CN107315771A (en) A kind of data collection system customization method based on expanding library table data dictionary
CA2657418A1 (en) Joint optimization of wrapper generation and template detection
CN101661481A (en) XML data storing method, method and device thereof for executing XML query
CN112860727A (en) Data query method, device, equipment and medium based on big data query engine
CN102073662B (en) Method and system for analyzing and creating XML (Extensible Markup Language) data
CN1645372A (en) Universal constraining realizing method for real-time internal memory database
AU2007275507C1 (en) Semantic aware processing of XML documents
CN115840589A (en) Publishing method supporting heterogeneous distributed database

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: 20071107

Termination date: 20130601