CN115292344A

CN115292344A - Data dictionary construction method and device, electronic equipment and storage medium

Info

Publication number: CN115292344A
Application number: CN202210925656.9A
Authority: CN
Inventors: 陈力; 尹泓钦; 刘伦; 李若; 张岱彬
Original assignee: China Construction Bank Corp; CCB Finetech Co Ltd
Current assignee: China Construction Bank Corp; CCB Finetech Co Ltd
Priority date: 2022-08-03
Filing date: 2022-08-03
Publication date: 2022-11-04

Abstract

The application relates to the technical field of data processing, and provides a data dictionary construction method, a data dictionary construction device, electronic equipment and a storage medium, wherein the method comprises the following steps: acquiring a coding initial value of a data dictionary; the encoding initial value is used for marking dictionary options corresponding to the root node; aiming at each node level of the data dictionary, when a dictionary option is newly added in the node level, calculating dictionary codes corresponding to the dictionary options in the node level based on code values corresponding to the node level; each dictionary option corresponds to a unique dictionary code; the size of the coding value corresponding to each node level is determined by the coding initial value, and the bit number of the coding value corresponding to each node level is determined by the level number from the root node; and splicing the dictionary codes of the newly added dictionary options after the corresponding code values of the previous node level to form a data dictionary. The data dictionary is formed by the coding mode, the operation is simple, the formed data dictionary supports the user to modify dictionary options, and the flexibility is high.

Description

Data dictionary construction method and device, electronic equipment and storage medium

Technical Field

The present application relates to the field of data processing technologies, and in particular, to a data dictionary construction method and apparatus, an electronic device, and a storage medium.

Background

With the rapid development of the internet, people are entering the big data era, and in an information management system, a data dictionary is widely applied, for example, addresses are required to be filled when sending an express, business types are required to be selected when handling banking business, and the like, and the data dictionary plays an important role in filling data in a standardized way and accurately classifying and counting data.

In the prior art, the data range can be determined, the information of the target structure data table can be obtained from the data range, and then the data dictionary is established according to the target structure data table.

However, the options of the data dictionary are fixed, user modification is not supported, flexibility is poor, and if the data dictionary is modified, the participation of technicians is required, and a manual maintenance mode is time-consuming and labor-consuming.

Disclosure of Invention

The application provides a data dictionary construction method, a data dictionary construction device, electronic equipment and a storage medium, dictionary options in a constructed data dictionary can be changed at will, and due to the fact that each dictionary option is set to correspond to a unique dictionary code, although the dictionary options are changed, the dictionary codes cannot be changed, and flexibility is high.

In a first aspect, the present application provides a method for constructing a data dictionary, where the data dictionary has a tree structure and is composed of multiple node hierarchies, and the method includes:

acquiring a coding initial value of a data dictionary; the encoding initial value is used for marking dictionary options corresponding to the root node;

for each node level of the data dictionary, when a dictionary option is newly added in the node level, calculating dictionary codes corresponding to the dictionary options in the node level based on the code values corresponding to the node level; each dictionary option corresponds to a unique dictionary code; the node levels comprise at least one dictionary option, the size of the coding value corresponding to each node level is determined by the coding initial value, and the bit number of the coding value corresponding to each node level is determined by the level number of the distance root node;

and splicing the dictionary codes of the newly added dictionary options after the corresponding code values of the previous node level to form a data dictionary.

Optionally, calculating the dictionary code corresponding to the dictionary option in the node hierarchy based on the code value corresponding to the node hierarchy, includes:

acquiring the number N of initial dictionary options in the node hierarchy; n is a positive integer greater than or equal to 0;

calculating dictionary codes corresponding to the newly added dictionary options based on the number of the initial dictionary options; and the newly added dictionary code is the code value corresponding to the node level plus N +1.

Optionally, the method further includes:

before adding a dictionary option in the node level, judging whether the node level has a homonymy option corresponding to the added dictionary option;

if not, the dictionary option is newly added;

and if so, returning first message prompt information to remind the user that the newly added dictionary options cannot be increased.

Optionally, the method further includes:

receiving a first instruction of a dictionary option to be modified sent by a client, and inquiring whether the same dictionary option to be modified exists in a data dictionary table or not based on the first instruction; the data dictionary table stores dictionary options of all node levels and dictionary codes corresponding to the dictionary options;

if not, modifying the dictionary option to be modified, but not modifying the dictionary code corresponding to the dictionary option to be modified;

and if the dictionary option to be modified exists, returning second message prompt information to remind the user that the dictionary option to be modified cannot be modified.

Optionally, the method further includes:

responding to a touch operation of a user, and inquiring dictionary options of a specific node level based on the touch operation;

acquiring identification information corresponding to a dictionary option of a specific node level, wherein the identification information is used for indicating whether the dictionary option is forbidden or not;

returning a query result based on the identification information; the query result is a dictionary option that is not disabled in the particular node hierarchy.

Optionally, the method further includes:

