201207645 六、發明說明： 【發明所屬之技術領域】 [⑽1] 本發明涉及一種資料庫管理方法，尤其是關於一種在資 料模型中查找參數的方法。 【先前技#ί】 [0002] TR-069全稱為“CPE廣域網管理協議”，其規定了家庭 閘道器進行遠端管理配置時的通用框架和協議。TR-098 定義了透過TR-069管理的所有網路設備的資料模型（ data model) ° [0003] TR-098定義的一個網路設備的資料模型包括各種類型的 資料物件（data object)及配置參數（configuration parameters ) 。 在TR-098 中 ，所有 的資料物件及 配置參數都是以目錄樹（directory tree)的形式分等 級命名的（例如A · D. F. L )，每一等級由字串（ str ing )組成。 [0004] 每個資料模型的根節點（root node)只有一個，而資料 物件可以看做是資料模型中的一個群組，每個資料物件 又可以包含其他資料物件或配置參數。配置參數必定是 目錄樹中最末端的葉子節點，用戶根據每個配置參數的 資料路徑可以找到其相對應的訪問函數（access func-t i on) ° [0005] 目前，在網路伺服器中查找配置參數的方法是：接收用 戶輸入的字串，以字串中的字元為關鍵字並依據出現的 先後順序在網路伺服器中查找匹配的配置參數。由於資 料模型中的許多配置參數的名稱中包括相同的字元，當 099126694 表單編號 A0101 第 4 頁/共 19 頁 0992046830-0 201207645 這種查找方法較為費時 查找的配置參數的名稱較長時， 〇 【發明内容】 [0006] [0007] [0008] 〇 [0009] [0010] [0011] [0012] [0013] 鑒於以上内容，有必要提出一種在資料模型中查找參數 的方法，可以節省查找時間，提高查找效率。 一種在資料模型中查找參數的方法，該方法包括以下步 驟： 提供第一哈希表，用於儲存資料模型中所有葉子節點處 的配置參數名稱的索引值； 提供第二哈希表，用於儲存資料模型中重複配置參數的 完整資料路徑的索引值； 接收用戶輸入的字串並讀取字串中最後一個字元； 在第一哈希表中查找與該最後一個字元對應的索引值； 及 若在第一哈希表中查找到該字元有不重複的索引值，則 將所述字串中的餘下字元依出現順序自後向前與資料模 型中對應的葉子節點的父節點自下向上逐級進行比較， 以查找與該字串匹配的配置參數在資料模型中的完整資 料路徑，或者，若在第一哈希表中查找到該字元有重複 的索引值，則在第二哈希表中查找所述字串對應的索引 值，根據該第二哈希表中該字串對應的索引值查找與該 字串匹配的配置參數在資料模型中的完整資料路徑。 相較於習知技術，本發明所提供之在資料模型中查找參 099126694 表單編號A0101 第5頁/共19頁 0992046830-0 201207645 數的方法，根據葉子節點查找父節點的方式在資料模型 中查找與用戶輸人的字串匹配的配置參數的完整資料路 。對於重複的配置參數，則根據其不同的資料路捏進 行查找。由於每個葉子節點的每—級父節點都是唯―的 ’故該方法可以有效減少錢時間，提高查找效率。 【實施方式】 [0014] [0015] [⑻ 16] 099126694 參閱圖1所示，係本發明在資料模型中查找參數的方法較 佳實施例之流程圖。該方法可以應用在類似於TR^ 料模型中。 貝 步驟s1(n，提供第-哈希表，用於料資料模型中所有 葉子節點處的配置參數名稱㈣引值1第—哈希表錯 存在儲存裝置，例如記憶禮或外部儲存器。在該第一哈 希表中，代表配置參數名稱的字元為關鍵字每個關鍵 字映射到-個索引值，每個索引值映射到—個資料路後 記錄。在TR-098資料模型中，資料路經由字元和數_ ΤΤΓ*. » * 參閱圖2所示，係—財數_(她model)之樹狀 結構圖。其巾’圓形絲該參數㈣中的資料物件（ _ 〇bject) ’方形代表該參數模型中的配置參數（ configuration parameter) , ^ fe ^ ^ 資+物件的編號（lnstance)。在資料模型中 一性的資料物件稱作靜態物件（邮 ;、有唯 -資料路徑下具有不同編號相同名稱，ec ’同 用戶需要動態產生的，故稱 貝料物件是根據 ^故稱做動態物件（ri · ject)。相應地，靜態物件的 ynamic ob_ 表單編號_丨 ^61 ’數稱作靜態參數（ 第6頁/共19頁 0992046830-0 201207645 - static parameter)，動態物件的配置參數稱作動態 參數（dynamic object)。例如，在圖2所示的資料模 型中，配置參數包括B， G， I， J， Κ， Μ， N， 0 ，其中靜態參數包括B， G， I， J， K，動態參數包 括Μ，N，0,重複的參數包括G，K，M;資料物件包 括A，C，D，E，Η > F，L，靜態物件包括A，C ，D，E，F，動態物件包括H，L，重複的物件包括F ，Η 〇 ^ [0017] 〇 參閱圖3所示，係對圖2中所示參數模型的所有葉子節點 處的配置參數構建的第一哈希表之示意圖。 [0018] 步驟S1 03，提供第二哈希表，用於儲存資料模型中重複 配置參數的完整資料路徑的索引值。該第二哈希表儲存 在儲存裝置。在該第二哈希表中，代表配置參數完整資 料路徑的字串為關鍵字，每個關鍵字映射到一個索引值 ，每個索引值映射到一個資料路徑記錄。 [0019] 〇 由於參數模型中存在重複的配置參數，所以在第一哈希 表中存在相同的索引值。例如圖2中所示的資料模型包括 重複的參數G， Κ， Μ，則在圖3所示的第一哈希表中存 在重複的索引值2，5，6。故當用戶輸入這些重複的參數 時，無法從第一哈希表查找到唯一的索引值，進而無法 從儲存裝置中找到唯一的資料路徑記錄。然而，這些重 複參數在資料模型中的資料路徑是不相同的，例如，重 複參數G在圖2所示的資料模型中有兩個不同的資料路徑 A. C. G及A. D. G，重複參數Κ有兩個不同的資料路徑 A. C. F. Κ及A. D. F. Κ。 099126694 表單編號A0101 第7頁/共19頁 0992046830-0 201207645 [0020] 參閱圖4所示’是對圖2中 斤不貝科杈型的重複配置參數 的一貧科路徑構建的第二哈希表之示意圖。 [0021]201207645 VI. Description of the Invention: [Technical Field to Which the Invention Is Applicated] [(10) 1] The present invention relates to a database management method, and more particularly to a method for finding parameters in a data model. [Previous Technology #ί] [0002] TR-069 is a full name of the "CPE WAN Management Protocol", which specifies the general framework and protocol for home gateway configuration for remote management. TR-098 defines the data model of all network devices managed by TR-069. [0003] The data model of a network device defined by TR-098 includes various types of data objects and configurations. Configuration parameters. In TR-098, all data objects and configuration parameters are named in the form of a directory tree (for example, A · D. F. L ), and each level consists of a string ( str ing ). [0004] There is only one root node for each data model, and the data objects can be regarded as a group in the data model, and each data object can contain other data objects or configuration parameters. The configuration parameter must be the leaf node at the end of the directory tree. The user can find the corresponding access function according to the data path of each configuration parameter (access func-t i on) ° [0005] Currently, in the network server The configuration parameter is obtained by receiving a string input by the user, using the characters in the string as keywords, and searching for matching configuration parameters in the network server according to the order of occurrence. Since the names of many configuration parameters in the data model include the same characters, when 099126694 Form No. A0101 Page 4 of 19 0992046830-0 201207645 This search method is more time-consuming to find the name of the configuration parameter is longer, 〇 [0007] [0007] [0008] [0009] [0010] [0013] In view of the above, it is necessary to propose a method for searching for parameters in a data model, which can save search time. Improve search efficiency. A method for finding a parameter in a data model, the method comprising the steps of: providing a first hash table for storing an index value of a configuration parameter name at all leaf nodes in the data model; providing a second hash table for Storing the index value of the complete data path of the configuration parameter in the data model; receiving the string input by the user and reading the last character in the string; searching for the index value corresponding to the last character in the first hash table And if it is found in the first hash table that the character has a non-repeating index value, the remaining characters in the string are from the back to the parent of the corresponding leaf node in the data model in the order of appearance. The node compares step by step from bottom to top to find the complete data path of the configuration parameter matching the string in the data model, or if the character in the first hash table is found to have a duplicate index value, Searching, in the second hash table, an index value corresponding to the string, and searching, according to the index value corresponding to the string in the second hash table, a configuration parameter matching the string in the data model. Full data path. Compared with the prior art, the present invention provides a method for searching for a number of 099126694 form number A0101, page 5/19 pages 0992046830-0 201207645 in the data model, and searching in the data model according to how the leaf node looks up the parent node. The complete data path of the configuration parameters that match the string entered by the user. For repeated configuration parameters, they are searched according to their different data paths. Since each-level parent node of each leaf node is unique, this method can effectively reduce the time and improve the search efficiency. [Embodiment] [0015] [(8) 16] 099126694 Referring to Figure 1, there is shown a flow chart of a preferred embodiment of the method for finding parameters in a data model of the present invention. This method can be applied in a model similar to the TR^ material. Step s1 (n, provide a first-hash table for the configuration parameter name at all leaf nodes in the material data model. (4) The value 1 - the hash table is stored in a storage device, such as a memory device or an external storage device. In the first hash table, the character representing the configuration parameter name is a keyword, and each keyword is mapped to an index value, and each index value is mapped to a data path post record. In the TR-098 data model, The data path is based on the character and number _ ΤΤΓ*. » * See Figure 2, the tree-like structure of the fiscal number _ (her model). The data object in the parameter '(circle) of the towel's round wire ( _ 〇 Bject) 'square represents the configuration parameter in the parameter model, ^ fe ^ ^ + object number (lnstance). In the data model, the one-piece data object is called static object (post; Under the data path, there are different names with the same name, ec 'the user needs to dynamically generate, so the bedding object is called dynamic object (ri · ject) according to ^. Correspondingly, the dynamic ob_ form number of the static object _ 丨 ^ 61 'number is called static parameter ( 6 pages / 19 pages 0992046830-0 201207645 - static parameter), the dynamic object configuration parameters are called dynamic objects. For example, in the data model shown in Figure 2, the configuration parameters include B, G, I, J, Κ, Μ, N, 0, where the static parameters include B, G, I, J, K, the dynamic parameters include Μ, N, 0, the repeated parameters include G, K, M; the data objects include A, C, D, E, Η > F, L, static objects including A, C, D, E, F, dynamic objects including H, L, repeated objects including F, Η 〇 ^ [0017] 〇 see Figure 3, A schematic diagram of a first hash table constructed for configuration parameters at all leaf nodes of the parameter model shown in Figure 2. [0018] Step S1 03, providing a second hash table for storing repeated configuration parameters in the data model The index value of the complete data path. The second hash table is stored in the storage device. In the second hash table, the string representing the complete data path of the configuration parameter is a keyword, and each keyword is mapped to an index value. Each index value is mapped to a data path record. [0019] 〇 Since there are duplicate configuration parameters in the parameter model, the same index value exists in the first hash table. For example, the data model shown in FIG. 2 includes repeated parameters G, Κ, Μ, as shown in FIG. There are duplicate index values 2, 5, and 6 in the first hash table. Therefore, when the user inputs these repeated parameters, the unique hash value cannot be found from the first hash table, and thus the unique device cannot be found from the storage device. Data path record. However, the data paths of these repeated parameters in the data model are different. For example, the repeating parameter G has two different data paths AC G and AD G in the data model shown in Figure 2, and there are two duplicate parameters. Different data paths are ACF and ADF. 099126694 Form No. A0101 Page 7 / Total 19 Page 0992046830-0 201207645 [0020] Referring to Figure 4, the second hash constructed as a poor path for the repeated configuration parameters of Figure 2 Schematic diagram of the table. [0021]
步驟S105， 字元。例如 後一個字元J 後一個字元G。 接收用戶輪入的字串並讀取字串 用戶輪入字串“A. D. F. J” ，若用戶輪入字串“A. c. G” 中最後一個 ’則讀取最 ’則讀取最 [0022] [0023] [0024] [0025] 步驟S107，在第一也杳本 。希表中查找與該最後一個字元對應 的索引值。 〜 /驟S1 G 9，簡是否錄-哈希麟難到與該最後— 字兀對應的索引值。如果未在第一哈希表中查找到與 :取後個字謂應的索引值則提示用戶輸入錯誤， 流程結束1在第-哈希表中查找到與該最後—個字元 對應的索引值，則進入步驟SI 11。 步驟S111，判斷是否在第—哈希表中查找㈢重複的索引 值。如果未在第—哈希表中查找龜㈣索引值，例如 子元J在第-哈希表中有唯，的索引值4，則流程進入步 驟S113 。 步驟S113 ’將字串中的餘下社依出現順序自後向前與 第哈希表中該索引值對應的資料模型中的葉子節點的 父節點自下向上逐級進行比較。例如，將字串中“A. F. J的餘下字元A，D，F按照自後向前的順序ρ ’ d ，A與圖2所示的資料模型中葉子節點j自下向上的父節點 F，D，A分別進行比較。 [0026] 099126694 步驟SI 1 5 ’判斷該字串中的餘下字元自後向前是否分別 表單蝙號A0101 第8頁/共μ頁 0992046830-0 201207645 與該葉子節點自下向上的父節點一一匹配。若不一一匹 、則提不用戶輸人錯誤，流程結束。若_ —匹配，則 進入步驟S117 ’判斷查找到與該字串匹配的配置參數在 資料模型中的完整資料路徑。如圖5所示所有非重複的 配置參數，例如B，1小N，。，可以根據其在第-哈希 表中的唯-索引值找到唯_的資料路徑記錄。例如，配 置參數J在第-哈希表中的索引值4指向資料路徑記錄“ M〇_A一D_Fj—ptr”。Step S105, a character. For example, the next character J is followed by a character G. Receive the user-entered string and read the string user to enter the string "ADF J". If the user enters the last one in the string "A. c. G", then read the most - then read the most [0022 [0025] [0025] Step S107, in the first is also a copy. The index value corresponding to the last character is found in the hash table. ~ /Step S1 G 9, Jane is recorded - Hashilin is difficult to match the index value corresponding to the last - word. If the index value of the next word is not found in the first hash table, the user is prompted to input an error, and the process end 1 finds the index corresponding to the last character in the hash table. The value proceeds to step S11. In step S111, it is judged whether or not the (3) repeated index value is found in the first hash table. If the turtle (four) index value is not found in the first-hash table, for example, if the child J has a unique index value of 4 in the hash-time table, the flow advances to step S113. Step S113' compares the remaining members of the string in the order of appearance from the bottom to the parent node of the leaf node in the data model corresponding to the index value in the hash table from bottom to top. For example, in the string, "the remaining characters A, D, F of AF J are in the order from back to front ρ ' d , A and the parent node F of the leaf node j from bottom to top in the data model shown in FIG. 2, D, A are compared separately. [0026] 099126694 Step SI 1 5 'Determine whether the remaining characters in the string are from the back to the front respectively. Form bat number A0101 Page 8 / Total μ page 0992046830-0 201207645 with the leaf node The parent nodes from the bottom up are matched one by one. If there is no one, then the user is not mistaken, and the process ends. If _-match, then go to step S117 'determine to find the configuration parameters matching the string in the data. The complete data path in the model. As shown in Figure 5, all non-repeating configuration parameters, such as B, 1 small N, can be found based on the only-index value in the first-hash table. For example, the index value 4 of the configuration parameter J in the first-hash table points to the data path record "M〇_A_D_Fj_ptr".
_⑹果在步驟川！中，判斷在第一哈希表中查找到重複的 索引值，則流程進入步驟S119。如圖5所示，重複的配置 參數，例如G，K，Μ，由於其在第—哈希表中有重複的索 引值’故根據該重複的索引值無法找到唯一的資料路徑 記錄。例如，重複配置參數G在第一哈希表中的索引值2 指向的資料路徑記錄為“ NULL” 。 闕j^S119，在第二哈希表中查找該字串對應的索引值。 _ #驟512卜判斷是否從第二哈希表中查找到該字串對應 的索引值。如果未從第二哈希表令查找到該字串對應的 索引值，則提示用戶輸入錯誤，流程結束。如果從第二 哈希表中查找到該字串對應的索引值，則進入步驟SU7 ，根據第二哈希表中該字串對應的索引值查找到與該字 串匹配的配置參數在資料模型中的完整資料路徑。如圖6 所示，表示重複配置參數的完整資料路徑的字串可以根 據其在第·—哈希表中的索引值找到唯一的資料路徑記錄 。例如字串“A. C. G”在第二哈希表中的索引值丨指向 資料路徑記錄Mo_A_C_G_Ptr。 099126694 表單編號A0101 第9頁/共]9頁 0992046830-0 201207645 [0030] 由於在TR-98的資料模型中，所有的元素，例如資料物件 、配置參數都是已知的、固定的，所以本實施例給出的 在資料模型中查找參數的方法可以應用在資料模型的編 譯階段，從而優化後續的查找功能。 [0031] 最後應說明的是，以上實施方式僅用以說明本發明的技 術方案而非限制，儘管參照較佳實施方式對本發明進行 了詳細說明，本領域的普通技術人員應當理解，可以對 本發明的技術方案進行修改或等同替換，而不脫離本發 明技術方案的精神和範圍。 【圖式簡單說明】 [0032] 圖1係本發明在資料模型中查找參數的方法較佳實施例之 流程圖。 [0033] 圖2係一個資料模型之樹狀結構圖。 [0034] 圖3係第一哈希表之示意圖。 [0035] 圖4係第二哈希表之示意圖。 [0036] 圖5係在第一哈希表中查找配置參數之結果示意圖。 [0037] 圖6係在第二哈希表中查找重複配置參數的完整資料路徑 之結果不意圖。 【主要元件符號說明】 [0038] 提供第一哈希表，用於儲存資料模型中所有葉子節點處 的配置參數名稱的索引值S101 [0039] 提供第二哈希表，用於儲存資料模型中重複配置參數的 完整資料路徑的索引值S103 099126694 表單編號A0101 第10頁/共19頁 0992046830-0 201207645 [0040] [0041] [0042] [0043] [0044] ❹ [0045] [0046] [0047] 〇 [0048] 接收用戶輸入的字串並讀取字串中最後一個字元S105 在第一哈希表中查找與該最後一個字元對應的索引值 S107 判斷是否在第一哈希表中查找到與該最後一個字元對應 的索引值S109 判斷是否在第一哈希表中查找到重複的索引值S111 將字串中的餘下字元依出現順序自後向前與第一哈希表 中該索引值對應的資料模型中的葉子節點的父節點自下 向上逐級進行比較S113 判斷該字串中的餘下字元自後向前是否分別與該葉子節 點自下向上的父節點——匹配S115 判斷查找到與該字串匹配的配置參數在資料模型中的完 整資料路徑S117 在第二哈希表中查找該字串對應的索引值S119 判斷是否從第二哈希表中查找該字串對應的索引值S121 099126694 表單編號Α0101 第11頁/共19頁 0992046830-0_(6) fruit in the step Chuan! If it is judged that the repeated index value is found in the first hash table, the flow advances to step S119. As shown in Figure 5, repeated configuration parameters, such as G, K, Μ, because of their repeated index values in the first-hash table, cannot find a unique data path record based on the repeated index values. For example, the data path pointed to by the repeated configuration parameter G in the index value 2 of the first hash table is "NULL".阙j^S119, searching for the index value corresponding to the string in the second hash table. _ #STEP 512 determines whether the index value corresponding to the string is found from the second hash table. If the index value corresponding to the string is not found from the second hash table, the user is prompted to input an error, and the process ends. If the index value corresponding to the string is found from the second hash table, proceed to step SU7, and the configuration parameter matching the string is found in the data model according to the index value corresponding to the string in the second hash table. The complete data path in . As shown in Figure 6, the string representing the complete data path of the repeated configuration parameters can find a unique data path record based on its index value in the -hash table. For example, the index value of the string "A. C. G" in the second hash table 丨 points to the data path record Mo_A_C_G_Ptr. 099126694 Form No. A0101 Page 9/Total] 9 Page 0992046830-0 201207645 [0030] Since all elements, such as data objects and configuration parameters, are known and fixed in the data model of TR-98, The method for finding parameters in the data model given in the embodiment can be applied in the compilation phase of the data model to optimize the subsequent search function. [0031] It should be noted that the above embodiments are merely illustrative of the technical solutions of the present invention and are not intended to be limiting, and the present invention will be described in detail with reference to the preferred embodiments. The technical solutions are modified or equivalently substituted without departing from the spirit and scope of the technical solutions of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS [0032] FIG. 1 is a flow chart of a preferred embodiment of a method for finding parameters in a data model of the present invention. [0033] FIG. 2 is a tree structure diagram of a data model. 3 is a schematic diagram of a first hash table. 4 is a schematic diagram of a second hash table. [0036] FIG. 5 is a diagram showing the result of searching for configuration parameters in the first hash table. [0037] FIG. 6 is a result of the search for a complete data path of repeated configuration parameters in the second hash table. [Key Element Symbol Description] [0038] A first hash table is provided for storing an index value S101 of configuration parameter names at all leaf nodes in the data model. [0039] A second hash table is provided for storing the data model. The index value of the complete data path of the repeated configuration parameter S103 099126694 Form number A0101 Page 10/19 pages 0992046830-0 201207645 [0044] [0044] [0044] [0046] [0047] 〇[0048] receiving the string input by the user and reading the last character S105 in the string, searching for the index value S107 corresponding to the last character in the first hash table, determining whether it is in the first hash table Finding the index value S109 corresponding to the last character, determining whether the repeated index value S111 is found in the first hash table, and the remaining characters in the string are from the back to the first hash table in the order of appearance. The parent node of the leaf node in the data model corresponding to the index value is compared step by step from bottom to top. S113. Determine whether the remaining characters in the string are from the back to the front and the parent node from the bottom to the leaf node respectively. Match S115 judgment Finding the complete data path S117 of the configuration parameter matching the string in the data model, searching for the index value corresponding to the string in the second hash table S119, determining whether to search for the corresponding string from the second hash table. Index value S121 099126694 Form number Α0101 Page 11 / Total 19 pages 0992046830-0