JP5235545B2 - Schema conversion device, program, and schema generation method - Google Patents

Description

  The present invention relates to a technique for generating a schema document.

  XML (Extensible Markup Language) is a typical language for describing structured documents, and a structured document described in XML is called an XML document.

  The constraints that an XML document should satisfy are usually defined by a schema document. The process of confirming that the XML document satisfies the constraint conditions defined in the schema document is called schema verification. In the schema verification, if the XML document satisfies the constraint condition of the schema document, it is determined that the XML document is valid for the schema document.

  In general, when designing a schema document, in many cases, the schema document is provided with generality for common use in a plurality of systems, or is provided with extensibility so that it can withstand future changes. A schema document designed in consideration of versatility and extensibility in this way may have too loose constraints for a specific system.

  Therefore, a schema document having versatility and extensibility may be used after being changed into a form suitable for a specific system. As a technique for supporting such a change of the schema document, there is, for example, Patent Document 1. Patent Document 1 discloses a technique for analyzing a schema document and presenting candidates for the change to the user when the constraint condition of the schema document can be changed to a stricter one.

JP 2007-265335 A

  Since the technique described in Patent Document 1 determines constraint condition change candidates based on information included in a schema document, the amount of information is small only with information included in the schema document, and an accurate change candidate may not be presented. is there.

  Therefore, in the technique described in Patent Document 1, there are many scenes in which the user has to check the presented change candidates and determine whether to change them, which places a heavy burden on the user.

  Therefore, an object of the present invention is to efficiently generate a schema with severe constraints.

  In order to solve the above problems, the present invention generates a more restrictive schema document by converting the constraint conditions included in the original schema into the most stringent constraint conditions for which the sample data can be judged valid. .