acquiring keywords input by a user, and judging whether dictionary options with the matching degree with the keywords larger than a preset threshold exist in the data dictionary or not based on the keywords;

if yes, feeding back the dictionary option for the user to determine;

and if the keyword does not exist, returning third message prompt information to remind the user that the dictionary option corresponding to the keyword does not exist.

Optionally, the method further includes:

acquiring a data dictionary table corresponding to a data dictionary, wherein the data dictionary table stores an incidence relation corresponding to each node level;

receiving a second instruction sent by a client, wherein the second instruction is used for counting dictionary options of a specified node level and a node level adjacent to the specified node level;

and collecting corresponding dictionary options in the data dictionary table based on the second instruction, and feeding back the collected result to the client.

In a second aspect, the present application provides a data dictionary constructing apparatus, where the data dictionary has a tree structure and is composed of a plurality of node hierarchies, and the apparatus includes:

the acquisition module is used for acquiring the coding initial value of the data dictionary; the encoding initial value is used for marking dictionary options corresponding to the root node;

the calculation module is used for calculating dictionary codes corresponding to the dictionary options in the node hierarchy based on the code values corresponding to the node hierarchy when a dictionary option is newly added in the node hierarchy aiming at each node hierarchy of the data dictionary; each dictionary option corresponds to a unique dictionary code; the node level comprises at least one dictionary option, the size of the coding value corresponding to each node level is determined by the coding initial value, and the bit number of the coding value corresponding to each node level is determined by the level number from the root node;

and the splicing module is used for splicing the dictionary codes of the newly added dictionary options after the corresponding code values of the previous node level to form a data dictionary.

In a third aspect, the present application provides an electronic device, comprising: a processor, a memory, and a computer program; wherein the computer program is stored in the memory and configured to be executed by the processor, the computer program comprising instructions for performing the data dictionary construction method according to any one of the first aspect.

In a fourth aspect, the present application provides a computer-readable storage medium having stored thereon computer-executable instructions for implementing the method according to any one of the first aspect when executed by a processor.

In a fifth aspect, the present application provides a computer program product comprising program code for performing the method according to any of the first aspect when the computer program is run by a computer.

To sum up, the present application provides a method, an apparatus, an electronic device, and a storage medium for constructing a data dictionary, where the data dictionary has a tree structure and is composed of multiple node hierarchies, and specifically, the data dictionary can be obtained by obtaining an initial value of encoding of the data dictionary; the encoding initial value is used for marking the dictionary option corresponding to the root node; further, for each node level of the data dictionary, when a dictionary option is newly added in the node level, calculating dictionary codes corresponding to the dictionary options in the node level based on the code value corresponding to the node level, and splicing the dictionary codes of the newly added dictionary options after the code value corresponding to the previous node level to form the data dictionary; each dictionary option corresponds to a unique dictionary code; the node levels comprise at least one dictionary option, the size of the encoding value corresponding to each node level is determined by the encoding initial value, and the number of bits of the encoding value corresponding to each node level is determined by the level number from the root node. Therefore, the data dictionary is formed by the coding mode, the operation is simple, the formed data dictionary supports the user to modify dictionary options, the flexibility is high, the dictionary codes in the data dictionary cannot be modified during modification, the uniqueness is ensured, and the maintenance is convenient.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application.

Fig. 1 is a schematic view of an application scenario provided in an embodiment of the present application;

fig. 2 is a schematic flowchart of a data dictionary construction method according to an embodiment of the present application;

fig. 3 is a schematic view of a scenario of a data dictionary query method according to an embodiment of the present application;

fig. 4 is a schematic flowchart of a data dictionary querying method according to an embodiment of the present application;

fig. 5 is a schematic structural diagram of a data dictionary building apparatus according to an embodiment of the present application;

fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Specific embodiments of the present application have been shown by way of example in the drawings and will be described in more detail below. These drawings and written description are not intended to limit the scope of the inventive concepts in any manner, but rather to illustrate the inventive concepts to those skilled in the art by reference to specific embodiments.

Detailed Description

Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.

In the embodiments of the present application, terms such as "first" and "second" are used to distinguish the same or similar items having substantially the same function and action. For example, the first device and the second device are only used for distinguishing different devices, and the sequence order thereof is not limited. Those skilled in the art will appreciate that the terms "first," "second," etc. do not denote any order or quantity, nor do the terms "first," "second," etc. denote any order or importance.

It is noted that, in the present application, words such as "exemplary" or "for example" are used to mean exemplary, illustrative, or descriptive. Any embodiment or design described herein as "exemplary" or "such as" is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present concepts related in a concrete fashion.

In the present application, "at least one" means one or more, "a plurality" means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone, wherein A and B can be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of the singular or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, a-b, a-c, b-c, or a-b-c, wherein a, b, c may be single or multiple.

