Patent ID: 8280890
Filing Date: 2012-10-02
Classification: G06F

Abstract:
1. A computer-based method for searching parameters in a data model, comprising: (a) creating a first hash table for storing index values of parameter names in the data model, where each parameter name corresponds to a leaf node in a hierarchical tree of the data model; (b) creating a second hash table for storing index values of data paths of duplicate parameter names in the data model; (c) reading a last character of an input data string; (d) computing an index value of the last character, and searching for the index value of the last character in the first hash table, ending the procedure if the index value of the last character does not exist in the first hash table, or going to block (e) if the index value of the last character exists in the first hash table; (e) determining if the last character has duplicate index values in the first hash table, going to block (f) if the last character has duplicate index values in the first hash table, or going to block (g) if the last character has a unique index value in the first hash table; (f) computing a total index value of all characters in the input data string, and searching for the total index value in the second hash table, ending the procedure if the total index value does not exist in the second hash table, or determining a data path of a parameter matching the last character of the input data string in the data model according to the first hash table if the total index value exists in the second hash table; and (g) comparing the remaining characters one at a time in the data string in a reverse order with a corresponding parent node of a leaf node represented by the last character in the hierarchical tree of the data model, ending the procedure if any of the remaining characters does not match a corresponding parent node of the leaf node, or determining a data path of a parameter matching the last character of the input data string in the data model according to the first hash table if each of the remaining characters matches a corresponding parent node of the leaf node.