For example, the present invention is a schema conversion apparatus that generates a schema document, and obtains, for each element, the strictest constraint that can determine that an element included in sample data is valid as a conversion candidate; A process for generating the schema document by identifying the element declaration corresponding to the original schema from the original schema, and converting the constraint condition for the element in the element content of the identified element declaration into the constraint condition acquired as the conversion candidate; And a storage unit that stores, as conversion candidate information, an element declaration in the original schema, and the strictest constraint that can determine that the element included in the sample data is valid, the control unit Searches for the elements included in the sample data with depth priority, and the elements searched for in the order of return are considered to be valid. Newest constraint condition is obtained as a conversion candidate, and in the conversion candidate information, the strictest constraint condition that satisfies the constraint condition associated with the element declaration corresponding to the element included in the sample data and the acquired constraint condition And the constraint condition in the conversion candidate information is changed to the identified constraint condition .

  As described above, according to the present invention, a schema with severe constraints can be generated efficiently.

  FIG. 1 is a schematic diagram of a schema conversion apparatus 100 according to the first embodiment of the present invention.

  The schema conversion apparatus 100 includes a storage unit 110, a control unit 120, an input unit 130, an output unit 140, and a communication unit 150.

  The storage unit 110 includes a schema repository storage area 111, a setting information storage area 112, an original schema storage area 113, a sample data storage area 114, a restriction candidate information storage area 115, and a converted schema storage area 116. Prepare.

  The schema repository storage area 111 stores information for managing a schema document used in the schema conversion apparatus 100 and the schema document.

  For example, in the present embodiment, a schema document management table 111a as shown in FIG. 2 (schematic diagram of the schema document management table 111a), and a schema document (not shown) managed by the schema document management table 111a Are stored in the schema repository storage area 111.

  As shown in FIG. 2, the schema document management table 111a includes an ID column 111b, a target namespace URI column 111c, and a location column 111d.

  The ID column 111b stores identification information (ID) for uniquely identifying each schema document managed by each record.

  The target namespace URI column 111c stores information for specifying the target namespace URI (Uniform Resource Identifiers) of the schema document stored in the schema repository storage area 111.

  The location column 111d stores information for specifying the location of the schema document stored in the schema repository storage area 111. Such a location can be described using, for example, a path or URL (Uniform Resource Locator) in the file system.

  Returning to FIG. 1, the setting information storage area 112 stores information that identifies items for which the change of the constraint condition is permitted for the original schema.

  For example, in the present embodiment, a setting information table 112a as shown in FIG. 3 (schematic diagram of the setting information table 112a) is stored in the setting information storage area 112.

  The setting information table 112a includes an ID column 112b, an element declaration ID column 112c, and a constraint type column 112d.

  The ID column 112b stores identification information (ID) for uniquely identifying items specified in each record.

  The element declaration ID column 112c stores an element declaration ID that is identification information for uniquely identifying an element declaration. Here, as described later, in the original schema 113a in the present embodiment, since all element declarations have different name attribute values, the value of the name attribute is used as the element declaration ID. For example, it is possible to specify by XPath or the like.

  The restriction condition type column 112d stores information for specifying the restriction condition type to be restricted.

  Returning to FIG. 1, the original schema storage area 113 stores an original schema that is a schema to be converted by the schema conversion apparatus 100.

  For example, in the present embodiment, an original schema 113 a as shown in FIG. 4 (schematic diagram of the original schema 113 a) is stored in the original schema storage area 113.

  The number at the left end in FIG. 4 is a memory for indicating the number of rows and does not constitute the original schema 113a.

  Here, the original schema 113a may be received by the operator of the schema conversion apparatus 100 via the input unit 130 or the like, or a schema document defined by an industry standard or the like is acquired and used. May be.

  In addition, the original schema may be described in WSDL (Web Services Description Language) that describes the interface of the Web service, or may be referenced from WSDL.

  Further, the original schema may be acquired from the schema repository storage area 111.

  The sample data storage area 114 stores sample data used when converting the original schema.

  For example, in this embodiment, sample data 114 a as shown in FIG. 5 (schematic diagram of sample data 114 a) is stored in the sample data storage area 114.

  The number at the left end in FIG. 5 is a memory for indicating the number of rows and does not constitute the sample data 114a.

  Here, for example, test data at the time of development may be used as the sample data 114a.

  Note that the number of sample data can be arbitrarily set.

  Returning to FIG. 1, in the restriction candidate information storage area 115, information specifying the items that impose a stricter restriction and the constraint conditions acquired from the sample data for each original schema is stored.

  For example, in the present embodiment, the first restriction candidate table 115a as shown in FIG. 6 (schematic diagram of the first restriction candidate table 115a) and the one shown in FIG. 7 (schematic diagram of the second restriction candidate table 115g). The second restriction candidate table 115g is stored in the restriction candidate information storage area 115 for each original schema.

  Here, the first restriction candidate table 115a stores information for specifying the restriction condition for restricting the text data of the element, and the second restriction candidate table 115g contains the restriction for restricting the child element of the element. Stores information for specifying the condition.

  The first restriction candidate table 115a and the second restriction candidate table 115g do not store information in the initial state, and the restriction candidate information update unit 124 described later analyzes sample data and the original schema. Information is stored.

  As shown in FIG. 6, the first restriction candidate table 115a includes an ID field 115b, an element declaration ID field 115c, a restriction condition type field 115d, and a restriction condition candidate field 115e.

  The ID column 115b stores identification information (ID) for identifying items specified in each record and constraint conditions.

  The element declaration ID column 115c stores an element declaration ID that is identification information for uniquely identifying an element declaration.

  The restriction condition type column 115d stores information for specifying the restriction condition type to be restricted.

  The restriction condition candidate column 115e stores information for specifying restriction candidate candidates to be restricted.

  As shown in FIG. 7, the second restriction candidate table 115g includes an ID field 115h, an element declaration ID field 115i, a restriction condition type field 115k, and a restriction condition candidate field 115l.

  The ID column 115h stores identification information (ID) for identifying items specified in each record and constraint conditions.

  The element declaration ID column 115i stores an element declaration ID that is identification information for uniquely identifying an element declaration.

  The particle ID column 115j stores a particle ID that is identification information for uniquely identifying a particle in the element declaration specified in the element declaration ID column 115i and to be restricted.

  Here, the particle is a component of the content declaration content model, and specifically includes a sequence element, a choice element, an element element, an any element, and the like.

  The restriction condition type column 115k stores information for specifying the restriction condition type to be restricted.

  The constraint condition candidate column 115l stores information for specifying a constraint condition candidate to be restricted.

  Returning to FIG. 1, the post-conversion schema storage area 116 stores a post-conversion schema obtained by converting the original schema 113a by the schema conversion unit 125 described later.

  For example, in the present embodiment, a post-conversion schema 116a as shown in FIG. 8 (schematic diagram of the post-conversion schema 116a) is stored in the post-conversion schema storage area 116.

  The number at the left end in FIG. 8 is a memory for indicating the number of rows and does not constitute the post-conversion schema 116a.

  Returning to FIG. 1, the control unit 120 includes an overall control unit 121, a schema verification unit 122, a search unit 123, a restriction candidate information update unit 124, and a schema conversion unit 125.

  The overall control unit 121 controls the overall processing in the schema conversion apparatus 100.

  In particular, in the present embodiment, the overall control unit 121 manages information stored in the schema repository storage area 111, the setting information storage area 112, the original schema storage area 113, and the sample data storage area 114. For example, the information stored in these storage areas is acquired via the input unit 130 or the communication unit 150, and the acquired information is stored in the corresponding storage areas.

  The schema verification unit 122 verifies whether the XML document to be verified is valid with respect to the schema document.

  In particular, in this embodiment, the schema verification unit 122 determines whether the sample data 114a stored in the sample data storage area 114 is valid with respect to the original schema 113a stored in the original schema storage area 113. Perform verification.

  The search unit 123 searches for an XML document (sample data 114a) to be searched, and specifies each element described in the XML document (sample data 114a).

  Here, in the present embodiment, the search unit 123 searches the XML document (sample data 114a) to be searched with depth priority, specifies elements in the order of return, and specifies the elements in the order of return. Is output to the restriction candidate information update unit 124.

  The restriction candidate information update unit 124 extracts information included in the element declaration corresponding to the element from the element acquired from the search unit 123 from the original schema 113a so that the information included in the element is determined to be valid. In addition, it is determined whether or not there is a stricter constraint condition, and a process of storing the strictest constraint condition among the stricter constraint conditions in the limit candidate information storage area 115 as a limit candidate is performed.

  The schema conversion unit 125 determines whether or not the restriction candidates stored in the restriction candidate information storage area 115 are permitted by the setting information stored in the setting information storage area 112, and the restriction is determined. By applying the permitted restriction candidates to the original schema 113a, the schema is converted, and the converted schema is generated.

  The converted schema generated in this way is stored in the converted schema storage area 116.

  The input unit 130 receives input of information.

  The output unit 140 outputs information.

  The communication unit 150 transmits and receives information via a network (not shown).

  The schema conversion apparatus 100 described above includes, for example, an external storage device such as a CPU (Central Processing Unit) 901, a memory 902, and an HDD (Hard Disk Drive) as shown in FIG. 9 (schematic diagram of the computer 200). 903, a reading device 905 for reading / writing information from / to a portable storage medium 904 such as a CD-ROM (Compact Disk Read Only Memory) and a DVD-ROM (Digital Versatile Disk Read Only Memory), a keyboard, a mouse, and the like This can be realized by a general computer 900 including an input device 906, an output device 907 such as a display, and a communication device 908 such as a NIC (Network Interface Card) for connecting to a communication network.

  For example, the storage unit 110 can be realized by the CPU 901 using the memory 902 or the external storage device 903, and the control unit 120 loads a predetermined program stored in the external storage device 903 into the memory 902. The input unit 130 can be realized by the CPU 901 using the input device 906, and the output unit 140 can be realized by the CPU 901 using the output device 907. The communication unit 150 can be realized by the CPU 901 using the communication device 908.

  The predetermined program is downloaded from the storage medium 904 via the reading device 905 or from the network via the communication device 908 to the external storage device 903, and then loaded onto the memory 902 and executed by the CPU 901. You may do it. Alternatively, the program may be directly loaded on the memory 902 from the storage medium 904 via the reading device 905 or from the network via the communication device 908 and executed by the CPU 901.

  FIG. 10 is a flowchart showing overall processing in the schema conversion apparatus 100.

  First, the overall control unit 121 acquires the original schema stored in the original schema storage area 113 and the sample data stored in the sample data storage area 114 (S10). Here, when there are a plurality of sample data used for the original schema, a plurality of sample data are acquired in step S10.

  Next, the overall control unit 121 extracts one sample data that has not yet been searched for restriction candidates in step S14 from the sample data acquired in step S10, and inputs the sample data to the schema verification unit 122 (S11). The original schema acquired in step S10 is input to the schema verification unit 122.

  Next, the schema verification unit 122 determines whether the sample data input in step S11 is valid for the input schema (S12). Here, the processing in the schema verification unit 122 is the same as that realized by a general XML parser or the like.

  If the sample data is not valid for the schema (No in step S12), the process proceeds to step S13. If the sample data is valid for the schema (Yes in step S12), the process proceeds to step S14.

  In step S13, the schema verification unit 122 displays a predetermined error message on the output unit 140 and ends the process.

  On the other hand, in step S14, the schema verification unit 122 inputs the sample data and the original schema input from the overall control unit 121 to the search unit 123 and the restriction candidate information update unit 124, and updates the search unit 123 and the restriction candidate information update. The unit 124 performs processing for updating the restriction candidate information. Details of the processing in step S14 will be described later.

  Next, the overall control unit 121 determines whether there is sample data that has not yet been searched for restriction candidates in step S14 among the sample data acquired in step S10 (S15). In step S15, the process returns to step S11 to repeat the process. If not (No in step S15), the process proceeds to step S16.

  In step S <b> 16, the restriction candidate information update unit 124 acquires the setting information stored in the setting information storage area 112, and among the restriction candidates stored in the restriction candidate information storage area 115, there is a restriction in the setting information. The restriction candidates are updated by deleting the unauthorized ones.

  Specifically, the restriction candidate information update unit 124 acquires the setting information table 112a stored in the setting information storage area 112, and stores the first restriction candidate table 115a stored in the restriction candidate information storage area 115 and Of the records in the second restriction candidate table 115g, those that are not permitted to be restricted in the restriction candidate table 112a are deleted.

  Here, in the restriction candidate table 112a, in the record in which the ID column 112b is “1”, the element declaration ID column 112c is “Telephone” and the constraint type column 112d is “basic”, Indicates that the restriction is permitted.

  Further, in the restriction candidate table 112a, the record in which the ID column 112b is “2”, the element declaration ID column 112c is “Telephone”, and the constraint type column 112d is “value length” Indicates that the restriction is allowed.

  Further, in the restriction candidate table 112a, in the record in which the ID column 112b is “3”, the element declaration ID column 112c is “*”, which indicates an arbitrary element, and the restriction type column 112d. Indicates that the restriction of the restriction condition is permitted for the record of “appearing particle”.

  In the restriction candidate table 112a, in the record whose ID column 112b is “4”, the element declaration ID column 112c is an arbitrary element, and the record whose constraint condition type column 112d is “appearance count” Indicates that the restriction is permitted.

  In the restriction candidate table 112a, in the record whose ID column 112b is “5”, the element declaration ID column 112c is an arbitrary element, and the record whose constraint condition type column 112d is “appearance element” Indicates that the restriction is permitted.

  Therefore, the record of “1, 2, 5-10” in the ID field 115b of the first restriction candidate table 115a is deleted, and the restriction candidate information is updated by not deleting the record of the second restriction candidate table 115g. .

  Then, the schema conversion unit 125 converts the original schema using the restriction candidates updated in step S16, and generates a converted schema (S17).

  First, the limitation on records identified by “3” and “4” in the ID column 115b of the first limitation candidate table 115a in FIG. 6 will be described.

  Due to this restriction, the element element on the 32nd line of the original schema 113a shown in FIG. 4 is converted into the element element on the 31st to 37th lines of the converted schema 116a shown in FIG.

  Here, the restriction element on the 33rd line of the post-conversion schema 116a represents that the data type specified by the value of the base attribute is limited as a base. As the value of the base attribute, “NCName” registered in the restriction condition candidate column 115e of the first restriction candidate table 115a is stored.

  Further, the length element on the 34th line of the post-conversion schema 116a represents that this data type allows only a value having a length specified by the value of the value attribute. As the value of the value attribute, “12” registered in the restriction condition candidate column 115e of the first restriction candidate table 115a is stored.

  With these conversions, the element declaration of the Telephone element of the original schema 113a has the string data type, but the converted schema becomes the data type of the NCName base type, so that the constraint condition becomes strict. In the original schema 113a, the length of the value is not limited. However, in the post-conversion schema 116a, the length of the value is limited to “12”, so that the constraint condition becomes strict.

  Next, the limitation on records identified by “1” in the ID column 115h of the second limitation candidate table 115g shown in FIG. 7 will be described.

  By this conversion, the choice element on the 15th to 18th lines of the original schema 113a is converted to the element element on the 17th line of the converted schema 116a.

  As a result, in the original schema 113a, the occurrence of both the Telephone element and the Email element was permitted, but in the post-conversion schema 116a, only the occurrence of the Telephone element can be allowed and the appearance of the Email element can be prohibited. Constraints become stricter.

  Next, a description will be given of the restriction of records identified by “2” and “3” in the ID column 115h of the second restriction candidate table 115g shown in FIG.

  By this conversion, the any element on the 27th line of the original schema 113a is converted into an element element on the 26th line of the converted schema 116a.

  As a result, although the appearance of an arbitrary element is permitted in the original schema 113a, only the appearance of a Disco element is allowed in the post-conversion schema 116a. Further, although the maximum number of appearances was not limited in the original schema 113a, the maximum number of appearances can be limited to one in the post-conversion schema, and the constraint condition becomes strict.

  Next, the limitation on records identified by “4” in the ID column 115h of the second limitation candidate table 115g shown in FIG. 7 will be described.

  By this conversion, the element element on the 07th line of the original schema 113a is converted to the element element on the 09th line of the converted schema 116a.

  As a result, the maximum number of appearances was not limited in the original schema 113a, but the maximum number of appearances can be limited to two in the converted schema, and the constraint condition becomes strict.

  FIG. 11 is a flowchart showing a process for updating the restriction candidate information shown in step S14 of FIG.

  First, the search unit 123 of the schema conversion device 100 searches for an element from sample data that is a search target, and extracts one element E that has not yet been investigated in steps S21 to S24 described later ( S20).

  Here, in the present embodiment, the search unit 123 searches the sample data with depth priority, extracts the element E in the order of return, and performs the process described later.

  For example, when the sample data to be searched is the sample data 114a shown in FIG. 5, the search unit 123 searches the sample data 114a with depth priority, and includes each of the sample data 114a. Elements are extracted as element E in the following order.

  (1) CustomerName element (line 04), (2) Telephone element (line 05), (3) CustomerInfo element (line 03-06), (4) ProductName element (line 08), (5) Quantity Element (line 09), (6) PurchaseInfo element (line 07-10), (7) ProductName element (line 12), (8) Quantity element (line 13), (9) Disco element (line 14) Eye), (10) PurchaseInfo element (11th to 15th lines), (11) PurchaseOrder element (01th to 16th lines).

  Next, the restriction candidate information update unit 124 acquires an element declaration D corresponding to the element E from the original schema (S21). Here, the process of acquiring the element declaration D will be described in detail with reference to FIG.

  Next, the restriction candidate information update unit 124 determines whether or not the element declaration D acquired in step S21 includes a child element definition (S22). Here, whether or not the element declaration D includes the definition of the child element is determined by whether or not the element declaration D has an “element” element in the child element.

  If no child element is defined (No in step S22), the process proceeds to step S23. If a child element is defined (Yes in step S22), the process proceeds to step S24.

  In step S <b> 23, the restriction candidate information update unit 124 updates restriction candidate information on the constraint condition of the text data. Details of this processing will be described in detail with reference to FIG.

  On the other hand, in step S <b> 24, the restriction candidate information update unit 124 updates the restriction candidate information of the constraint condition of the child element. Details of this processing will be described in detail with reference to FIG.

  Then, the restriction candidate information update unit 124 determines whether there is an element that has not been investigated in steps S21 to S24 (S25), and if there is such an element (Yes in step S25). ) Return to step S20 and repeat the process. If there is no such element (No in step S25), the process ends.

  FIG. 12 is a flowchart showing processing for acquiring data of the element declaration D corresponding to the element E in step S21 in FIG.

  First, the restriction candidate information update unit 124 of the schema conversion apparatus 100 determines whether or not the name space of the element E is the same as the target namespace of the original schema (S30).

  For example, when the sample data is the sample data 114a shown in FIG. 5 and the original schema is the original schema 113a shown in FIG. 4, a CustomerName element (04th line), a Telephone element (05th line), a CustomerInfo element ( 03 to 06), ProductName element (line 08), Quantity element (line 09), PurchaseInfo element (line 07 to 10), ProductName element (line 12), Quantity element (line 13), PurchaseInfo It is the namespace URI “http://example.org/order” of the element (line 11 to 15) and the PurchaseOrder element (line 01 to 16), and the original schema 113a The elephant is the namespace URI is "http://example.org/order", these are for the match, the processing proceeds to step S31. On the other hand, the namespace URI of the Disco element (line 14) is “http://example.com/ext”, and the target namespace URI of the original schema 113a is “http://example.org/order”. Since they do not match, the process proceeds to step S36.

  In step S31, the restriction candidate information update unit 124 determines whether an element declaration corresponding to the element E exists in the original schema (S31). If such an element declaration exists in the original schema (Yes in step S31), the process proceeds to step S33, and if such an element declaration does not exist in the original schema (No in step S31), step. Proceed to S32.

  In step S32, the restriction candidate information update unit 124 determines whether an element declaration corresponding to the element E exists in the include destination schema. If such an element declaration exists in the include schema (Yes in step S32), the process proceeds to step S33. If such an element declaration does not exist in the include schema (step S32). No) Proceed to step S34.

  In step S33, an element declaration existing in the original schema or in the include destination schema is acquired as an element declaration D corresponding to the element E, and the process ends.

  For example, when the sample data is the sample data 114a shown in FIG. 5 and the original schema is the original schema 113a shown in FIG. 4, the CustomerName element (the 04th line) of the sample data 114a has the original schema 113a. The 31st line, the 32nd line of the original schema 113a for the Telephone element (05th line) of the sample data 114a, and the original schema 113a for the CustomerInfo element (03rd to 06th line) of the sample data 114a. The 11th to 21st lines correspond to the ProductName element (line 08) of the sample data 114a with respect to the 34th line of the original schema 113a and the Quantity element (line 09) of the sample data 114a. The 35th line of the original schema 113a, the PurchaseInfo element (07th to 10th lines) of the sample data 114a, the 22nd to 30th lines of the original schema 113a, and the ProductName element (12 of the sample data 114a) Line 34) of the original schema 113a, the 35th line of the original schema 113a for the Quantity element (line 13) of the sample data 114a, and the PurchaseInfo element (11-15 of the sample data 114a). Line 22) from the 22nd line to the 30th line of the original schema 113a, and from the line 03 of the original schema 113a to the PurchaseOrder element (lines 01 to 16) of the sample data 114a. To 0 row, to get as element declaration D.

  On the other hand, in step S <b> 34, the restriction candidate information update unit 124 determines whether an element declaration corresponding to the element E exists in the schema document stored in the schema repository storage area 111.

  Specifically, the restriction candidate information update unit 124 identifies, from the target namespace URI column 111c of the schema repository table 111a, a record in which a schema document having a target namespace URI that matches the namespace E of the element E is stored. Then, it is determined whether or not there is an element declaration corresponding to the element E by searching the schema document indicated by the location stored in the location column 111d of the specified record.

  If there is such an element declaration (Yes in step S34), the process proceeds to step S35, and if there is no such element declaration (No in step S34), the process proceeds to step S36.

  In step S35, the restriction candidate information update unit 124 acquires the found element declaration as an element declaration D, and includes a schema document including the found element declaration in the original schema.

  On the other hand, in step S36, the restriction candidate information update unit 124 outputs a predetermined error message to the output unit 140 and ends the process. Note that the error message output in step S36 preferably includes information for specifying the element E that does not have a corresponding element declaration.

  Next, in step S37, it is determined whether or not there is an element declaration corresponding to the element E in the schema document imported into the original schema. If there is such an element declaration (Yes in step S37), the process proceeds to step S38, and if not (No in step S37), the process proceeds to step S39.

  Note that import refers to importing schema documents having different namespaces, and XML Schema can implement import using an import element.

  For example, since the Disc element of the sample data 114a has a different name space from the original schema 113a, when the Disc element is the element E, the processing is performed in step S37. However, in the original schema 113a, import is performed. Since it has not performed, it will progress to step S39.

  In step S39, the restriction candidate information update unit 124 determines whether or not an element declaration corresponding to the element E exists in the schema document stored in the schema repository storage area 111.

  Specifically, the restriction candidate information update unit 124 identifies, from the target namespace URI column 111c of the schema repository table 111a, a record in which a schema document having a target namespace URI that matches the namespace E of the element E is stored. Then, it is determined whether or not there is an element declaration corresponding to the element E by searching the schema document indicated by the location stored in the location column 111d of the specified record.

  For example, “http://example.com/ext”, which is the namespace URI of the Disco element of the sample data 114a, is the target namespace URI of the record whose ID column 11b of the schema repository table 111a shown in FIG. 2 is “3”. Since it matches the field 111c, the schema document stored in the location specified by the location 111d of this record is searched.

  If there is such an element declaration (Yes in step S39), the process proceeds to step S40. If there is no such element declaration (No in step S39), the process proceeds to step S41.

  In step S40, the restriction candidate information update unit 124 acquires the found element declaration as an element declaration D, and imports a schema document including the found element declaration into the original schema.

  For example, when the Disc count element of the sample data 114a is the element E and the schema document found in step S39 is the schema 160 shown in FIG. 13 (schematic diagram of the schema 160), the 04th line of the schema 160 is displayed. Since there is an element declaration corresponding to the eye, the element declaration on the 04th line is acquired as an element declaration D, and the schema 160 is imported into the original schema 113a. For example, an import element 161 as shown in FIG. 14 (schematic diagram of the import element 161) is added to the original schema 113a.

  Further, the value stored in the target namespace URI column 111c of the record whose ID column 11b of the schema repository table 111a shown in FIG. 2 is “3” is added to the value of the namespace attribute on the 02nd line of the original schema 113a. Then, the value stored in the location field 111d of the record whose ID column 111b of the schema repository table 111a shown in FIG. 2 is “3” is added to the value of the SchemaLocation attribute on the 03rd line.

  On the other hand, in step S41, the restriction candidate information update unit 124 outputs a predetermined error message to the output unit 140 and ends the process. Note that the error message output in step S41 preferably includes information for identifying an element E that does not have a corresponding element declaration.

  FIG. 15 is a flowchart showing the process of updating the restriction candidate information of the text data in step S23 of FIG.

  First, the restriction candidate information update unit 124 acquires the element content of the element E from the sample data (S50).

  Next, the restriction candidate information update unit 124 determines whether there is information on the element declaration D in the first restriction candidate table 115a stored in the restriction candidate information storage area 115 (S51). If there is no such information (No in Step S51), the process proceeds to Step S52. If such information is present (Yes in Step S51), the process proceeds to Step S55.

  In step S52, the restriction candidate information update unit 124 obtains the strictest data type among the constraint conditions that can determine that the element content C acquired in step S50 is valid (S52).

  For example, XML Schema defines various data types called built-in types. These data types include, for example, a string that represents a character string and a normalized string that represents a character string that does not include a carriage return, a line feed, or a tab. These data types have an inclusive relationship. For example, normalizedString is a data type defined by restricting String, and normalizedString has stricter constraints than String. In this way, the severity of the constraint condition can be compared from the data inclusion relationship.

  Therefore, the operator of the schema conversion apparatus 100 considers such an inclusion relation of the data type, determines in advance the order of the strictness of the constraint condition in the data type, and sets it in the restriction candidate information update unit 124. Thus, the determination in step S52 becomes possible.

  In the present embodiment, the processing for obtaining a data type with strict constraints from the built-in types defined by XML Schema has been described. However, a data type with strict constraints may be obtained by other methods. For example, a data type with strict constraints may be obtained from data types uniquely defined by the user of the present invention. For example, a data type of a character string composed of letters A to Z and numbers may be defined. Further, instead of determining the inclusion relationship by derivation of the data type, an original determination method may be defined and used.

  Next, the restriction candidate information update unit 124 adds a new record to the first restriction candidate table 115a, and stores necessary information in addition to the data type obtained in step S52 (S53).

  Specifically, in the added record, the restriction candidate information update unit 124 stores the ID value in the ID column 115b so as to be a sequential number from the upper record, and the element declaration ID column 115c stores the element value. The identification information that can identify the declaration D (in this embodiment, the value of the name attribute of the element declaration D) is stored, and the constraint type column 115d stores information indicating “basic type”. Information indicating the data type obtained in step S52 is stored in the condition candidate field 115e.

  Next, the restriction candidate information update unit 124 obtains the length of the value of the element content C acquired in step S50, adds a new record to the first restriction candidate table 115a, and adds the length of the obtained value. The necessary information is stored (S54).

  Specifically, in the added record, the restriction candidate information update unit 124 stores the ID value in the ID column 115b so as to be a sequential number from the upper record, and the element declaration ID column 115c stores the element value. Identification information that can identify the declaration D (in this embodiment, the value of the name attribute of the element declaration D) is stored, and information indicating “value length” is stored in the constraint condition type column 115d. The constraint condition candidate field 115e stores information indicating the length of the obtained value.

  On the other hand, in step S55, the restriction candidate information update unit 124 obtains the strictest data type among the constraints that can determine that the element content C acquired in step S50 is valid, and the element of the first restriction candidate table 115a. The record corresponding to the declaration D includes both the data type stored in the constraint condition candidate field 115e of the record whose constraint condition type field 115d is “basic type” and the obtained data type. The first restriction candidate table 115a is updated by obtaining the strictest data type that can be used and replacing the value in the candidate field 115e of the constraint condition of the record (S55).

  Next, the restriction candidate information updating unit 124 obtains the length of the value of the element content C acquired in step S50, is a record corresponding to the element declaration D of the first restriction candidate table 115a, and includes a restriction condition type field. The range of the value length including both the length of the value stored in the candidate field 115e of the constraint condition of the record whose 115d is “value length” and the length of the obtained value is obtained. The first restriction candidate table 115a is updated by replacing the value in the restriction condition candidate field 115e (S56).

  The processing in the flowchart of FIG. 15 described above will be specifically described based on the original schema 113a shown in FIG. 4 and the sample data 114a shown in FIG. Here, it is assumed that the first restriction candidate table 115a is in an initial state, and no record for storing restriction candidate information is provided.

  First, if the element E is the CustomerName element on the 04th line of the sample data 114a, the restriction candidate information updating unit 124 acquires “john” that is the element content of the CustomerName element (S50).

  Next, the restriction candidate information update unit 124 determines whether there is information on the CustomerName element declaration in the element declaration ID column 115c of the first restriction candidate table 115a (S51). Since the first restriction candidate table 115a has no record in the initial state, it is assumed that there is no information on the CustomerName element declaration.

  Next, the restriction candidate information update unit 124 obtains a data type with the most restrictive conditions as much as possible, including the element content “john” acquired in step S50. In the present embodiment, the restriction candidate information update unit 124 obtains the data type of NCName by obtaining a data type that is as restrictive as possible from the built-in type of XML Schema. Here, the data type of NCName is a data type derived from the normalizedString data type a plurality of times, and does not include a colon “:”.

  Next, the restriction candidate information update unit 124 adds a new record to the first restriction candidate table 115a, the value “1” in the ID column 115b, and the element declaration ID of the CustomerName element as the element declaration ID. “CustomerName” is stored, “basic type” is stored in the constraint type column 115d, and “NCName” obtained in step S52 is stored in the constraint candidate column 115e (S53).

  Next, the restriction candidate information updating unit 124 obtains 4 which is the length of the value of the element element John, adds a new record to the first restriction candidate table 115a, and sets “2” in the ID column 115b. The element declaration ID stores “CustomerName” which is the element declaration ID of the CustomerName element, the constraint type column 115d stores “base type”, and the constraint condition candidate column 115e includes The obtained value of “2” is stored (S54).

  By performing the above processing, a record in which the ID column 115b is identified by “1” and “2” is added to the first restriction candidate table 115a.

  Next, when the element E is the Telephone element on the 05th line of the sample data 114a, the restriction candidate information updating unit 124 performs the same process as that of the CustomerName element on the 04th line, and performs the first restriction. Records identified by IDs “3” and “4” are added to the candidate table 115a.

  The next element in the sample data 114a is a CustomerInfo element. Processing for this element will be described with reference to FIG.

  Next, when the element E is the ProductName element on the 08th line of the sample data 114a and the Quantity element, the restriction candidate information update unit 124 performs the same processing as in the case of the CustomerName element described above. The records identified by the IDs “5” to “8” are added to the first restriction candidate table 115a. However, in the first restriction candidate table 115a shown in FIG. 6, the value “8 to 9” is stored in the candidate field 115e of the constraint condition of the record indicated by the ID “6”, but the element E is sample data. In the case of the ProductName element on line 08 of 114a, the value of “8” corresponding to the length of the value of the element content “LaptopPC” is stored, and the candidate field for the constraint condition of the record indicated by ID “8” 115e stores a value of “1-2”, but if the element E is a Quantity element on the 09th line of the sample data 114a, “1” corresponding to the length of the value of the element content “1” is stored. "Is stored.

  The next element in the sample data 114a is a PurchaseInfo element. The processing for this element will be described with reference to FIG.

  Next, when the element E is the ProductName element on the 12th line of the sample data 114a, the restriction candidate information update unit 124 acquires “USBMemory” that is the element content of the ProductName element (S50).

  Next, the restriction candidate information update unit 124 determines whether or not there is information on the ProductName element declaration in the element declaration ID column 115c of the first restriction candidate table 115a (S51). Here, since “ProductName” is stored in the element declaration ID column 115c in the record whose ID column 115b is “5” and “6” in the first restriction candidate table 115a by the above-described processing, the process proceeds to step S55. move on.

  In step S55, the restriction candidate information update unit 124 has a data type including both a strict data type including the element contents of the element being processed and a data type already stored in the first restriction candidate table 115a. Find the most restrictive one.

  In this example, the data type with severe restrictions including the USBMemory that is the element content of the ProductName element being processed is NCName, and the data type of the ProductName element declaration already registered in the first restriction candidate table 115a is NCName. The data type including both data types is also NCName.

  Next, the restriction candidate information update unit 124 acquires the value length “9” of the element content “USBMemory” of the element being processed, and the length of the value already stored in the first restriction candidate table 115a “ 8 ”is obtained,“ ProductName ”is stored in the element declaration ID field 115c of the first restriction candidate table 115a,“ Value length ”is stored in the constraint type 115d, Is updated to “8 to 9” (S56).

  By performing the above processing, the record identified by “5” and “6” in the ID column 115b of the first restriction candidate table 115a is updated.

  Next, the constraint candidate information update unit 124 performs processing when the element E is the Quantity element on the 13th row of the sample data 114a. This processing is performed in the ProductName element on the 12th row of the sample data 114a. Since this is the same as the processing in the case of

  Next, when the element E is the Discont element on the 14th line of the sample data 114a, the restriction candidate information update unit 124 performs the same process as the case of the CustomerName element on the 04th line, and performs the first restriction. Records identified by IDs “9” and “10” are added to the candidate table 115a.

  The next element in the sample data 114a is a PurchaseInfo element, and the next element is a PurchaseOrder element. Processing for these elements will be described with reference to FIG.

  FIG. 16 is a flowchart showing the process of updating the candidate restriction information of the child element in step S24 of FIG.

  First, the restriction candidate information update unit 124 acquires a list L of child elements of the element E from the sample data 114a (S60). For example, the restriction candidate information update unit 124 acquires the list L by listing the element names of the child elements of the element E by separating them with commas (,).

  Next, the restriction candidate information update unit 124 determines whether or not there is information on the element declaration D in the second restriction candidate table 115g stored in the restriction candidate information storage area 115 (S61). If there is no such information (No in step S61), the process proceeds to step S62. If such information is present (Yes in step S61), the process proceeds to step S70.

  In step S62, the restriction candidate information update unit 124 determines whether there is a choice element in the child element of the element declaration D in the original schema 113a. If such a choice element is present (Yes in step S62), the process proceeds to step S63, and if not (No in step S62), the process proceeds to step S65.

  In step S63, the restriction candidate information update unit 124 acquires particles of child elements of the choice element in the element declaration D from the original schema 113a.

  Next, the restriction candidate information update unit 124 identifies the particles selected as the child element of the element E of the sample data 114a among the particles acquired in step S63, and adds a new record to the second restriction candidate table 115g. In addition to the information indicating the specified child element, necessary information is stored in the added record (S64).

  Specifically, in the added record, the restriction candidate information update unit 124 stores the ID value in the ID column 115h so as to be a sequential number from the upper record, and the element declaration ID column 115i stores the element value. Information indicating the value of the name attribute of the declaration D is stored, information indicating “choice” is stored in the particle ID column 115j, and information indicating “appearing particle” is stored in the type column 115k of the constraint condition. In the constraint condition candidate field 115e, information indicating the child element specified in step S64 is stored.

  Next, the restriction candidate information updating unit 124 determines whether or not there is a particle whose appearance count is not fixed in the child element of the element declaration D in the original schema 113a (S65). If such a particle is present (Yes in step S65), the process proceeds to step S66. If not (No in step S65), the process proceeds to step S68.

  Here, in the XML Schema, each particle can have a minOccurs attribute and a maxOccurs attribute. The minOccurs attribute represents the minimum number of appearances of particles, and the maxOccurs attribute represents the maximum number of appearances of particles.

  When the minOccurs attribute is omitted, it represents that the minimum number of appearances of the particle is one. When the maxOccurs attribute is omitted, it indicates that the maximum number of appearances of the particle is one.

  Furthermore, when the value of the maxOccurs attribute is unbounded, it indicates that there is no limit on the maximum number of appearances.

  Therefore, in the particle in the element declaration D, when the value specified by the maxOccurs attribute is larger than the value specified by the minOccurs attribute, the minOccurs attribute is omitted, and the value specified by the maxOccurs attribute is “2” or more. In some cases, or when the value of the maxOccurs attribute is unbounded, it can be determined that the number of appearances is not fixed.

  In step S66, the restriction candidate information update unit 124 acquires particles whose number of appearances in the element declaration D is not fixed from the original schema 113a.

  Next, the restriction candidate information update unit 124 specifies the number of appearances of the particle acquired in step S66 from the child element of the element E of the sample data 114a, adds a new record to the second restriction candidate table 115g, Along with the information indicating the identified number of appearances, the necessary information is stored in the added record (S67).

  Specifically, in the added record, the restriction candidate information update unit 124 stores the ID value in the ID column 115h so as to be a sequential number from the upper record, and the element declaration ID column 115i stores the element value. Information indicating the value of the name attribute of the declaration D is stored, information indicating a particle whose number of appearances is not fixed (here, the element name of the particle) is stored in the particle ID column 115j, and the constraint type column 115k. Stores information indicating “number of appearances”, and information indicating the number of appearances specified in step S67 is stored in the constraint condition candidate field 115e.

  Next, the restriction candidate information update unit 124 determines whether there is an any element in the child elements of the element declaration D in the original schema 113a (S68). If there is an any element (Yes in step S68), the process proceeds to step S69. If there is no any element (No in step S68), the process ends.

  In step S69, the restriction candidate information update unit 124 identifies the number of appearances of the child element corresponding to the any element and information indicating the child element in the list L acquired in step S60, and the second restriction candidate table. Two new records are added to 115g, and information indicating the specified number of appearances and information indicating the specified child element are stored in each of the added records together with necessary information.

  Specifically, in the added record, the restriction candidate information update unit 124 stores the ID value in the ID column 115h so as to be a sequential number from the upper record, and “any” in the particle ID column 115j. Is stored in the constraint condition type column 115k, and information indicating the number of appearances specified in step S69 is stored in the constraint condition candidate column 115e. To do.

  Further, in the added record, the restriction candidate information update unit 124 stores the ID value in the ID column 115h so as to be a sequential number from the upper record, and the element declaration ID column 115i stores the element declaration D. The information indicating the value of the name attribute is stored, the information indicating “any” is stored in the particle ID column 115j, the information indicating “appearing element” is stored in the constraint type column 115k, and the constraint condition In the candidate column 115e, information (here, the child element name) indicating the child element specified in step S69 is stored. Here, when there are a plurality of appearing child elements, each child element is stored so as to be identifiable, for example, by separating the element names of the child elements with commas (,).

  On the other hand, in step S70, the restriction candidate information update unit 124 determines whether there is a choice element in the child elements of the element declaration D in the original schema 113a. If such a choice element is present (Yes in step S70), the process proceeds to step S71. If not (No in step S70), the process proceeds to step S73.

  In step S71, the restriction candidate information update unit 124 acquires particles of child elements of the choice element in the element declaration D from the original schema 113a.

  Next, the restriction candidate information update unit 124 identifies the particles selected as the child element of the element E of the sample data 114a among the particles acquired in step S71, and sets the corresponding records in the second restriction candidate table 115g. Then, information indicating the specified child element is added (S72).

  Specifically, the restriction candidate information update unit 124 stores information indicating the value of the name attribute of the element declaration D in the element declaration ID field of the second restriction candidate table 115g, and information indicating the choice in the particle ID field 115j. In the stored record, when the information indicating the child element specified in step S72 is not yet stored in the restriction condition candidate field 115e, the information indicating the child element is stored.

  Next, the restriction candidate information update unit 124 determines whether or not there is a particle whose appearance count is not fixed in the child element of the element declaration D in the original schema 113a (S73). If such a particle is present (Yes in step S73), the process proceeds to step S74. If not (No in step S73), the process proceeds to step S76.

  In step S74, the restriction candidate information update unit 124 acquires particles whose number of appearances in the element declaration D is not fixed from the original schema 113a.

  Next, the restriction candidate information update unit 124 identifies the number of appearances of the particle acquired in step S74 from the child element of the element E of the sample data 114a, and identifies the occurrence in the corresponding record of the second restriction candidate table 115g. Information indicating the number of times is added (S75).

  Specifically, the restriction candidate information update unit 124 stores information indicating the value of the name attribute of the element declaration D in the element declaration ID field 115i and the number of appearances in the particle ID field 115j in the second restriction candidate table 115g. The numerical value specified in step S74 is added to the numerical value stored in the constraint condition candidate field 115e of the record in which information indicating particles that are not fixed is stored.

  Next, the restriction candidate information update unit 124 determines whether there is an any element in the child element of the element declaration D in the original schema 113a (S76). If there is an any element (Yes in step S76), the process proceeds to step S77. If there is no any element (No in step S76), the process ends.

  In step S76, the restriction candidate information update unit 124 identifies the number of appearances of the child element corresponding to the any element and information indicating the child element in the list L acquired in step S60, and sets the second restriction candidate table. Two corresponding records of 115g are selected, and information indicating the specified number of appearances and information indicating the specified child element are added.

  Specifically, the restriction candidate information update unit 124 stores information indicating the value of the name attribute of the element declaration D in the element declaration ID field 115i and “any” in the particle ID field 115j in the second restriction candidate table 115g. Is selected, the record in which the information indicating “number of occurrences” is stored in the restriction condition type column 115k, and the numerical value stored in the restriction condition candidate column 115e is specified in step S76. Add the number of appearances.

  In addition, in the second restriction candidate table 115g, the restriction candidate information update unit 124 stores information indicating the value of the name attribute of the element declaration D in the element declaration ID field 115i, and information indicating “any” in the particle ID field 115j. Is selected, a record in which information indicating “appearing element” is stored in the constraint condition type column 115k, and information indicating the child element specified in step S77 is stored in the constraint condition candidate column 115e. If not, information indicating the child element is added.

  The processing in the flowchart of FIG. 16 described above will be specifically described based on the original schema 113a shown in FIG. 4 and the sample data 114a shown in FIG. Here, it is assumed that the second restriction candidate table 115g is in an initial state, and no record for storing restriction candidate information is provided.

  First, when the element E is a CustomerInfo element from the 03rd line to the 06th line of the sample data 114a, the restriction candidate information update unit 124 specifies a child element of the CustomerInfo element and acquires the list L (S60). ). Here, since the CustomerInfo element has two child elements, a CustomerName element on the 04th line and a Telephone element on the 05th line, [CustomerName, Telephone] is acquired as the list L. The child element list L identifies each child element by separating the element names of the child elements with a comma (,).

  Next, the restriction candidate information update unit 124 determines whether there is a record of a CustomerInfo element declaration in the second restriction candidate table 115g (S61). Since the second restriction candidate table 115g has no record in the initial state, there is no record of the CustomerInfo element. Therefore, it progresses to step S62.

  Next, the restriction candidate information update unit 124 determines whether there is a choice element in the CustomerInfo element declaration (S62).

  Here, since the original schema 113a has a choice element from the 15th line to the 18th line, the process proceeds to step S63.

  In step S63, the restriction candidate information update unit 124 acquires a choice element (from the 15th line to the 18th line) from the original schema 113a.

  Here, the child element of the acquired choice element includes two particles of an element element on the 16th line (<element ref = “Telephone”>) and an element element on the 17th line (<element ref = “Email”>). Exists. This represents a constraint condition that either a Telephone element or an Email element must appear at a corresponding location in the XML document.

  Next, the restriction candidate information update unit 124 identifies the particles selected in the sample data 114a among the child elements of the choice element acquired in step S71, and stores them in the second restriction candidate table 115g (S72). .

  Specifically, the restriction candidate information update unit 124 selects, from among the Telephone element and Email element, which are the child element particles of the choice element, from the child element list L [CustomerName, Telephone] of the CustomerInfo element acquired in step S60. It can be seen that the Telephone element appears. Therefore, it is understood that the element element (<element ref = “Telephone”>) on the 16th row is selected in the sample data 114a. Here, the particle ID of the element element is “Telephone”.

  Then, the restriction candidate information update unit 124 adds a new record to the second restriction candidate table 115g, and stores the ID value in the ID column 115h so that the sequential number starts from the upper record. The ID column 115i stores “CustomerInfo” that is the element declaration ID of the CustomerInfo element that is the processing target, and the particle ID column 115j stores “choice” that is the particle ID of the choice element that is the processing target. “Appearing particle” is stored in the constraint type column 115k, and “Telephone” that is the particle ID of the particle selected in the sample data 114a is stored in the constraint candidate column 115l.

  Next, the restriction candidate information update unit 124 determines whether or not there is a particle whose appearance count is not fixed in the CustomerInfo element declaration (S65).

  Here, since all the particles included in the CustomerInfo element declaration omit the minOccurs attribute and the maxOccurs attribute, the number of appearances is fixed to one, and there is no particle whose appearance number is not fixed. Accordingly, the process proceeds to step S68.

  Next, the restriction candidate information update unit 124 determines whether there is an any element in the CustomerInfo element declaration (S68). Here, since there is no any element in the CustomerInfo element declaration, the restriction candidate information update unit 124 ends the restriction candidate information update process for the CustomerInfo element.

  Next, when the element E is a PurchaseInfo element from the 07th line to the 10th line of the sample data 114a, the restriction candidate information update unit 124 specifies a child element of the PurchaseInfo element and acquires the list L ( S60). Here, the list L of child elements of the PurchaseInfo element is [ProductName, Quantity].

  Next, the restriction candidate information update unit 124 determines whether there is information corresponding to the PurchaseInfo element declaration in the second restriction candidate table 115g (S61). Here, it is assumed that there is no information on the PurchaseInfo element declaration in the second restriction candidate table 115g. Therefore, it progresses to step S62.

  Next, the restriction candidate information update unit 124 determines whether there is a choice element in the PurchaseInfo element declaration (S62). Here, since the choice element does not exist in the PurchaseInfo element declaration (from the 22nd line to the 30th line) of the original schema 113a, the process proceeds to step S65.

  Next, the restriction candidate information update unit 124 determines whether there is a particle whose number of appearances is not fixed in the PurchaseInfo element declaration (S65). Here, it can be seen that the any element on the 27th line among the particles included in the PurchaseInfo element declaration has a minOccurs attribute of 0 and a maxOccurs attribute of unbounded, so the number of appearances is not fixed. move on.

  In step S66, the restriction candidate information update unit 124 acquires information on the any element (27th line). Here, the particle ID of this any element is “any” for simplicity.

  Next, the restriction candidate information update unit 124 performs the following process as the process of step S67.

  First, the restriction candidate information updating unit 124 specifies the number of appearances of the any element acquired in step S66 from the child element list L [ProductName, Quantity] acquired in step S60. Here, it can be seen that no element corresponding to the any element appears in the child element list L [ProductName, Quantity], and the number of occurrences of the any element is zero. Whether or not an element corresponds to an any element may be determined by subtracting a child element corresponding to an element other than the any element from the list L.

  Then, the restriction candidate information update unit 124 adds a new record to the second restriction candidate table 115g, stores the ID value that is a serial number from the information record in the ID field 115h, and the element declaration ID field. 115i stores “PurchaseInfo”, which is an element declaration ID of the PurchaseInfo element that is the processing target, and “any”, which is the particle ID of the any element that is the processing target, is stored in the particle ID column 115j. Then, the “appearance count” is stored in the constraint condition type column 115k, and “0” that is the occurrence count of the any attribute is stored in the constraint condition candidate column 115l.

  Next, the restriction candidate information update unit 124 determines whether or not there is an any element in the PurchaseInfo element declaration (S68). Here, since the Any element exists in the PurchaseInfo element declaration (line 22 to line 30) of the original schema 113a (line 27), the process proceeds to step S69.

  Then, the restriction candidate information update unit 124 performs the following process as the process in step S69.

  First, the restriction candidate information update unit 124 acquires an element in the sample data 114a corresponding to the any element. Here, from the child element list L [ProductName, Quantity] acquired in step S60, no element corresponding to the any element appears in the sample data 114a.

  Then, the restriction candidate information update unit 124 stores the information obtained as described above in the second restriction candidate table 115g.

  Specifically, a new record is added to the second restriction candidate table 115g, the ID column 115h stores the ID value that is a sequential number from the information record, and the element declaration ID column 115i has a process. “PurchaseInfo” that is the element declaration ID of the target PurchaseInfo element is stored, and “any” that is the particle ID of the any element that is the processing target is stored in the particle ID column 115j. “Appearance element” is stored in the type column 115k, and there is no element corresponding to the any attribute in the constraint condition candidate column 115l.

  Thus, the update process of the restriction candidate information for the PurchaseInfo element is completed.

  Next, when the element E is a PurchaseInfo element from the 11th line to the 15th line of the sample data 114a, the restriction candidate information update unit 124 specifies a child element of the PurchaseInfo element and acquires the list L ( S60). Here, the list L of child elements of the PurchaseInfo element is [ProductName, Quantity, Discot].

  Next, the restriction candidate information update unit 124 determines whether there is a record corresponding to the PurchaseInfo element declaration in the second restriction candidate table 115g (S61). Here, as a result of performing the process on the PurchaseInfo element from the 07th line to the 10th line of the sample data 114a, there is a record corresponding to the PurchaseInfo element declaration in the second restriction candidate table 115g, so the process proceeds to step S70.

  In step S <b> 70, the restriction candidate information update unit 124 determines whether there is a choice element in the PurchaseInfo element declaration. Here, since the choice element does not exist in the PurchaseInfo element declaration (from the 22nd line to the 30th line) of the original schema 113a, the process proceeds to step S73.

  Next, the restriction candidate information update unit 124 determines whether there is a particle whose number of appearances is not fixed in the PurchaseInfo element declaration (S73). Here, the any element on the 27th line among the particles included in the PurchaseInfo element declaration has a minOccurs attribute of 0 and a maxOccurs attribute of unbounded, so that the number of appearances is not fixed, and the process proceeds to step S74. .

  In step S74, the restriction candidate information update unit 124 acquires information on the any element (27th line). Here, the particle ID of this any element is “any” for simplicity.

  Next, the restriction candidate information update unit 124 performs the following process as the process of step S75.

  First, the restriction candidate information update unit 124 specifies the number of appearances of the any element acquired in step S74 from the child element list L [ProductName, Quantity, Discout] acquired in step S60. Here, since the element [Discout] corresponding to the any element appears in the child element list L [ProductName, Quantity, Discout], the number of appearances (1 time) of the element [Discout] is acquired.

  Then, the restriction candidate information update unit 124 stores “PurchaseInfo” in the element declaration ID field 115i, “any” in the particle ID field 115j, and the restriction condition type field 115k in the second restriction candidate table 115g. By selecting a record in which the “number of occurrences” is stored, a numerical value stored in the constraint condition candidate field 115l and a numerical value obtained by adding the number of appearances of the element [Discout] (one time) to the numerical value The number of appearances including both (here, 0 to 1) is stored.

  Next, the restriction candidate information update unit 124 determines whether or not there is an any element in the PurchaseInfo element declaration (S76). Here, since the Any element exists in the PurchaseInfo element declaration (line 22 to line 30) of the original schema 113a (line 27), the process proceeds to step S77.

  Then, the restriction candidate information update unit 124 performs the following process as the process in step S77.

  First, the restriction candidate information update unit 124 acquires an element in the sample data 114a corresponding to the any element. Here, an element [Discount] corresponding to the any element appears in the sample data 114a from the child element list L [ProductName, Quantity, Disco] acquired in step S60.

  Then, the restriction candidate information update unit 124 stores the information obtained as described above in the second restriction candidate table 115g.

  Specifically, in the second restriction candidate table 115g, “PurcaseInfo” is stored in the element declaration ID column 115i, “any” is stored in the particle ID column 115j, and “appearing element” is stored in the constraint type column 115k. When a stored record is selected and “Discount” is not stored in the restriction condition candidate field 115l, “Discount” is stored in the field.

  Thus, the update process of the restriction candidate information for the PurchaseInfo element is completed.

  Next, when the element E is a PurchaseOrder element from the 01st line to the 16th line of the sample data 114a, the restriction candidate information update unit 124 specifies a child element of the PurchaseOrder element and acquires the list L ( S60). Here, the child element list L of the PurchaseOrder element is [CustomerName, Telephone, CustomerInfo, ProductName, Quantity, PurchaseInfo, ProductName, Quantity, Disco, Purchase].

  Next, the restriction candidate information update unit 124 determines whether there is information corresponding to the PurchaseOrder element declaration in the second restriction candidate table 115g (S61). Here, it is assumed that there is no information on the PurchaseOrder element declaration in the second restriction candidate table 115g. Therefore, it progresses to step S62.

  Next, the restriction candidate information update unit 124 determines whether there is a choice element in the PurchaseOrder element declaration (S62). Here, since the choice element does not exist in the PurchaseOrder element declaration (from the 03rd line to the 10th line) of the original schema 113a, the process proceeds to step S65.

  Next, the restriction candidate information update unit 124 determines whether or not there is a particle whose appearance count is not fixed in the PurchaseOrder element declaration (S65). Here, among the particles included in the PurchaseOrder element declaration, the PurchaseInfo element on the 07th line indicates that the occurrence count is not fixed because the maxOccurs attribute is unbounded, and the process proceeds to step S66.

  In step S66, the restriction candidate information update unit 124 obtains information of this PurchaseInfo element (line 07). Here, the particle ID of this PurchaseInfo element is “PurchaseInfo” for simplicity.

  Next, the restriction candidate information update unit 124 performs the following process as the process of step S67.

  First, the restriction candidate information update unit 124 specifies the number of appearances of the PurchaseInfo element acquired in step S66 from the child element list L acquired in step S60. Here, since the element corresponding to the PurchaseInfo element appears twice in the child element list L, it can be seen that the number of occurrences of the PurchaseInfo element is twice.

  Then, the restriction candidate information update unit 124 adds a new record to the second restriction candidate table 115g, stores the ID value that is a serial number from the information record in the ID field 115h, and the element declaration ID field. 115i stores “PurchaseOrder” that is the element declaration ID of the PurchaseOrder element that is the processing target, and “PurchaseInfo” that is the particle ID of the PurchaseInfo element that is the processing target is stored in the particle ID column 115j. Then, the “appearance count” is stored in the restriction condition type column 115k, and “2” that is the appearance count of the PurchaseInfo element is stored in the constraint condition candidate column 115l.

  Next, the restriction candidate information updating unit 124 determines whether or not there is an any element in the PurchaseOrder element declaration (S68). Here, since there is no any element in the PurchaseOrder element declaration (from the 03rd line to the 10th line) of the original schema 113a, the update process of the restriction candidate information for the PurchaseOrder element is terminated.

  As described above, the processing of FIG. 15 or 16 has been executed for all the elements in the sample data 114a, and therefore the update process of the restriction candidate information ends.

  As described above, according to the present embodiment, the post-conversion schema 116a in which the original schema 113a is more strictly restricted can be generated using the sample data 114a. For this reason, for example, the operator of the schema conversion device 100 determines that such sample data is appropriate by creating at least one sample data that can be permitted in the system as much as possible. Will be able to easily generate the most stringent schema.

  For example, the schema conversion apparatus 100 according to the present embodiment can be used in the Web service system 170 shown in FIG. 17 (schematic diagram of the Web service system 170).

  As illustrated, the Web service system 170 includes a schema conversion apparatus 100, a message reception apparatus 171, a schema verification apparatus 172, and an application server apparatus 173. These apparatuses are connected to each other via a network 180. Can send and receive information.

  The message reception device 171 transmits the message received from the Web service client (not shown) to the schema verification device 172. Here, the pre-verification XML document that is the whole or part of the message is transmitted to the schema verification device 172. For example, the content of the SOAP body, which is the main part of the SOAP message, can be extracted and transmitted to the schema verification apparatus as a pre-verification XML document.

  Then, the schema verification device 172 executes schema verification of the received pre-verification XML document. Here, the schema verification device 172 performs schema verification using the post-conversion schema generated by the schema conversion device 100.

  If the pre-verification XML document is valid for the post-conversion schema generated by the schema conversion apparatus 100, the schema verification apparatus 172 transmits the verified XML document to the application server apparatus 173.

  Upon receiving such a verified XML document, the application server device 173 uses the verified XML document to execute some business process such as a product order process or a travel reservation process.

  In the example illustrated in FIG. 17, in the service provided by the application server device 173, the schema conversion device 100 generates a post-conversion schema using sample data determined to be safe, so that the application server device 173 Security can be ensured.

  In the example shown in FIG. 17, the entire processing in the Web service system 170 is shared by the schema conversion device 100, the message reception device 171, the schema verification device 172, and the application server device 173. It is not limited to such an aspect, The aspect which shares the whole process in the Web service system 170 can select arbitrary aspects. For example, the entire process in the Web service system 170 can be performed only by the schema conversion apparatus 100, and any process in the Web service system 170 can be performed by the schema conversion apparatus 100. It is.

  In the embodiment described above, in the flowchart shown in FIG. 15, the data type of the element content and the length of the value can be stricter. However, the embodiment is not limited to such an aspect. For example, it is possible to tighten restrictions on the character strings that appear, the presence of special symbols, the range of integer values (minimum and maximum values, positive values or negative values), etc. is there.

  In the embodiment described above, the sample data 114a is used to make restrictions on elements more strict. However, the present invention is not limited to such an aspect, and the attributes are the same as those shown in FIG. The range of the attribute value can be limited by the process, and the attribute that appears as the anyAttribute attribute value can be limited by the same process as in FIG.

  FIG. 18 is a schematic diagram of a schema conversion apparatus 200 according to the second embodiment of the present invention.

  As shown in the figure, the schema conversion apparatus 200 includes a storage unit 110, a control unit 220, an input unit 130, an output unit 140, and a communication unit 150, and is controlled as compared with the first embodiment. Since the unit 220 is different, items related to the control unit 220 will be described below.

  The control unit 220 includes an overall control unit 121, a schema verification unit 122, a search unit 123, a restriction candidate information update unit 124, a schema conversion unit 225, and a schema editing unit 226. The first embodiment Since the schema conversion unit 225 and the schema editing unit 226 are different from each other, items related to these will be described below.

  Of the restriction candidates stored in the restriction candidate information storage area 115, the schema conversion unit 225 receives the restriction permission input from the operator of the schema conversion apparatus 200 in the schema editing unit 226 described later. By applying to, the schema is converted and the converted schema is generated.

  The schema editing unit 226 outputs the restriction candidates stored in the restriction candidate information storage area 115 to the output unit 140, and inputs the restriction candidates to be applied to the original schema 113 a among the restriction candidates via the input unit 130. The schema conversion unit 225 is notified of the received restriction candidates.

  For example, in the present embodiment, selection of restriction candidates is accepted from the operator by outputting an editor screen 226a as shown in FIG. 19 (schematic diagram of the editor screen 226a) to the output unit 140.

  The editor screen 226a includes an original schema display area 226b and a line number display area 226c.

  The row number display area 226c is limited to a position adjacent to the number of particle rows where the restriction candidates stored in the restriction candidate information storage area 115 exist (a predetermined position on the right side in FIG. 19). A mark 226d indicating that a candidate exists is arranged.

  When the execution instruction specifying this mark 226d is received via the input unit 130, the schema editing unit 226 is positioned adjacent to the particle related to the mark 226d (a predetermined position below in FIG. 19). The information for specifying the restriction candidates is displayed.

  Then, the schema editing unit 226 accepts an input of an execution instruction specifying the displayed restriction candidate via the input unit 130 (for example, double-clicking), and the restriction candidate that has received the input is schema conversion part 225. Notify

  Upon receiving such notification, the schema conversion unit 225 performs conversion on the original schema 113a using the conversion candidate specified by the notification.

  FIG. 20 is a flowchart showing restriction candidate selection processing in the schema conversion apparatus 200.

  First, for example, the schema editing unit 226 displays an editor screen 226a shown in FIG. 19 on the output unit 140, and receives an input of restriction candidates to be displayed in another window (S80).

  When the schema editing unit 226 receives an execution instruction specifying the mark 226d arranged in the line number display area 226c via the input unit 130, the schema editing unit 226 displays information for specifying the input restriction candidate. (S81).

  Here, the schema editing unit 226 uses the element declaration ID column 115c of the first restriction candidate table 115a or the second element declaration ID specified by the number of rows related to the mark 226d selected in step S80. The record stored in the element declaration ID field 115i of the restriction candidate table 115g is specified, and the information stored in at least the restriction condition type fields 115d and 115k and the restriction condition candidate fields 115e and 115l from the specified record. , And the extracted information is edited into a predetermined display format and displayed at a predetermined position on the editor screen 226a.

  When the schema editing unit 226 receives an input of an execution instruction specifying the displayed restriction candidate via the input unit 130, the first restriction candidate table 115a or the second restriction candidate table corresponding to the selected restriction candidate. Information stored in the 115g record is notified to the schema conversion unit 225, and the schema conversion unit 225 performs conversion of the original schema 113a (S83). For the restriction candidates that have been converted, it is desirable to perform processing such as removing the mark 226d or clearly indicating that processing has already been performed.

  The processes from steps S80 to S83 are performed until an input of an instruction to end editing is received via the input unit 130 (S84).

  Then, the schema conversion unit 225 stores the converted schema in the converted schema storage area 116 (S85).

  As described above, in the present embodiment, before conversion of the original schema 113a is performed, conversion candidates are displayed and an operator's selection is accepted, thereby preventing the operator from performing unnecessary conversion. be able to. Even in such a case, since the conversion candidates are already narrowed down based on the sample data 114a, the operator can efficiently select the conversion candidates.

  In the embodiment described above, selection of restriction candidates is accepted after narrowing down restriction candidates based on the setting information stored in the setting information storage area 112. However, the present invention is limited to such a mode. First, the editing process by the schema editing unit 226 may be performed without narrowing down restriction candidates based on the setting information stored in the setting information storage area 112.

  FIG. 21 is a schematic diagram of a Web service system 370 according to the third embodiment of the present invention.

  As shown in the figure, the Web service system 370 includes a schema conversion device 300 and a client terminal 374, which can transmit and receive information to and from each other via a network 381.

  Here, since the client terminal 374 can be configured by a normal personal computer, detailed description thereof is omitted.

  FIG. 22 is a schematic diagram of the schema conversion apparatus 300.

  As illustrated, the schema conversion apparatus 300 includes a storage unit 310, a control unit 320, an input unit 130, an output unit 140, and a communication unit 150.

  The storage unit 310 includes a schema repository storage area 111, a setting information storage area 112, an original schema storage area 113, a sample data storage area 114, a restriction candidate information storage area 115, a converted schema storage area 116, a log Since the log information storage area 317 is added as compared with the first embodiment, items related to the log information storage area 317 will be described below.

  In the log information storage area 317, the schema verification unit 122 determines that the XML document that is the object of schema verification is not valid for the converted schema but is valid for the original schema. In this case, the information specifying the XML document and the information specifying that the XML document is not valid for the converted schema but valid for the original schema are stored in association with each other. Is done.

  The control unit 320 includes an overall control unit 121, a schema verification unit 122, a search unit 123, a restriction candidate information update unit 124, a schema conversion unit 125, a log acquisition unit 327, and an application unit 328. Since the log acquisition unit 327 and the application unit 328 are different from those of the first embodiment, items related to these will be described below.

  The log acquisition unit 327 determines that the schema verification unit 122 determines that the XML document subjected to the schema verification is not valid for the converted schema but is valid for the original schema. The log information is associated with the information specifying the XML document and the information specifying that the XML document is not valid for the converted schema but valid for the original schema. The information is stored in the information storage area 317.

  Further, the log acquisition unit 327 determines that the schema verification unit 122 determines that the XML document that is the object of schema verification is valid for the original schema 113a and not valid for the converted schema 116a. In this case, a process of transmitting log information of the XML document to the client terminal 374 that has transmitted the XML document is performed.

  The application unit uses the verified XML document determined to be valid by the schema verification unit 122 to execute some business process such as a product order process or a travel reservation process.

  FIG. 23 is a flowchart illustrating processing when the schema conversion apparatus 300 verifies the XML document.

  First, in the schema conversion apparatus 300, the overall control unit 121 receives an XML document from the client terminal 374 via the communication unit 150 (S90).

  Next, the schema verification unit 122 performs schema verification of the XML document received in step S90 using the converted schema stored in the converted schema storage area 116 (S91).

  Then, the schema verification unit 122 determines whether or not the XML document is valid for the converted schema 116a (S92). If it is valid (Yes in step S92), the schema verification unit 122 proceeds to step S93. (No in step S92), the process proceeds to step S94.

  In step S <b> 93, the schema verification unit 122 outputs the verified XML document determined to be valid to the application unit 328.

  On the other hand, in step S94, the schema verification unit 122 uses the original schema 113a stored in the original schema storage area 113 for the XML document determined to be invalid with respect to the converted schema in step S92. Perform verification.

  Then, the schema verification unit 122 determines whether the XML document is valid with respect to the original schema 113a (S95). If it is valid (Yes in step S95), the schema verification unit 122 proceeds to step S96. (No in step S95) The process proceeds to step S97.

  In step S <b> 96, the log acquisition unit 327 determines that the XML document that is the object of schema verification and the XML document are not valid for the converted schema but valid for the original schema. Are stored in the log information storage area 317 as log information in association with each other.

  In step S97, the overall control unit 121 sends an error message (attaching the log information if there is log information) notifying the client terminal 374 that the XML document is determined to be invalid by the schema verification. Send.

  By performing the process as described above, by converting the schema, it is possible to obtain a history (log) that results in different schema verification results, and by analyzing the history (log), The validity of schema conversion can be judged.

  In the embodiment described above, schema verification of an XML document is performed using a post-conversion schema with strict constraints. However, the usage of the schema document may be used not only for schema verification but also for other purposes.

  For example, the converted schema may be included in WSDL and published as an interface. Further, a data binding tool such as JAXB (Java Architecture for XML Binding) can generate a Java (registered trademark) class based on information in a schema document. The post-conversion tool may be used when generating a Java (registered trademark) class using JAXB.

  In addition, if the restriction candidate information is stored, reconversion can be easily performed when reconversion is performed on the same or similar original schema.

  After the original schema is changed to one with more restrictive conditions, there is a possibility that the original schema will be modified. In that case, it is conceivable to change the schema again. If the schema is changed manually, such work is very burdensome. However, when the present invention is used, the restriction candidate information includes the change contents, and therefore, reconversion can be easily performed by storing the restriction candidate information.

  Further, in the present embodiment, the method of converting a constraint condition that allows an arbitrary element to appear due to an any element into a constraint condition that allows only the appearance of a specific element, for example, a Disco element, has been described. Here, the case where a specific element name can be specified has been described as an example. However, when it is difficult to specify a specific element name, for example, the name space URI or name space type of an element that is allowed to appear is specified. The constraint condition may be changed as described above. In the “any” element, the name space allowed to appear can be specified by the “namespace” attribute. For example, when ## other is specified in the namespace attribute, an element belonging to a namespace other than the target namespace is allowed to appear. If ## targetNamespace is specified in the namespace attribute, it is possible to specify a specific name space URL that is allowed to appear.

  In addition, when converting the any element on the 27th line in FIG. 4, for example, by setting ## other in the namespace attribute of the any element, while allowing a Disco element belonging to a namespace different from the target namespace to appear, Since the appearance of an element belonging to the target namespace can be prohibited, the constraint condition can be tightened without specifying a specific element name. In addition, using ## targetNamespace, http://example.com, which is the namespace URI to which the Disco element belongs. By specifying org / order, http: // example. Only those that belong to the name space URI of org / order can be allowed to appear, and more restrictive conditions can be made.