The customer service industry is used as a window unit and has the characteristics of intensive manpower, complex business content, high customer problem response requirement and the like, so that the customer service industry widely uses a computer office system for assistance, and successively establishes an intelligent customer service system by relying on financial science and technology strategies, so that intelligent basic applications such as intelligent customer service robots, intelligent voice navigation, intelligent seat assistants and the like are realized, a unified knowledge base, a staff response system and the like are also established, and the in-line service capability is continuously improved; however, with the continuous change of the customer interaction channel, the increasingly complex customer requirements, the increased service requirements and other problems, the computer office system needs to be iteratively upgraded, the service capability is improved, the system functions are further expanded, and the user experience is further improved.

In order to accurately position customer requirements and problems and improve the office efficiency of staff, a large amount of standardized data is required to be filled in a computer office system, and therefore the system needs a flexible data dictionary function. For example, when an address is filled in, it is often necessary to select among options defined by specifications, that is, information such as province, city, county, street, house number, etc. needs to be selected in sequence, such data information has certain specification requirements and cannot be filled in at will, so the data information is called a data dictionary.

It should be noted that, the standardized data filling is not only beneficial to improving the processing efficiency, but also can provide the standardized data, thereby facilitating the subsequent data statistical analysis, exploring a new demand scenario, and along with the development and adjustment of the service, the standardized data can also adapt to the change of the service for adjustment.

In a possible implementation manner, the data range may be determined, the information of the target structure data table may be obtained from the data range, and the data dictionary may be established according to the target structure data table.

It should be noted that the data dictionary generally has the following three features:

1. the data dictionary has a tree structure, the number of layers of the parameter tree is uncertain, and the data dictionary needs to be developed layer by layer when in selection;

2. the data dictionary may change the name of the option or increase or decrease the option during the use process, for example, the change of the city name, the combination of the villages and towns, etc.;

3. each node of the data dictionary is unique and cannot be repeated.

Aiming at the problems and three characteristics of the data dictionary, the application provides a data dictionary construction method, which can be used for setting a unique dictionary code for each dictionary option, so that the dictionary options in the constructed data dictionary can be changed at will, and particularly, the initial code value of the data dictionary can be obtained; further, the coding mode of the data dictionary is designed as follows: aiming at each node level of the data dictionary, when a dictionary option is added in the node level, calculating a code value corresponding to the dictionary option by using a certain algorithm, for example, adding n to the code value corresponding to the dictionary option, splicing the new code value after the code of the upper level option, and using the new code value as the code of the added dictionary option to further form the data dictionary; the size of the coding value corresponding to each node level is determined by a coding initial value, and n is a positive integer greater than or equal to 1. In this way, the data dictionary is formed by the encoding mode, the operation is simple, the formed data dictionary supports the user to modify the dictionary options, although the dictionary options are changed, the encoding values of the dictionary options are not changed, and the flexibility is high.

Exemplarily, fig. 1 is a schematic view of an application scenario provided in an embodiment of the present application, and a data dictionary construction method provided in the present application may be applied to the application scenario shown in fig. 1. The application scenario includes: a first terminal device 101 of a developer, a service system 102 and a second terminal device 103 of a user; specifically, the developer uses the first terminal device 101 to code and design the data dictionary, and sends the designed coding mode of the data dictionary to the service system 102 for processing, so that the service system 102 constructs the data dictionary, and after the data dictionary is successfully constructed, the second terminal device 103 of the user can use the data dictionary to perform functions of adding, modifying, disabling, recovering, querying and the like of the service.

For example, taking the constructed data dictionary as province data as an example, the dictionary options in the data dictionary can be given unique codes, so that the meaning of the dictionary options is not changed after the option names of the dictionary options are modified. Specifically, an option code of an N-bit integer is recorded, an initial value is S =0.. 0 (N bits in total), the initial value is encoded as a root node of the data dictionary, the size of N may be determined according to specific requirements, such as option code 000 in country a, and further, for a node code of a next level of the data dictionary, the option code may be designed to: when a new dictionary option is added each time, expanding the digit of the option code, adding one to the value of the option code, and further splicing the value of the new option code after the upper option code as the code of the new dictionary option, wherein, for example, the lower option codes of the country A have 000001, 000002 and 000037 which respectively correspond to provinces B, C and D; by analogy, the lower option codes of province B can be obtained as 000001038, 000001039 and 000001040, which respectively correspond to city E, city F and city G, and similarly, by coding in this way, a data dictionary based on province and city data can be obtained.

It should be noted that, if a dictionary option is added to the node codes of the same level of the data dictionary, the value of the option code of the dictionary option may be directly added by one on the basis of the original option code, such as option code 001 in M country, the bit number of the expansion option code and the specific data of the option code corresponding to the dictionary option in the embodiment of the present application are not limited, which may be determined according to the requirement, for example, the expansion bit number of each level is 3 bits or 2 bits compared to the previous level, and the option code corresponding to the dictionary option in each level may start from 001 or may start from 0038 when encoding.

