立、赞明說明（I) 發明所屬之技術領域 本發明係有關於文件資料轉 關聯式資料庫與可延伸性標 技術，特別是有關於 先前技術 、σ文件之資料轉換方法。 由於網路技術的進步與發展， 間的資料往來曰益頻繁，而關路資料與資料庫 當廣泛的-種資料庫型態。因此目前使用相 性標示語言文件間資料的轉換需求日料庫與可延仲 料轉換方法均係將可延伸性椤 9 ’然現行的資 至表格中的棚位，接著再指=以=點資料對應 轉換。上述方法不僅限制了可延=二:文件間資料的 構，而且關聯式資料庫表格必須非二=二言文件的結 須限定可延伸性標示語言件 ^換言之，必 結構，使用上不具彈性，而；料庫表格的 疋的可延伸性標示語言文件、.二、表格結構、非固 文件以及動態的可延伸性標示語十1件可延伸性標示語言 轉換。 σ文件’現行技術均難以 發明内容 有鑑於此，本發明之目的是楹 :延伸性標示語言文件資料之轉換；： 資料庫表m吏可延伸性標示語言文關聯式 料轉換更符合目前網路發展， 戈=資料庫資 及囚應未來的技術需求。 576995 五、發明說明（2) 為獲致上述目的，本發明的方法 庫與可延伸性標示語言文件資料轉換 一種關聯式資料 來源資料為一目的資料。來源資料可$法，藉以轉換一 料或一可延伸性標示語言文件資料，^一關聯式資料庫資 式資料庫資料或一可延伸性標示語言的資料可為一關聯 與目的資料為不同格式之資料。首^，件資料，來源資料 同，設定指令及其對應之參數資ϋ據來源資料的不 (Query)、更新（Update)、預存程式9 ?包括查詢 uecursive)等，參數資料為執行 、 來源資料為可延伸性標示語言文件所需之參數。當 ;資料庫資料時，則參數資料係為來源資===聯 性標示語言文件資料時，則料為可延伸 結果資料。 矸則參數資科為來源資料中的查詢 點，Ξί存=指ί組成一樹狀結構，其内的指令節 •、存放扣7 ，每一指令節點具有零至數個參數節 \用乂才曰疋與扣7對應之參數資料。當來源資料為資料 關聯式資料庫資料，目的資料為可延伸性標示語言 =資 ，時’則每-才曰令節點之後代尚具有數個輸出節點，用以 指定與指令對應之輸出資料。 y 、依據樹狀結構，依序執行指令節點中之指令，並得到 後代節點所需的參數資料，再分派至後代節點。執行指令 以先深後廣搜尋（Deep First Search)方式進行。當來源 睡 國 第6頁 0213-8804twf(nl);STljC-01-B9137;teresa.ptd 立、發明說明（3) 資料為資料關聯式資料庫資料， 語言文件時，執行至輸出節點時，將ΐ枓為可延伸性標示 至目的資料中的指定位置上·，β鈾—$二派所得的資料輸出 :得之資料設至該指令節點之參：節：令：：時’將分派 :派：：：擊破(Divide_an uer dn 有參數資料處理完畢為：覆 :參照第1圓’第i圓係顯 可延伸性標示語言文件資料至f 之實施例中 T。如囷所示，-種關聯式資料庫與可延仲功f示意 件之資料轉換方法，用以轉換一來源資料’標不語言文 =來源資料為可延伸性標示語件=-目的資料。 為關聯式資料庫資料16時 ：：310 ’而目的資料 文件資料1 0與關聯式資根，可延件性標示語言 可延伸性標示語言文件= :於設計時期，製作出 1 2。然後，透過可延伸俨二’資料庫資料樹狀結構 庫資料樹狀結構12，在# ί ==吕文件資料至關聯式資料 資料I可延二可轉換得到關聯式資料庫 轉換介面“可以一；資料至關聯式資料庫資料 可延伸性標示語言文庫資料樹狀結㈣，將 16。 件資枓1 0轉換為關聯式資料庫資料 請參照第2圖，第2圖係顯 資料庫資料至可尽發月所揭不之實施例中 伸"文件資料轉換的功能示意 五、發明說明（4) 資料庫與可延伸性標示語言文件之資料轉 =式；：=源的資料…源資料 性標示語言文件資ί20:ΐ 2資料庫資料26與可延伸 座眘枓5 τ件資枓 又汁時期’製作出關聯式資料 透過關聯ϋ伸性標示語言文件f料樹狀結構22。然後， :介面資料庫資料至可延伸性標示語言文件資料轉 料庫資料IS一2換程式來達成’轉換程式讀取關聯式資 伸性標示語言文件資料樹狀結構22，將關 換為可延伸性標示語言文件資料20。 求，由! 之樹狀結構12及22是根據資料轉換的實際需 用者於設計時期建立，，中含有數種不同功能： 二點姑不同於現行技術之單一對應架構。0此，可以 非轉換之f料格式，如複雜的表格結構、 2 :=:ΐ標示語言文件、巢狀式的可延伸性標示 °°s f件以及動態的可延伸性標示語言文件等。 :J照第3圖，第3圖係顯示本發 一種關聯式資料庫與可延伸性標示語言」Ϊ =ΐ!方I用以轉換-來源資料為-目的資料，： i料’關聯式資料庫資料或一可延伸性標示語言文件 η:的資料為一關聯式資 “文件資料’來源資料與目的資料為不同格式了(I) The technical field to which the invention belongs The present invention relates to the technology of transferring documents and related databases and extensibility standards, and in particular to the method of transforming data in the prior art and σ files. Due to the advancement and development of network technology, the data exchange between them is frequent, and the data and database related to the road are widely used as a database type. Therefore, the current conversion requirements for data between documents using phase-consistency mark-ups, the Japanese material library and the extensible material conversion method, both extend the extensibility of the data to the sheds in the table, and then refer to the data with Corresponds to conversion. The above method not only limits the structure of data that can be extended = two: documents, but the relational database table must be non-two = the structure of the two-language document must be limited to the extensibility markup language. In other words, it must be structured and inflexible. And; the extensible markup language files of the library table, two, the table structure, non-solid files and dynamic extensibility markup eleven extensible markup language conversion. σ file's current technology is difficult to invent. In view of this, the purpose of the present invention is: conversion of extensible markup language documents and data ;: database table extension of extensible markup language and text-related material conversion more in line with the current network Development, Ge = database resources and future technological needs. 576995 V. Description of the invention (2) In order to achieve the above-mentioned object, the method library and extensible markup language document data conversion of the present invention is a kind of related data. The source data is one-purpose data. Source data can be used to convert one source or an extensible markup language document data, ^ a relational database data base data or an extensible markup language data can be an association and destination data in different formats Information. First, the data is the same as the source data. The setting instruction and its corresponding parameter data are based on the source data (Query), update (Update), pre-stored program 9 (including query uecursive), etc. The parameter data is execution and source data. Parameters required for extensibility markup language files. When; database data, the parameter data is source asset === linkage mark language document data, it is expected to be extensible result data. The rule parameter asset is the query point in the source data. Ξίstore = refers to a tree structure, which contains the instruction sections •, storage buckle 7, each instruction node has zero to several parameter sections \ 用 乂 才 说参数 Parameter data corresponding to buckle 7. When the source data is data relational database data, and the destination data is extensible markup language = Zi, when ’then there are several output nodes for each subsequent generation of the command node to specify the output data corresponding to the instruction. y According to the tree structure, sequentially execute the instructions in the instruction node, and obtain the parameter data required by the descendant nodes, and then assign them to the descendant nodes. Execution instructions are performed in the form of Deep First Search. When the source sleep country page 6 0213-8804twf (nl); STljC-01-B9137; teresa.ptd legislation, invention description (3) The data is data related database data, when the language file is executed to the output node, ΐ 枓 indicates the extensibility to the specified position in the destination data. β uranium— $ 2 send data output: the obtained data is set to the parameters of the command node: section: order :: hour 'will be assigned: send ::: Break (Divide_an uer dn has parameter data processing is completed as follows: Re: refer to the first circle 'i circle is the extensibility mark language file data to f in the embodiment of T. As shown in 囷,-a kind of association Data conversion method of the data base and the reproducible schematic diagram of source data, which is used to convert a source data 'standard language = source data is an extensible markup document =-destination data. It is a relational database data at 16 o'clock ：: 310 'And the purpose data file data 10 and related resources, extensibility markup language, extensibility markup language file =: During the design period, 1 2 was produced. Then, through the extensible mark' database Data Tree Structure LibraryData Tree Structure 12, in # ί == 吕 Document data to relational data I can be extended to two and converted to a relational database conversion interface "Yes one; data to relational database data extensibility markup language library data tree structure, 16 Please refer to Figure 2 for the conversion of file data from 10 to relational database data. Figure 2 shows the function of converting data from the database to the file that can be released as soon as possible. Description of the invention (4) Data transfer of data base and extensible markup language file;: = source data ... Source data markup language file resource 20: ΐ 2 database data 26 and extensible seat 5 τ pieces In the period of asset management, the relational data was produced through the relational extensibility markup language file f data tree structure 22. Then, the: interface database data to the extensible markup language file data transfer database data IS-2 conversion program To achieve the 'conversion program reads the associated extensible markup language file data tree structure 22, and replaces it with the extensible markup language file data tree 20. Please, the tree structures 12 and 22 of! Are converted according to the data actual The user needs to be established during the design period, and contains several different functions: Two points are different from the single corresponding structure of the current technology. 0 This can be non-transformable f data format, such as complex table structure, 2: =: ΐ Marking language files, nested extensibility mark °° sf pieces, and dynamic extensibility markup language files, etc.: J According to Figure 3, Figure 3 shows an associative database and extensibility of the present invention Marking language "Ϊ = ΐ! Party I uses the conversion-source data for the purpose data: i '' relational database data or an extensible markup language file η: 's data is a relational data' document data ' Source and destination data are in different formats
576995 五、發明說明（5) ^ ;的資：^料為可延伸性標示語言文件資料時，則 式資料庫資料時，則甘口貝竹又田來源貝枓為關聯 件資料。 則其目的資料即為可延伸性標示語言文 首先，輸入來源資料（步驟s 料，讀取為根節點之指人銘接/攸來源資 S12)。指令可包括杳难、苗虹 κ麥数貢科（步驟 迴等，其中選擇指令以；5、庚、门4t人β Λ選擇以及遞 標示語-文件令是針對巢狀式可延伸性 可支援現行技術無法支援之文件結：7:二文件而設計’ 文岈所芾之參數。當來源資料為可延伸 > 料，目的資料為資料關聯式資料庫文件資 應之參數資料為可延伸性標示語述指令對 當來源資料為資料關聯式資料庫資料=節點資料。 性標示語言文件資料，則i述指 ^料為可延伸 料關聯式資料庫資料中的查詢結果資料了之參數資料為資 此樹狀結構具有指令節點，指令^ 每一指令節點具有零至數個參數節點，p •、用以存放指令， 應之參數資料。指令節點會構成樹狀^以指定與指令對 節點間的關係是根據指令於來源資料;#的階層，而指令 第一指令於來源資料包含第二指令時，的關係。亦即，當 此第一指令即為此第二指令的父代，而則於樹狀結構中， 此第一指令之子代（chi Id)。又當第一此^第二指令即成為 第二指令為平行關係時，則於樹狀红^令於來源資料與 〜構中，此第一指令與576995 V. Description of the invention (5) ^; Resources: ^ When the material is extensible markup language document data, when the formal database data, then Gankou Beizhu and Tian source shellfish is related data. Then the target data is the extensible markup language. First, input the source data (step s data, read as the inscription of the root node / source source S12). The instructions can include Martyrdom, Miao Hong κ, Mai Shu Gong Ke (step back, etc., where the selection instruction is selected; 5, Geng, Men 4t person β Λ selection and sign-file order is for nested scalability can be supported Documents that cannot be supported by the current technology: 7: Two documents are designed for the parameters of the text. When the source data is extensible > material, the destination data is the data related to the database. The markup command indicates that when the source data is data relational database data = node data, the language data is marked as the source data, then the reference data is the query result data in the extensible data relational database data. This tree structure has instruction nodes, each instruction node has zero to several parameter nodes, p •, is used to store instruction and corresponding parameter data. The instruction nodes will form a tree ^ to specify the nodes between instructions and instructions. The relationship of is according to the hierarchy of the instruction in the source data; #, and the relationship between the first instruction that contains the second instruction in the source data, that is, when this first instruction is the second instruction Generation, and in the tree structure, the child of this first instruction (chi Id). When the first and second instructions become the second instruction in a parallel relationship, the tree is red and the source information is AND ~ structure, this first instruction and
0213-8804twf(nl);STLjC-01-B9137;teresa.ptd 第9頁 576995 五、發明說明（6) _ =一指令亦為平行關係。當來源資料為一 庫資料，目的資料為一可延伸性標示語：：聯式資料 每一指令節點之後代尚具有零至數個輸身料時，則 與指令對應之輸出資料。 命點，用以存放 然後，依據上述樹狀結構，參考上 述；ί節點中之指令(步称S14)，並得到貝後料代:/ ί mi所述，參數資料為執行指令 於步驟S14中執行指令時，僅須參考其 所需之參數。 f節點，執行後即可得到後代節點所須之Y/咨所屬的參 後，將此參數資料分派至後n數資料。然 :12’直到所有參數處理完畢為：處：二畢：：到步称 破的方式進行。 4刀派可以各個擊 當來源資料為-資料關聯式資料庫資料 一可延伸性標示語言文件瞎，寸犀貢科，目的資料為 所得之資料輸出至目的資料c出節點時，將分派 判斷資料是否處理完畢（步㈣2)%m上（步驟S2〇)。 到步驟S12，直到所有資料處理* w未處理完畢則回 的方式可以先深後廣搜尋 70為止。上述指令執行 請參照第4圖，第4圖係;=太麻 樹狀結構示意圖，用以轉拖二^本發明所揭示之實施例的 源資料為-關聯式資料庫資:源資料為一目的資料，來 目的資料為-關聯以ίΚ;:，示語言文件 …件資料，來源資料與目的資；： 晒 第10頁 0213-8804twf(nl);STLC.〇i·腿7;teresa ptd 5769950213-8804twf (nl); STLjC-01-B9137; teresa.ptd page 9 576995 V. Description of the invention (6) _ = An instruction is also a parallel relationship. When the source data is a database data, and the destination data is an extensible markup :: Associated Data When each subsequent generation of the command node has zero to several input data, the output data corresponding to the command. The life points are used to store. Then, according to the above tree structure, refer to the above; the command in the ί node (step S14), and get the postscript: / ί mi, the parameter data is the execution instruction in step S14 When executing the instruction, it is only necessary to refer to its required parameters. f node. After execution, you can get the parameters of the Y / suffixes required by the descendant nodes, and assign this parameter data to the next n number of data. Then: 12’until all parameters are processed as follows: the place: the second complete :: the step is broken. The 4 knife pie can be individually assigned when the source data is-data relational database data-extensible markup language files, Congxi Gongke, and the destination data is output to the destination data c node. Whether the processing is completed (step 2) on% m (step S20). Go to step S12, until all the data processing * w is not processed, then the way back can be searched deep 70 first. Please refer to FIG. 4 for the execution of the above instructions. FIG. 4 is a schematic diagram of a ramie tree structure, which can be used to transfer the source data of the embodiment disclosed in the present invention is-related data base resources: source data is for one purpose. Data, the purpose of the data is-associated with ίΚ;:, language documents ... information, source data and purpose information ;: page 10 0213-8804twf (nl); STLC.〇i · leg 7; teresa ptd 576995
當來源資料為一可延伸性標示語言文件資料， 料為-資料關聯式資料庫資料時。首《，輪人來 料資 30 ,此參數資料為來源資料3〇之可延伸性標示该+ 節點資料。 。又件的 樹狀結構38，其具有指令節點344、346，用以 令。指令節點344具有參數節點344〇，參數節點344〇 9 與指令節點344對應之參數資料，亦即可延伸性標示語古 文件的節點資料的位置。指令節點346具有參數節點 3460 ,參數節點3460存放與指令節點346對應之參數資 料，亦即可延伸性標示語言文件的節點資料的位置。指令 節點344、346會構成樹狀結構38的階層，而指令節點7 344、346間的關係是根據指令於來源資料3〇中的關係。亦 即，當第一指令於來源資料3〇為第二指令來源資料的父代 時，則於樹狀結構38中，此第一指令即為此第二指令的父 代，而此第二指令即成為此第一指令之子代。又當第一指 令於來源資料30與第二指令為平行關係時，則於樹狀結構 38中，此第一指今與第二指令亦為平行關係。 依來源資料30讀取參數3440，執行指令344並分派執 行結果至後代。參數節點3460讀取父代的分派結果，執行 指令34 6。重覆上述參數節點讀取與執行的步驟，直到參 數讀取完畢為止。上述指令執行的方式是以先深後廣搜尋 方式完成。重覆上述讀取參數、執行指令並分派執行結果 至後代等步驟，直到資料讀取完畢為止。When the source data is extensible markup language document data, and the data is-data relational database data. First, "Renren comes with material 30. This parameter data is the extensibility of the source data 30, which indicates the + node data. . Another tree structure 38 has command nodes 344, 346 for commanding. The instruction node 344 has the parameter node 344o, and the parameter data corresponding to the instruction node 344, that is, the position of the node data of the extension markup ancient document. The instruction node 346 has a parameter node 3460, and the parameter node 3460 stores the parameter data corresponding to the instruction node 346, that is, the location of the node data of the extensible markup language file. The instruction nodes 344, 346 will constitute the hierarchy of the tree structure 38, and the relationship between the instruction nodes 7 344, 346 is based on the relationship of the instruction in the source data 30. That is, when the first instruction is the parent of the second instruction source data at source data 30, then in the tree structure 38, this first instruction is the parent of this second instruction, and this second instruction Become a child of this first instruction. When the first instruction is parallel to the source data 30 and the second instruction, then in the tree structure 38, the first instruction is also parallel to the second instruction. Read the parameter 3440 according to the source data 30, execute the instruction 344 and assign the execution result to future generations. Parameter node 3460 reads the dispatch result of the parent and executes instruction 34 6. Repeat the above steps of reading and executing the parameter node until the parameter reading is completed. The execution of the above instructions is done by searching in depth and then searching. Repeat the above steps of reading parameters, executing instructions, and dispatching execution results to descendants until the data is read.
--〇l-B9137;teresa.ptd 第11頁 576995--〇l-B9137; teresa.ptd p. 11 576995
請再參照第4 j 的樹狀結構示意圖 來源資料係為一關 文件資料，目的資 性標示語言文件資 之資料。 目，第4圖係顯示本 ，用以轉換一來源 聯式資料庫資料或 料係為一關聯式資 料，來源資料與目 發明所揭示之實施例 資料為一目的資料， 一可延伸性標示語言 料庫資料或一可延伸 的資料係為不同格式 當來源資料為一資料關 一可延伸性標示語言文件資 32，參數資料為來源資料32 果資料。 聯式資料庫資料，目的資料為 料時。首先，輸入來源資料 之資料關聯式資料庫的查詢結 樹狀結構36，其具有指令節點34〇、342，用以存放指 令。指令節點340具有參數節點340 0，參數節點34〇〇存放 與指令節點340對應之參數資料，亦即資料關聯式資料庫 =查询結果資料。指令節點342具有參數節點3420，參數 知點3 4 2 0存放與指令節點3 4 2對應之參數資料，亦即資料 關聯式資料庫的查詢結果資料。指令節點34〇、342會構成 樹狀結構34的階層，而指令節點34〇、342間的關係是根據 指令於來源資料32中的關係。亦即，當第一指令於來源資 料32與第二指令的來源資料為主從關係（Master-Detail) 時’則於樹狀結構3 6中，此第一指令即為此第二指令的父 代’而此第二指令即成為此第一指令之子代。又當第一指 令於來源資料32與第二指令為平行關係時，則於樹狀結構 34中’此第一指令與第二指令亦為平行關係。指令節點 340尚具有一後代為輸出節點的340 2，用以指定與指令節Please refer to the schematic diagram of the tree structure in Section 4j. The source data is a document, and the purpose of the document indicates the language of the document. Figure 4 is a display book, which is used to convert a source associative database data or material into a relational data, the source data and the embodiment data disclosed by the invention are a purpose data, an extensible markup language The database data or an extensible data are in different formats. When the source data is a data, an extensibility markup language file is 32, and the parameter data is the source data. The data of the joint database, the target data is the time. First, a query structure of a data relational database of input source data is provided. The tree structure 36 has instruction nodes 34 and 342 for storing instructions. The instruction node 340 has a parameter node 3400, and the parameter node 3400 stores parameter data corresponding to the instruction node 340, that is, a data relational database = query result data. The command node 342 has a parameter node 3420, and the parameter knowledge point 3 4 2 0 stores parameter data corresponding to the command node 3 4 2, that is, the query result data of the data relational database. The command nodes 34o and 342 constitute a hierarchy of the tree structure 34, and the relationship between the command nodes 34o and 342 is based on the relationship of the command in the source data 32. That is, when the first instruction in the source data 32 and the second instruction's source data are in a master-detail relationship ('Master-Detail'), then the first instruction is the parent of the second instruction. Generation 'and this second instruction becomes a child of this first instruction. When the first instruction is parallel to the second instruction in the source data 32, the first instruction and the second instruction in the tree structure 34 are also in parallel relationship. The instruction node 340 also has a descendant 340 2 which is used to specify the instruction section.
0213.8804twf(nl);STLC.01.B9137;teresa.ptd 第12頁 576995 五、發明說明（9) = 3^0中之指令對應之輸出資料，指令節點342尚具有一 厂：、、輪出節點的3422，用以存放與指令節點342中 」 對應之輸出資料。 < 和令 姓由系統外部變數設定3400，執行指令340並分派執行 結果至後代。輸出節點3402讀取父代分派結果並輪出 t2、’參數節點3420讀取父代的分派結果以執行指令342， 二派執行結果至後代。輸出節點3422讀取父代分派結果並 i出314重覆讀取父代的分派結果以執行指令並分派執’ 至後代之步驟，直到讀取完畢為止。若資料尚未處 凡畢，則重覆如上述讀取未處理資料，設定參數，執 指令，分派執行結果至後代等步驟直到資料讀取完畢為 止。上述指令執行的方式是以先深後廣搜尋方式完成。 藉以之i本發明所提出之方法，其利用_樹狀結構， 可μ 由从Γ來源資料為一目的資料，實現關聯式資料庫與 可I伸性標不語言文件間之資料轉換，有效地解決現枯 =題，達到本發明所欲達到之目的。特別在 複雜的表格結構、#固定的可延伸性標示語言文件 式的可延伸性標示語言文件以及動態的 文件資料轉換技術上，有相當大的改善。 ‘不扣5 雖然本發明已以較佳實施例揭露如上，然其並 限定本發明，任何熟習此技藝者，在不脫離本發明之 圍内由Ϊ可作5動與_，因此本發明之保護範圍當 視後附之申睛專利範圍所界定者為準。0213.8804twf (nl); STLC.01.B9137; teresa.ptd Page 12 576995 V. Invention output (9) = output data corresponding to the instruction in 3 ^ 0, the instruction node 342 still has a factory: ,, rotation The node 3422 is used to store the output data corresponding to the "instruction node 342". < The surname is set to 3400 by the external variable of the system, executes the instruction 340 and assigns the execution result to the descendants. The output node 3402 reads the parent's dispatch result and turns out t2. The 'parameter node 3420 reads the parent's dispatch result to execute the instruction 342, and the second dispatch execution result to the descendants. The output node 3422 reads the parent's dispatch result and repeats the step 314 to read the parent's dispatch result to execute the instruction and dispatch execution to the descendants until the reading is completed. If the data has not been processed, repeat the above steps to read the unprocessed data, set the parameters, execute the instructions, and assign the execution results to the descendants until the data is read. The execution of the above instructions is done by searching in depth and then searching. Based on the method proposed by the present invention, it uses the _ tree structure to achieve the data conversion between the relational database and the extensible markup language from the source data of Γ as a purpose data, effectively Solve the current problem and achieve the purpose of the present invention. Especially in the complex table structure, # fixed extensible markup language files, extensible markup language files and dynamic document data conversion technology, there are considerable improvements. '不 扣 5 Although the present invention has been disclosed in the preferred embodiment as above, it does not limit the present invention. Anyone skilled in this art can do 5 actions and _ without departing from the scope of the present invention. The scope of protection shall be determined by the scope of the attached patent.
圖式簡單說明 第1圖係顯示本發明所揭示之實施例中可延 語言文件資料至資料庫資料轉換的功能*意圖。示不 第2圓係顯示本發明所揭示之實施 可延伸性標示語言文件資料轉換的功能示意貢圏枓。庫資枓至 第3圖係顯示本發明所揭示之實施例 第4圖係顯示本發明所措千夕眘#如μ =订机程圖。 圓。 令货Η所揭不之實靶例的樹狀結構示意 符號說明 100 —可延伸性標示語言文件資料； 102可延伸性標示語言文件資料與樹狀結構之對 應； 104 —樹狀結構； 106—資料庫資料與樹狀結構之對應； 108 —資料庫資料； 30-可延伸性標示語言文件資料； 3 2 —資料庫資料； 34 —樹狀結構； 340、342、344、346 —指令節點； 、3420、3440、3460 —參數節點； 、3422 -輸出資料； 對應 3 0 2可延伸性標示語言文件資料至樹狀結構之 306 —樹狀結構至資料庫資料之對應； 310 —資料庫資料至樹狀結構之對應； 576995Brief Description of the Drawings Fig. 1 is a diagram showing the function * intent of extending the conversion of language file data to database data in the embodiment disclosed by the present invention. The second circle shows the functions of the extensible markup language document data conversion disclosed in the present invention. Figures 3 through 3 show the embodiment disclosed by the present invention. Figure 4 shows the measures taken by the present invention. # 如 μ = booking schedule. circle. Make the tree structure schematic symbol explanation of the actual target uncovered by the cargo container 100—Extensible Markup Language Documents and Data 102 correspond to the Extensible Markup Language Documents and Tree Structures 104—Tree Structures 106— Correspondence between database data and tree structure; 108 — database data; 30 — extensible markup language file data; 3 2 — database data; 34 — tree structure; 340, 342, 344, 346 — instruction nodes; , 3420, 3440, 3460 — parameter nodes;, 3422 — output data; Corresponds to 302 extensible markup language file data to the tree structure 306 — Tree structure to database data correspondence; 310 — Database data to Correspondence of tree structure; 576995
0213-8804twf(nl);STIjC-01-B9137;teresa.ptd 第15頁0213-8804twf (nl); STIjC-01-B9137; teresa.ptd Page 15