Schematic diagram of a schema conversion apparatus. Schematic diagram of a schema document management table. Schematic diagram of a setting information table. Schematic of the original schema. Schematic of sample data. The schematic diagram of a 1st restriction candidate table. Schematic of a 2nd restriction candidate table. Schematic of converted schema. Schematic diagram of a computer. The flowchart which shows the whole process in a schema conversion apparatus. The flowchart which shows the process which updates restriction | limiting candidate information. The flowchart which shows the process which acquires the data of the element declaration corresponding to an element. Schematic diagram. Schematic of the import element. The flowchart which shows the process which updates the restriction | limiting candidate information of text data. The flowchart which shows the process which updates the restriction candidate information of a child element. 1 is a schematic diagram of a Web service system. Schematic diagram of a schema conversion apparatus. Schematic diagram of the editor screen. The flowchart which shows the selection process of a restriction candidate. 1 is a schematic diagram of a Web service system. Schematic diagram of a schema conversion apparatus. The flowchart which shows the process at the time of verification of an XML document.

Explanation of symbols

100, 200, 300 Schema conversion device 110 Storage unit 111 Schema repository storage area 112 Setting information storage area 113 Original schema storage area 114 Sample data storage area 115 Restriction candidate information storage area 116 Converted schema storage area 317 Log information storage area 120 Control Unit 121 Overall control unit 122 Schema verification unit 123 Search unit 124 Restriction candidate information update unit 125, 225 Schema conversion unit 226 Schema editing unit 327 Log acquisition unit 328 Application unit 130 Input unit 140 Output unit 150 Communication unit