The terminal device may be a wireless terminal or a wired terminal. A wireless terminal may refer to a device that provides voice and/or other traffic data connectivity to a user, a handheld device having wireless connection capability, or other processing device connected to a wireless modem. A wireless terminal, which may be a mobile terminal such as a mobile telephone (or called a "cellular" telephone) and a computer having a mobile terminal, e.g., a portable, pocket, hand-held, computer-included, or vehicle-mounted mobile device, may communicate with one or more core network devices via a Radio Access Network (RAN), and may exchange language and/or data with the RAN. For another example, the wireless terminal may be a Personal Communication Service (PCS) phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), or the like. A wireless terminal may also be referred to as a system, a subscriber unit (subscriber unit), a subscriber Station (subscriber Station), a mobile Station (mobile), a remote Station (remote Station), a remote terminal (remote terminal), an access terminal (access terminal), a user terminal (user terminal), a user agent (user agent), a user equipment (user device user equipment), without limitation. Optionally, the terminal device may also be a smart watch, a tablet computer, or the like.

The technical solution of the present application will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present application will be described below with reference to the accompanying drawings.

Fig. 2 is a schematic flow chart of a data dictionary construction method provided in an embodiment of the present application, where the data dictionary has a tree structure and is composed of multiple node hierarchies, and as shown in fig. 2, the data dictionary construction method includes the following steps:

s201, acquiring a coding initial value of a data dictionary; the encoding initial value is used for marking the dictionary option corresponding to the root node.

In this embodiment of the present application, the initial value of encoding may refer to encoding of a root node of a dictionary tree corresponding to a preset data dictionary, and may be obtained by setting a serial number of an N-bit integer, for example, S =0.. 0 (N bits in total), where N is a positive integer greater than 1, and the size of N may be set according to a specific requirement, which is not specifically limited in this embodiment of the present application.

In this step, the encoding initial value is used to mark a dictionary option corresponding to the root node, where the dictionary option is an option corresponding to selectable data in a data dictionary, and as shown in fig. 1, the dictionary option is country a.

S202, aiming at each node level of the data dictionary, calculating dictionary codes corresponding to the dictionary options in the node level based on the code values corresponding to the node level when a dictionary option is newly added in the node level; each dictionary option corresponds to a unique dictionary code; the node levels comprise at least one dictionary option, the size of the encoding value corresponding to each node level is determined by the encoding initial value, and the number of bits of the encoding value corresponding to each node level is determined by the level number from the root node.

In this embodiment of the present application, a node hierarchy may refer to a hierarchy formed by one node in a dictionary tree corresponding to a data dictionary and all nodes at a next level having an association relationship with the node, and as shown in fig. 1, a certain node hierarchy includes B province and E city, F city, and G city having an association relationship with B province.

In this step, a dictionary code corresponding to the dictionary option in the node hierarchy may be calculated by using a predefined algorithm based on the code value corresponding to the node hierarchy, where the dictionary code is a unique code value corresponding to each dictionary option, and the name of the dictionary option may be changed, but the dictionary code corresponding to the dictionary option is unique.

Optionally, the dictionary code corresponding to the dictionary option in the node hierarchy is calculated by using a predefined algorithm, which may be the following algorithm rule: adding n to the code value corresponding to the dictionary option as the code of the added dictionary option when adding a new dictionary option each time; n is a positive integer greater than or equal to 1, as shown in fig. 1, if an M city is newly added in B province, 1 is added to the code value corresponding to the M city to be 000001041, it can be understood that, when an algorithm rule is formulated, the size of n may be arbitrarily selected, but the smaller the value is, the more statistics is facilitated, the value of n is not specifically limited in the embodiment of the present application, and may be 2,3,4, and the like.

Optionally, the dictionary code corresponding to the dictionary option in the node hierarchy is calculated by using a predefined algorithm, which may be the following algorithm rule: when a dictionary option is newly added each time, subtracting n from the code value corresponding to the dictionary option to be used as the code of the newly added dictionary option; or other algorithm rules can be formulated to distinguish different dictionary options, and the code values corresponding to the dictionary options have certain rules, which is convenient for statistics and analysis.

The size of the coded value corresponding to each node level is determined by the coded initial value, that is, the coded values of the dictionary options corresponding to the nodes included in each node level are accumulated on the basis of the coded initial value, and if the coded value corresponding to the second node level is enlarged by one time compared with the bit number of the coded initial value, the size is sequentially increased, and since the bit number of the coded value corresponding to each node level is determined by the level number from the root node, that is, the farther from the root node, the more the bit number of the coded value corresponding to the node level is, the specific setting of the bit number and the size of the coded value in the embodiment of the present application is not limited, and may be in other forms, such as shown in fig. 1, like a root node 00, and the second node level is 0001, 0002, and the like.

For example, in the application scenario of fig. 1, taking B province in the second hierarchy as an example, for B province, a new dictionary option is added in the next level option corresponding to B province, and then dictionary encodings corresponding to the dictionary options having an association relationship with B province are calculated based on the encoding values corresponding to B province, for example, the dictionary encodings corresponding to E city, F city, and G city are 000001038, 000001039, and 000001040.

And S203, splicing the dictionary codes of the newly added dictionary options after the corresponding code values of the previous node level to form a data dictionary.

In this step, after the dictionary codes of the newly added dictionary options are spliced to the code values corresponding to the previous node level, the association relationship is established between the dictionary codes of the newly added dictionary options and the previous level dictionary options corresponding to the dictionary options, and each dictionary option in the data dictionary is spliced in such a way, so that the data dictionary is formed, for example, the dictionary code corresponding to E city is 000001038 and is spliced to the dictionary code corresponding to B province 000001.

It should be noted that, after the data dictionary is successfully constructed, if a dictionary option in the data dictionary is modified, the modified dictionary option is a name of the dictionary option, and a dictionary code corresponding to the dictionary option is not modified, which is convenient for subsequent data statistics and maintenance of the data dictionary.

Therefore, the application provides a data dictionary construction method, which can obtain the encoding initial value of the data dictionary; the encoding initial value is used for marking the dictionary option corresponding to the root node; further, for each node level of the data dictionary, when a dictionary option is newly added in the node level, calculating dictionary codes corresponding to the dictionary options in the node level based on the code value corresponding to the node level, and splicing the dictionary codes of the newly added dictionary options after the code value corresponding to the previous node level to form the data dictionary; each dictionary option corresponds to a unique dictionary code; the node levels comprise at least one dictionary option, the size of the encoding value corresponding to each node level is determined by the encoding initial value, and the number of bits of the encoding value corresponding to each node level is determined by the level number from the root node. Therefore, the data dictionary is formed by the coding mode, the operation is simple, the formed data dictionary supports the user to modify dictionary options, the flexibility is higher, the dictionary codes in the data dictionary cannot be modified during modification, the uniqueness is ensured, and the maintenance is convenient.

Specifically, for a certain node level, if a dictionary option needs to be added, the number of initial dictionary options in the node level may be obtained first, if the number is 0, the dictionary codes of the newly added dictionary options may be sequentially increased from 0, for example, the dictionary code 000001 corresponding to province B, if a dictionary option is added again, the corresponding dictionary code 000002 is obtained, and so on, which are not described one by one herein; if the number is 3, the dictionary codes of the newly added dictionary options may be sequentially increased from 3, for example, a new L province, the corresponding dictionary code 000004, if the number is increased again, every time the number is increased by one, 1 is added on the basis of the number of the existing dictionary options, and so on, which is not described one by one here.

Therefore, the dictionary options in the data dictionary are coded by using the coding mode, the coding mode is simple to operate, the algorithm of Lai Ewai is not needed, the data dictionary of any level is supported, the universality is high, and the convenience of subsequent data analysis is improved.

Optionally, the method further includes:

if not, the dictionary option is newly added;

In this application, the first message prompt message may refer to a prompt message for prompting that the newly added dictionary option of the user has the same option setting in the same node level, so as to prompt the user that the newly added dictionary option cannot be added.

In this step, before adding a new dictionary option in each node hierarchy, it is determined whether the same-name option corresponding to the added dictionary option exists in the same node hierarchy, and for the dictionary options in different node hierarchies, the same-name options with the same name may be allowed to exist, such as P city in province B and P city in province C, but the dictionary codes corresponding to P city in province B and P city in province C are different.

For example, in the application scenario of fig. 1, after a user selects a node in the dictionary tree based on the second terminal device 103, a child node may be newly added under the node, and a naming operation is performed, and accordingly, the service system 102 queries the database, determines whether peer nodes of the node (i.e., all nodes having the same upper node) have the same option name, if no option with the same name exists, adds 1 to a code value of the newly added child node, then splices the newly added child node behind the dictionary code of the parent node, and inserts the newly added node into the database; if the option with the same name exists, first message prompt information is sent to the second terminal device 103 of the user to prompt that the user cannot newly add the option.

Therefore, when a new dictionary option is added, whether the same dictionary option exists in the same node level or not can be judged, so that the dictionary options stored in the same node level cannot have the same option name, management is facilitated, and the distribution accuracy of the dictionary options in the data dictionary is improved.

Optionally, the method further includes:

In this embodiment of the application, the second message prompt information may refer to a prompt message for prompting that the dictionary option modified by the user has the option setting with the same name in the data dictionary table, so as to prompt the user that the dictionary option to be modified cannot be modified, and the manner, the sending form, and the content of the second message prompt information are similar to those of the first message prompt information, which is not described herein again, and reference may be made to the description of the first message prompt information.

In this step, whether the same dictionary options to be modified exist in the data dictionary table is inquired based on the first instruction, so that whether all dictionary options in the data dictionary table and the dictionary options to be modified are renamed is inquired, and if the renames exist, the dictionary options cannot be modified; if only one option with the same name as the name of the dictionary option to be modified exists, the modification effect is not great, and if a plurality of options with the same name as the name of the dictionary option to be modified exist, the dictionary option to be modified is unknown, so that the modification cannot be performed.