Claims (16)

A schema conversion device for generating a schema document,
A process for obtaining each element as the conversion candidate with the strictest constraint that can determine that the element included in the sample data is valid,
A process of generating the schema document by specifying an element declaration corresponding to the element from the original schema, and converting the constraint condition for the element in the element content of the identified element declaration into the constraint condition acquired as the conversion candidate and a control unit that performs,
A storage unit that stores, as conversion candidate information, element declarations in the original schema and the strictest constraints that can determine that the elements included in the sample data are valid,
The controller is
The elements included in the sample data are searched with depth priority, and the strictest constraints that can be determined to be appropriate for the elements searched in the order of return are obtained as conversion candidates.
In the conversion candidate information, a constraint condition associated with an element declaration corresponding to an element included in the sample data and a constraint condition that satisfies the acquired constraint condition are identified, and the constraint in the conversion candidate information A schema conversion apparatus characterized in that a condition is changed to a specified constraint condition . The schema conversion device according to claim 1,
The controller is
Obtaining the most stringent constraints that can be considered appropriate for the elements included in the sample data, in accordance with a pre-determined order of severity of constraints,
Schema conversion device characterized by The schema conversion device according to claim 2 ,
The ranking is such that the included data type is determined to be stricter than the included data type;
Schema conversion device characterized by The schema conversion device according to claim 2 ,
The order is such that a narrow range of element content values is judged to be stricter,
Schema conversion device characterized by The schema conversion device according to claim 2 ,
The order is determined to be stricter if the range of the number of elements appearing as element contents is narrow,
Schema conversion device characterized by The schema conversion device according to claim 2 ,
The order is determined to be more severe when an element appearing as element content allows the appearance of a specific element than the element that allows the appearance of an arbitrary element,
Schema conversion device characterized by The schema conversion device according to claim 1,
A storage unit is provided for storing setting information for specifying element declarations that allow changes to the original schema and types of constraint conditions,
The control unit converts, among the conversion candidates, a constraint condition corresponding to an element declaration and a constraint condition type specified in the setting information, with a constraint condition of the original schema,
Schema conversion device characterized by The schema conversion device according to claim 1,
The controller is
Processing for displaying the conversion candidate on the output unit;
A process of receiving an input as to whether or not to apply the displayed conversion candidate through the input unit;
A process of converting the constraint condition corresponding to the input conversion candidate when applied and the constraint condition of the original schema;
Schema conversion device characterized by A program that causes a computer to function as a schema conversion device that generates a schema document,
The computer,
A process for obtaining each element as the conversion candidate with the strictest constraint that can determine that the element included in the sample data is valid,
A process of generating the schema document by specifying an element declaration corresponding to the element from the original schema, and converting the constraint condition for the element in the element content of the identified element declaration into the constraint condition acquired as the conversion candidate and, a control means for performing,
Functioning as storage means for storing the element declaration in the original schema and the strictest constraints that can determine that the elements included in the sample data are valid as conversion candidate information,
In the control means,
A process of searching for an element included in the sample data with depth priority, and acquiring the most strict constraint that can be determined to be valid as an element searched for in return order, as a conversion candidate;
In the conversion candidate information, a constraint condition associated with an element declaration corresponding to an element included in the sample data and a constraint condition that satisfies the acquired constraint condition are identified, and the constraint in the conversion candidate information Processing to change the condition to the specified constraint condition,
A program characterized by The program according to claim 9 , wherein
In the control means,
In accordance with a predetermined order of severity of constraints, let the process to obtain the most severe constraints that can be considered appropriate elements included in the sample data,
A program characterized by The program according to claim 10 ,
The ranking is such that the included data type is determined to be stricter than the included data type;
A program characterized by The program according to claim 10 ,
The order is such that a narrow range of element content values is judged to be stricter,
A program characterized by The program according to claim 10 ,
The order is determined to be stricter if the range of the number of elements appearing as element contents is narrow,
A program characterized by The program according to claim 10 ,
The order is determined to be more severe when an element appearing as element content allows the appearance of a specific element than the element that allows the appearance of an arbitrary element,
A program characterized by The program according to claim 10 ,
In the control means,
Processing for displaying the conversion candidates on an output means;
A process of receiving an input as to whether or not to apply the displayed conversion candidate via an input means;
A process of converting the constraint condition corresponding to the input conversion candidate when applied and the constraint condition of the original schema;
A program characterized by A schema conversion apparatus having a control unit and a storage unit is a schema generation method for generating a schema document,
The control section, the elements contained in the sample data as a conversion candidate severest constraints capable considered appropriate, the process of acquiring each said element,
The control unit identifies an element declaration corresponding to the element from the original schema, and converts the constraint condition for the element in the element content of the identified element declaration into the constraint condition acquired as the conversion candidate, thereby the schema. and over extent to carry out the process of generating the document, the,
The storage unit includes a process of storing element declarations in the original schema and the strictest constraints that can determine that the elements included in the sample data are valid as conversion candidate information,
The controller is
A process of searching for an element included in the sample data with depth priority, and acquiring the most strict constraint that can be determined to be valid as an element searched for in return order, as a conversion candidate;
In the conversion candidate information, a constraint condition associated with an element declaration corresponding to an element included in the sample data and a constraint condition that satisfies the acquired constraint condition are identified, and the constraint in the conversion candidate information And a process for changing a condition to a specified constraint condition .

Images