For example, in the application scenario of fig. 1, after the user selects a node in the dictionary tree based on the second terminal device 103, the option name of the node may be modified and stored, and accordingly, the service system 102 may query whether peer nodes (i.e., all nodes having the same upper node) of the node in the database have the same option name, update the database if no option with the same name exists, otherwise send a second message prompt message to the second terminal device 103 of the user to prompt that the user cannot modify the node.

It may be understood that, in addition to storing the dictionary options of all node levels and the dictionary codes corresponding to the dictionary options, the data dictionary table may also store other information, such as an association relationship of each dictionary option, whether the dictionary option is disabled, and the like, which is not specifically limited in this embodiment of the present application.

Therefore, the dictionary options can be modified in the embodiment of the application, but the dictionary codes corresponding to the dictionary options cannot be changed, so that the uniqueness of data is ensured, and convenience is provided for a user to manage the data dictionary.

Optionally, the method further includes:

In this embodiment of the present application, a specific node hierarchy may refer to any node hierarchy, and in the dictionary options included in each node hierarchy, each dictionary option corresponds to identification information, where the identification information is used to indicate whether a dictionary option is disabled or not, if identification information corresponding to a certain dictionary option is 1, the dictionary option is not disabled, and if identification information corresponding to a certain dictionary option is 0, the dictionary option is disabled.

It is understood that if a dictionary option is temporarily disabled, all the subordinate nodes (dictionary options) of the dictionary option, subordinate nodes of the subordinate nodes, and the like are disabled, as in fig. 1, the province B is disabled, and the city E, the city F and the city G are disabled.

It should be noted that, the identification information corresponding to the dictionary option may be modified by the user, for example, the user may re-enable a certain dictionary option, and accordingly, the identification information may be adaptively modified to "0", which represents "no", and is not disabled.

For example, fig. 3 is a schematic view of a scenario of a data dictionary query method provided in an embodiment of the present application; as shown in fig. 3, in response to a touch operation performed by a user on the terminal device 301, the touch operation is to query a lower-level dictionary option corresponding to the province b, and further, the service system 102 obtains identification information corresponding to the province b and the dictionary options having an association relationship, and returns a query result based on the query to the identification information: b1, b2, b3 and b 4; it will be appreciated that the disabled dictionary options are not displayed on the display interface of the terminal device 301.

It should be noted that operations such as adding, modifying, disabling, recovering, querying and the like to dictionary options in the data dictionary can all refer to the scene diagram shown in fig. 3.

Therefore, the embodiment of the application also provides a forbidden function when the dictionary options are inquired, so that the forbidden dictionary options are not displayed, the privacy can be protected, and the safety of data inquiry is improved.

Optionally, the method further includes:

if yes, feeding back the dictionary options for the user to determine;

In this embodiment of the present application, a keyword may refer to one or more words in dictionary options, the dictionary option corresponding to the keyword may or may not exist in a data dictionary, and specifically, the determination may be performed by calculating whether a matching degree between the dictionary option in the data dictionary and the keyword is greater than a preset threshold, where the preset threshold may refer to a threshold set for determining that the dictionary option corresponding to the keyword exists, and if the matching degree is greater than the preset threshold, it is determined that the dictionary option corresponding to the keyword exists.

It should be noted that the third message prompt information is similar to the first message prompt information in sending form, and is not described herein again, and the third message prompt information may refer to the description of the first message prompt information, and the sending content is used for reminding the user that there is no dictionary option corresponding to the keyword.

In this step, the method for calculating whether the matching degree with the keyword exists in the data dictionary may be a fuzzy algorithm, a machine learning algorithm, or the like, and the embodiment of the present application is not particularly limited, and the method for calculating the matching degree is only used for identifying whether the keyword has a corresponding dictionary option.

Optionally, if there are a plurality of dictionary options whose matching degrees with the keywords are greater than the preset threshold, feeding back the dictionary options for the user to determine.

Therefore, the method and the device for processing the fuzzy query can perform the fuzzy query based on the keywords, enrich the query function and improve the query convenience.

For example, fig. 4 is a schematic flowchart of a data dictionary query method provided in an embodiment of the present application; as shown in fig. 4, the flow of the data dictionary lookup method is as follows:

step A: inputting option codes (when the node is just used, a root node code is firstly transmitted into the front end, such as 000), further, judging whether a user inputs keywords or not by the system, if the keyword is determined to be input by the user, inquiring options which are not forbidden and matched with the keyword in the lower-level options of the node by the rear end, and further executing the step B; if the user is determined not to input the keywords, the back end inquires the options which are not forbidden in the lower options of the node, and then step B is executed.

And B: and D, judging whether the number of the subordinate options is zero or not by the system, if so, selecting the option based on user operation, otherwise, selecting one option in the subordinate option list based on the user operation, executing the step A, and so on until no subordinate node exists.

After returning to step a again, the input option code is an option code (dictionary code) corresponding to an item selected by the user in the lower-level option list.

Optionally, the method further includes:

and collecting corresponding dictionary options in the data dictionary table based on the second instruction, and feeding back the collected results to the client.

In the embodiment of the present application, the data dictionary table is a data table designed in advance and used for storing the dictionary options of each node level, the dictionary codes corresponding to the dictionary options, the association relationship corresponding to each node level, whether the dictionary options are disabled, and the like, as shown in table 1:

TABLE 1 data dictionary Table Structure

The data dictionary table designed by the application can comprise 4 fields, namely dictionary codes, upper-level option codes, corresponding names of dictionary options and whether forbidden or not, each dictionary option in the data dictionary has a unique code, so that the option codes can be used as a main key, the main key refers to a combination of one column or multiple columns, the value of the main key can uniquely identify each row in the table, and the main key is used for forcing the entity integrity of the table and reducing the system complexity.

Specifically, the third column and the first column are dictionary options and dictionary codes corresponding to the dictionary options, the second column is used for representing the association relationship corresponding to each node level, and the fourth column is used for representing whether the dictionary options are forbidden or not.

It should be noted that the first row of the data dictionary table is a special record and is assigned a special main key (e.g., "abcde"), so as to reduce the conflict with the main key of the dictionary option, and is used to indicate the value of the storage sequence number S of the option name field, so that a simple database table can support all functions in the data dictionary.

Illustratively, in the application scenario of fig. 1, if it is desired to know the number of the express deliveries addressed to the province B, the user sends a second instruction to the service system 102 based on the second terminal device 103, where the second instruction is used to count the express deliveries whose destination addresses are encoded in the format of "000001xxxx", and further, the service system 102 collects express delivery data addressed to the province B and the cities E, F and G, and feeds the data back to the second terminal device 103.

Therefore, the information of all dictionary options under a certain node level can be counted based on the data dictionary table, the coding modes of the data dictionary and the database table are closely related, data collection is simple and efficient, and convenience is provided for data collection.

By combining the embodiments, the method and the device completely realize the functions of adding, modifying, forbidding, recovering, inquiring and the like of the data dictionary, the designed coding mode can support any number of data dictionaries in any level, and the method and the device are suitable for various service scenes and have high flexibility.

In the foregoing embodiment, the data dictionary construction method provided in the embodiment of the present application is described, but in order to implement each function in the method provided in the embodiment of the present application, the electronic device serving as an execution subject may include a hardware structure and/or a software module, and each function is implemented in the form of a hardware structure, a software module, or a hardware structure plus a software module. Whether any of the above-described functions is implemented as a hardware structure, a software module, or a hardware structure plus a software module depends upon the particular application and design constraints imposed on the technical solution.

For example, fig. 5 is a schematic structural diagram of a data dictionary constructing apparatus provided in an embodiment of the present application, where the data dictionary has a tree structure and is composed of multiple node hierarchies, and as shown in fig. 5, the apparatus includes: an acquisition module 510, a calculation module 520, and a stitching module 530; the obtaining module 510 is configured to obtain an initial coding value of a data dictionary; the encoding initial value is used for marking the dictionary option corresponding to the root node;

the calculating module 520 is configured to calculate, for each node level of the data dictionary, a dictionary code corresponding to a dictionary option in the node level based on a code value corresponding to the node level when a dictionary option is newly added in the node level; each dictionary option corresponds to a unique dictionary code; the node levels comprise at least one dictionary option, the size of the coding value corresponding to each node level is determined by the coding initial value, and the bit number of the coding value corresponding to each node level is determined by the level number of the distance root node;

the splicing module 530 is configured to splice the dictionary codes of the newly added dictionary options after the code values corresponding to the previous node level, so as to form a data dictionary.

Optionally, the calculating module 520 is specifically configured to:

Optionally, the apparatus further includes a determining module, where the determining module is configured to:

if not, the dictionary option is newly added;

Optionally, the apparatus further includes a modification module, where the modification module is configured to:

Optionally, the apparatus further includes a query module, where the query module is configured to:

Optionally, the apparatus further includes a fuzzy query module, where the fuzzy query module is configured to:

if yes, feeding back the dictionary option for the user to determine;

Optionally, the apparatus further includes a statistics module, where the statistics module is configured to:

For specific implementation principles and effects of the data dictionary construction device provided in the embodiment of the present application, reference may be made to relevant descriptions and effects corresponding to the above embodiments, which are not described herein in any greater detail.

An embodiment of the present application further provides a schematic structural diagram of an electronic device, and fig. 6 is a schematic structural diagram of an electronic device provided in an embodiment of the present application, and as shown in fig. 6, the electronic device may include: a processor 601 and a memory 602 communicatively coupled to the processor; the memory 602 stores computer programs; the processor 601 executes the computer program stored in the memory 602, so that the processor 601 executes the method according to any of the embodiments.

The memory 602 and the processor 601 may be connected by a bus 603.

Embodiments of the present application further provide a computer-readable storage medium, which stores computer program execution instructions, and when the computer program execution instructions are executed by a processor, the computer program execution instructions are used to implement the method as described in any one of the foregoing embodiments of the present application.

The embodiment of the present application further provides a chip for executing the instruction, where the chip is used to execute the method in any of the foregoing embodiments executed by the electronic device in any of the foregoing embodiments of the present application.

Embodiments of the present application further provide a computer program product, which includes program code for performing, when a computer runs the computer program, the method described in any of the foregoing embodiments as performed by an electronic device in any of the foregoing embodiments of the present application.

In the technical scheme of the application, the collection, storage, use, processing, transmission, provision, disclosure and other processing of the related information such as financial data or user data and the like all accord with the regulations of related laws and regulations and do not violate the good custom of the public order.

In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of modules is merely a division of logical functions, and an actual implementation may have another division, for example, a plurality of modules or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or modules, and may be in an electrical, mechanical or other form.

Modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to implement the solution of the present embodiment.

In addition, functional modules in the embodiments of the present application may be integrated into one processing unit, or each module may exist alone physically, or two or more modules are integrated into one unit. The unit formed by the modules can be realized in a hardware form, and can also be realized in a form of hardware and a software functional unit.

The integrated module implemented in the form of a software functional module may be stored in a computer-readable storage medium. The software functional module is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) or a processor to execute some steps of the methods described in the embodiments of the present application.

It should be understood that the Processor may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in the incorporated application may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in the processor.

The Memory may include a Random Access Memory (RAM), and may further include a Non-volatile Memory (NVM), for example, at least one magnetic disk Memory, and may also be a usb disk, a removable hard disk, a read-only Memory, a magnetic disk or an optical disk.

The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (Extended Industry Standard Architecture) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, the buses in the figures of the present application are not limited to only one bus or one type of bus.

The storage medium may be implemented by any type of volatile or nonvolatile storage device or combination thereof, such as Static Random-Access Memory (SRAM), electrically Erasable Programmable Read-Only Memory (EEPROM), erasable Programmable Read-Only Memory (EPROM), programmable Read-Only Memory (PROM), read-Only Memory (ROM), magnetic Memory, flash Memory, magnetic disk or optical disk. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.

An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be integral to the processor. The processor and the storage medium may reside in an Application Specific Integrated Circuits (ASIC). Of course, the processor and the storage medium may reside as discrete components in an electronic device or host device.

The above description is only a specific implementation of the embodiments of the present application, but the scope of the embodiments of the present application is not limited thereto, and any changes or substitutions within the technical scope disclosed in the embodiments of the present application should be covered by the scope of the embodiments of the present application. Therefore, the protection scope of the embodiments of the present application shall be subject to the protection scope of the claims.

Claims

1. A method for constructing a data dictionary having a tree structure and composed of a plurality of node hierarchies, the method comprising:

for each node level of the data dictionary, when a dictionary option is newly added in the node level, calculating dictionary codes corresponding to the dictionary options in the node level based on code values corresponding to the node level; each dictionary option corresponds to a unique dictionary code; the node levels comprise at least one dictionary option, the size of the coding value corresponding to each node level is determined by the coding initial value, and the bit number of the coding value corresponding to each node level is determined by the level number of the distance root node;

2. The method of claim 1, wherein computing the dictionary code corresponding to the dictionary option in the node level based on the code value corresponding to the node level comprises:

3. The method of claim 1, further comprising:

if not, the dictionary option is newly added;

4. The method of claim 1, further comprising:

5. The method of claim 1, further comprising:

responding to a touch operation of a user, and inquiring dictionary options of a specific node hierarchy based on the touch operation;

6. The method of claim 1, further comprising:

if yes, feeding back the dictionary option for the user to determine;

7. The method according to any one of claims 1-6, further comprising:

8. A data dictionary construction apparatus, wherein the data dictionary has a tree structure and is composed of a plurality of node hierarchies, the apparatus comprising:

the calculation module is used for calculating dictionary codes corresponding to the dictionary options in the node hierarchy based on the code values corresponding to the node hierarchy when a dictionary option is newly added in the node hierarchy aiming at each node hierarchy of the data dictionary; each dictionary option corresponds to a unique dictionary code; the node levels comprise at least one dictionary option, the size of the coding value corresponding to each node level is determined by the coding initial value, and the bit number of the coding value corresponding to each node level is determined by the level number of the distance root node;

9. An electronic device, comprising: a processor, a memory, and a computer program; wherein the computer program is stored in the memory and configured to be executed by the processor, the computer program comprising instructions for performing the data dictionary construction method of any one of claims 1-7.

10. A computer-readable storage medium having computer-executable instructions stored thereon, which when executed by a processor, perform the method of any one of claims 1-7.

11. A computer program product comprising program code means for performing the method of any one of claims 1-7 when said computer program is run by a computer.