Method and apparatus for mapping of structured data nonquantitative combinations

Abstract

The application provides a mapping method and device for structured data indefinite quantity combination, and the method comprises the following steps: judging whether the scanned data object is single object data; for the single object data, initializing the parent node mapping table, scanning all single object data in the data object, filling the abstract data structure according to the scanning result, if there are multiple single object data, applying the abstract data structure for each single object data in turn, and forming a storage linked list; for the non-single object data, scanning all child node data of the data object, marking the current data object as a parent node, judging and determining the last child node; scanning the next data object, scanning to the last data object, and constructing an Attr_map_table hash mapping table based on all ModAttr nodes to establish a mapping relationship. The application can save the complex data corresponding relationship through data mapping, and effectively reduce the workload of staff.

Description

Technical Field

[0001] This application belongs to the field of communication technology, and in particular relates to a mapping method and apparatus for non-quantitative combination of structured data. Background Technology

[0002] In embedded systems, with the application and development of technologies such as web, REST API, and NetConf, there is a large amount of exchange between the front-end and back-end. However, different back-end systems have different combinations and granularities of interactive data. How to conveniently normalize the data from different business front-ends in embedded systems is a difficult problem, especially for devices with many configuration entries such as switches, routers, and splitters.

[0003] On PCs, there are generally no hardware resource limitations, and the CPU is relatively powerful. Different user business needs can be easily addressed by setting different query conditions in the database. However, in embedded systems, limitations in CPU, memory, and storage resources prevent a complete database migration. The common practice in embedded devices is to develop a separate interface for each user, which is relatively repetitive and complex, especially in larger systems where this task becomes even more burdensome. Summary of the Invention

[0004] In view of this, this application aims to propose a mapping method and apparatus for non-quantitative combinations of structured data, which constructs the dependencies and relationships between data based on the structured data input by the user, and establishes an intermediate layer mapping relationship between the user data and the final source of the data, allowing users to focus on the business organization of the data, and allowing developers to focus more on the connection of the data source.

[0005] To achieve the above objectives, the technical solution of this application is implemented as follows:

[0006] In a first aspect, this application provides a mapping method for an indefinite combination of structured data, the method comprising:

[0007] Scan the structured data, create ModAttr nodes to store the corresponding data objects, and determine whether the current ModAttr node has child nodes;

[0008] If a child node exists, the pre-built parent node mapping table is updated, and it is determined whether the data object is a single object.

[0009] In response to single-object data, initialize the parent node's mapping table;

[0010] Scan all single-object data within the data object, fill in the abstract data structure based on the scan results. If there are multiple single-object data, apply for and fill in the abstract data structure for each single-object data in turn, and form a storage linked list.

[0011] In response to non-single-object data, all child node data of the data object are scanned, the current data object is marked as the parent node, and the last child node is determined.

[0012] Scan the next data object, and continue scanning until the last data object. Construct the Attr_map_table hash mapping table based on all ModAttr nodes to establish the mapping relationship.

[0013] Secondly, based on the same inventive concept, this application also provides a mapping device for non-quantitative combinations of structured data, the device comprising:

[0014] The module is configured to scan structured data, create ModAttr nodes to store the corresponding data objects, and determine whether the current ModAttr node has child nodes.

[0015] The judgment module is configured to update the pre-built parent node mapping table in response to the existence of child nodes, and to determine whether the data object is a single object data.

[0016] The first response module is configured to respond to single-object data and initialize the parent node mapping table.

[0017] Scan all single-object data within the data object, fill in the abstract data structure based on the scan results. If there are multiple single-object data, apply for and fill in the abstract data structure for each single-object data in turn, and form a storage linked list.

[0018] The second response module is configured to respond to non-single-object data by scanning all child node data of the data object, marking the current data object as the parent node, and determining and identifying it as the last child node.

[0019] The mapping module is configured to scan the next data object, up to the last data object, and build an Attr_map_table hash mapping table based on all ModAttr nodes to establish mapping relationships.

[0020] Thirdly, based on the same inventive concept, this application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the program, implements the mapping method for non-quantitative combinations of structured data as described in the first aspect.

[0021] Fourthly, based on the same inventive concept, this application also provides a non-transitory computer-readable storage medium, wherein the non-transitory computer-readable storage medium stores computer instructions for causing the computer to execute the mapping method for an indefinite combination of structured data as described in the first aspect.

[0022] Compared with the prior art, the mapping method and apparatus for non-quantitative combinations of structured data described in this application have the following advantages:

[0023] The mapping method and apparatus for non-quantitative combinations of structured data described in this application scans the structured data and creates ModAttr nodes to store the corresponding data objects, and determines whether the current ModAttr node has child nodes; in response to the existence of child nodes, the pre-constructed parent node mapping table is updated, and it is determined whether the data object is a single object; in response to single object data, the parent node mapping table is initialized, all single object data within the data object is scanned, and an abstract data structure is filled in according to the scan results. If multiple single object data exist, an abstract data structure is applied for and filled in for each single object data in turn, and a storage linked list is formed; in response to non-single object data, all child node data of the data object are scanned, and the current data object is marked as the parent node, and determined as the last child node; the next data object is scanned, and the scan continues until the last data object. Based on all ModAttr nodes, an Attr_map_table hash mapping table is constructed to establish a mapping relationship. The mapping method eliminates the complex data correspondence by mapping the data. Programmers only need to focus on the data input and the final data mapping, acquisition and assignment process. They do not need to manually modify the code due to changes in the structure obtained by the user. The data model defines the data. Programmers only need to solve the final basic data acquisition and mapping correspondence, thereby effectively reducing the complicated and repetitive workload of programmers. Attached Figure Description

[0024] The accompanying drawings, which form part of this application, are used to provide a further understanding of this application. The illustrative embodiments and descriptions of this application are used to explain this application and do not constitute an undue limitation of this application. In the drawings:

[0025] Figure 1 This is a flowchart of the mapping method for non-quantitative combinations of structured data described in the embodiments of this application;

[0026] Figure 2 This is a schematic diagram of the structure of the mapping device for non-quantitative combination of structured data as described in the embodiments of this application;

[0027] Figure 3 This is a schematic diagram of the hardware structure of the electronic device described in the embodiments of this application. Detailed Implementation

[0028] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with specific embodiments and the accompanying drawings.

[0029] It should be noted that, unless otherwise defined, the technical or scientific terms used in the embodiments of this application should have the ordinary meaning understood by one of ordinary skill in the art to which this application pertains. The terms "first," "second," and similar terms used in the embodiments of this application do not indicate any order, quantity, or importance, but are merely used to distinguish different components. Terms such as "comprising" or "including" mean that the element or object preceding the word encompasses the elements or objects listed after the word and their equivalents, without excluding other elements or objects. Terms such as "connected" or "linked" are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect. Terms such as "upper," "lower," "left," and "right" are only used to indicate relative positional relationships; when the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0030] The embodiments of this application are described in detail below with reference to the accompanying drawings.

[0031] Please see Figure 1 As shown, one embodiment of this application describes a mapping method for non-quantitative combinations of structured data, which includes the following steps:

[0032] Step S101: Scan the structured data, create a ModAttr node to store the corresponding data object, and determine whether the current ModAttr node has child nodes.

[0033] Specifically, the structured data is scanned, and a ModAttr node is created for each data object. Each ModAttr node contains the data object itself and references to the parent and child nodes. When creating a ModAttr node, it is necessary to determine whether the current data object has child nodes so that the relevant nodes can be quickly found later based on the child node index ID.

[0034] Step S102: In response to the existence of child nodes, update the pre-built parent node mapping table and determine whether the data object is a single object data.

[0035] Specifically, if child nodes exist, the ModAttr node containing the child nodes is located, and the current node is associated with the child nodes. Simultaneously, the pre-built parent node mapping table is updated, and it is determined whether the data object is a single-object data to process the node, such as scanning for single-object data and filling in the corresponding struct Attr structure.

[0036] In some implementations, before updating the pre-built parent node mapping table in response to the existence of child nodes and determining whether the data object is a single-object data, the following steps are also included:

[0037] Construct an array Map_table_name[N] to store the structured data association mapping table, where N is initialized to 0;

[0038] Define a struct ModAttr node, which contains two fields: modName and AttrArray[K]. modName represents the module name, and AttrArray[K] represents the mapping association table of submodules.

[0039] Specific code implementation:

[0040]

[0041] Step S103: In response to single object data, the parent node mapping table is initialized.

[0042] Scan all single-object data within the data object, fill in the abstract data structure based on the scan results. If there are multiple single-object data, apply for and fill in the abstract data structure for each single-object data in turn, and form a storage linked list.

[0043] In some implementations, in response to the data object being a single object containing only basic data types, the AttrArray[K] array is set to -1, and N = N + 1, where the initial value of K is set to 1; a data key-value storage type is constructed, and Attr is defined as an abstract data structure for attributes, including attribute ID, attribute value type, attribute name, and union storing attribute data, and the storage structure Attr after mapping the key-value pairs at the same level forms a storage linked list.

[0044] Specifically, for each individual object of data, the following processing is performed:

[0045] Initialize the parent node mapping table and create an abstract data structure (which can be assumed to be Attr, an abstract data structure for attributes used to convert key-value pair information into a unified representation mode) to store attribute-related information, such as attribute ID (AttrID), attribute data (Attr_val), attribute value type (Attr_type), and attribute name (Attr_name). For each attribute, fill in the information according to the attribute type and value, and add the Attr to the storage linked list.

[0046] If there are multiple single-object data, repeat the above steps for each single-object data, allocate a new Attr structure for it, and add it to the attr_list linked list.

[0047] For data objects that are single objects and contain only basic data types, set the AttrArray[K] array (assuming a length of K and an initial value of 1) to -1, indicating that the node does not contain child nodes.

[0048] Based on the same level of key-value storage type (such as hash table or dictionary), the attr_list linked list is used to construct the storage linked list. Each Attr node in the linked list represents an attribute. The attribute ID is used as the key and the Attr node is used as the value, and the linked list is stored.

[0049] Executing N = N + 1 means increasing the number of ModAttr nodes.

[0050] For constructing a key-value storage type of data, the specific code is as follows:

[0051]

[0052]

[0053] Step S104: In response to non-single-object data, scan all child node data of the data object, mark the current data object as the parent node, and determine and identify it as the last child node.

[0054] In some implementations, in response to non-single-object data, all child node data of the data object are scanned, and the current data object is marked as the parent node;

[0055] Determine if a child node is the last child node;

[0056] In response to determining that it is the last child node, the next data object is then scanned;

[0057] If it is determined that the ModAttr node is not the last child node, then a ModAttr node is created.

[0058] Specifically, scan all child node data of the data object, mark the current data object as the parent node, and determine whether the child node is the last child node.

[0059] If it is the last child node, it means that all child nodes of the current data object have been scanned.

[0060] If it is not the last child node, it means that there are other child nodes that need to be scanned.

[0061] If it is determined to be the last child node, the next data object is scanned and processed accordingly.

[0062] If it is determined that this is not the last child node, a new ModAttr node is created to represent the child node, and then the new node is associated with the parent node.

[0063] Repeat the above steps until all data objects have been scanned.

[0064] Step S105: Scan the next data object until the last data object is reached. Construct the Attr_map_table hash mapping table based on all ModAttr nodes to establish the mapping relationship.

[0065] Specifically, starting from the current data object, the next data object is scanned. For each data object, an Attr_map_table hash mapping table is constructed based on its ModAttr nodes. All ModAttr nodes are traversed, with each node's attribute ID used as the key and the corresponding node as the value, stored in the Attr_map_table. A hash function can be used to calculate the hash value of the key to improve retrieval efficiency. If more data objects exist, the process returns to step S101 to continue scanning the next data object. If the last data object has been scanned, the mapping is complete, and the Attr_map_table contains the mapping relationships of all ModAttr nodes.

[0066] After the mapping is completed, all the obtained Attrlists will be stored in the mapping linked list and subjected to modular data processing operations (this is post-mapping processing, a conventional technique well known to those skilled in the art, and will not be described in detail here).

[0067] The structured data mapping method described in this embodiment eliminates the complex data correspondence by mapping data. Programmers only need to focus on the data input and the final data mapping, acquisition and assignment process. They do not need to manually modify the code due to changes in the structure obtained by the user. The data model defines the data, and programmers only need to solve the final basic data acquisition and mapping correspondence, thereby effectively reducing the complicated and repetitive workload of programmers. Specific implementation examples:

[0069] Regarding the data content:

[0070] A:{

[0071] C:{c1:2,c2:true}

[0072] D:{d1:100,d2:1000,d3:”ffff”}

[0073] }

[0074] B:{b1:1,b2:“abc”}

[0075] E:{e1:200,e2:”xxxx”}

[0076] After scanning, the constructed

[0077]

[0078] It should be noted that the above description describes some embodiments of this application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in a different order than that shown in the above embodiments and still achieve the desired result. Furthermore, the processes depicted in the drawings do not necessarily require a specific or sequential order to achieve the desired result. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0079] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, the embodiments of this application also provide a mapping device for non-quantitative combinations of structured data.

[0080] like Figure 2 As shown, the mapping device for non-quantitative combination of structured data includes:

[0081] Create module 11, which is configured to scan structured data, create ModAttr nodes to store the corresponding data objects, and determine whether the current ModAttr node has child nodes;

[0082] The judgment module 12 is configured to update the pre-built parent node mapping table in response to the existence of child nodes, and to determine whether the data object is a single object data.

[0083] The first response module 13 is configured to initialize the parent node mapping table in response to single object data.

[0084] Scan all single-object data within the data object, fill in the abstract data structure based on the scan results. If there are multiple single-object data, apply for an abstract data structure for each single-object data in turn and form a storage linked list.

[0085] The second response module 14 is configured to, in response to non-single object data, scan all child node data of the data object, mark the current data object as the parent node, and determine and identify the last child node.

[0086] Mapping module 15 is configured to scan the next data object, up to the last data object, and build an Attr_map_table hash mapping table based on all ModAttr nodes to establish mapping relationships.

[0087] In some embodiments, the mapping device further includes:

[0088] The update module is configured to construct an array Map_table_name[N] for storing structured data association mapping tables, where N is initialized to 0;

[0089] Define a struct ModAttr node, which contains two fields: modName and AttrArray[K]. modName represents the module name, and AttrArray[K] represents the mapping association table of submodules.

[0090] For ease of description, the above apparatus is described in terms of its functions, divided into various modules. Of course, in implementing the embodiments of this application, the functions of each module can be implemented in one or more software and / or hardware.

[0091] The apparatus of the above embodiments is used to implement the mapping method for the corresponding non-quantitative combination of structured data in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiments, which will not be described further here.

[0092] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, embodiments of this application also provide an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, it implements the mapping method for non-quantitative combinations of structured data as described in any of the above embodiments.

[0093] Figure 3 This embodiment illustrates a more specific hardware structure of an electronic device, which may include a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, memory 1020, input / output interface 1030, and communication interface 1040 are interconnected internally via the bus 1050.

[0094] The processor 1010 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0095] The memory 1020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 can store the operating system and other applications. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program code is stored in the memory 1020 and is called and executed by the processor 1010.

[0096] The input / output interface 1030 is used to connect input / output modules to realize information input and output. Input / output modules can be configured as components within the device (not shown in the figure) or externally connected to the device to provide corresponding functions. Input devices may include keyboards, mice, touchscreens, microphones, various sensors, etc., while output devices may include displays, speakers, vibrators, indicator lights, etc.

[0097] The communication interface 1040 is used to connect a communication module (not shown in the figure) to enable communication between this device and other devices. The communication module can communicate via wired means (such as USB, Ethernet cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).

[0098] Bus 1050 includes a pathway for transmitting information between various components of the device, such as processor 1010, memory 1020, input / output interface 1030, and communication interface 1040.

[0099] It should be noted that although the above-described device only shows the processor 1010, memory 1020, input / output interface 1030, communication interface 1040, and bus 1050, in specific implementations, the device may also include other components necessary for normal operation. Furthermore, those skilled in the art will understand that the above-described device may only include the components necessary for implementing the embodiments of this specification, and not necessarily all the components shown in the figures.

[0100] The electronic devices described above are used to implement the mapping method for the indefinite combination of structured data in any of the foregoing embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0101] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides a non-transitory computer-readable storage medium storing computer instructions for causing the computer to execute the mapping method for non-quantitative combinations of structured data as described in any of the above embodiments.

[0102] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0103] The computer instructions stored in the storage medium of the above embodiments are used to cause the computer to execute the mapping method for non-quantitative combinations of structured data as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0104] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of this application (including the claims) is limited to these examples; within the framework of this application, the technical features of the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other variations of different aspects of the embodiments of this application as described above, which are not provided in the details for the sake of brevity.

[0105] Additionally, to simplify the description and discussion, and to avoid obscuring the embodiments of this application, the well-known power / ground connections to integrated circuit (IC) chips and other components may or may not be shown in the provided drawings. Furthermore, the apparatus may be shown in block diagram form to avoid obscuring the embodiments of this application, and this also takes into account the fact that the details of the implementation of these block diagram apparatuses are highly dependent on the platform on which the embodiments of this application will be implemented (i.e., these details should be fully understood by those skilled in the art). While specific details (e.g., circuits) have been set forth to describe exemplary embodiments of this application, it will be apparent to those skilled in the art that the embodiments of this application can be implemented without these specific details or with variations thereof. Therefore, these descriptions should be considered illustrative rather than restrictive.

[0106] Although this application has been described in conjunction with specific embodiments thereof, many substitutions, modifications, and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may be used with the embodiments discussed.

[0107] The embodiments of this application are intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the embodiments of this application should be included within the protection scope of this application.

Claims

1. A mapping method for non-quantitative combinations of structured data, characterized in that, The method includes: Scan the structured data, create ModAttr nodes to store the corresponding data objects, and determine whether the current ModAttr node has child nodes; If a child node exists, the pre-built parent node mapping table is updated, and it is determined whether the data object is a single object. In response to single-object data, the parent node mapping table is initialized, including: In response to the data object being a single object containing only basic data types, the AttrArray[K] array is decremented by 1, and N is set to N+1, where the initial value of K is set to 1; Scan all single-object data within the data object, fill in the abstract data structure based on the scan results. If there are multiple single-object data, apply for and fill in the abstract data structure for each single-object data in turn, and form a storage linked list. In response to non-single-object data, all child node data of the data object are scanned, the current data object is marked as the parent node, and the last child node is determined. Scan the next data object, scan to the last data object, and build the Attr_map_table hash mapping table based on all ModAttr nodes to establish the mapping relationship; Before updating the pre-built parent node mapping table in response to the existence of child nodes and determining whether the data object is a single-object data, the following steps are also included: Construct an array Map_table_name[N] to store ModAttr nodes and fields, where N is initialized to 0; Define a ModAttr node, which contains two fields: modName and AttrArray[K]. modName represents the module name, and AttrArray[K] represents the mapping association table of submodules. Each ModAttr node contains the data object itself and references to the parent and child nodes.

2. The mapping method for non-quantitative combinations of structured data according to claim 1, characterized in that, The scanned data object contains all single-object data. An abstract data structure is filled in based on the scan results. If multiple single-object data exist, an abstract data structure is requested and filled in sequentially for each single-object data, forming a linked list for storage, including: Construct a key-value storage type for data, and define Attr as an abstract data structure for attributes, which includes attribute ID, attribute value type, attribute name, and a union to store attribute data; A storage linked list is formed using key-value storage types at the same level.

3. The mapping method for non-quantitative combinations of structured data according to claim 1, characterized in that, In response to non-single-object data, all child node data of the data object are scanned, and the current data object is marked as the parent node. The last child node is determined and identified, including: In response to non-single-object data, all child node data of the data object are scanned, and the current data object is marked as the parent node; Determine if a child node is the last child node; In response to determining that it is the last child node, the next data object is then scanned; If it is determined that the ModAttr node is not the last child node, then a ModAttr node is created.

4. A mapping device for non-quantitative combinations of structured data, characterized in that, The device includes: The module is configured to scan structured data, create ModAttr nodes to store the corresponding data objects, and determine whether the current ModAttr node has child nodes. The judgment module is configured to update the pre-built parent node mapping table in response to the existence of child nodes, and to determine whether the data object is a single object data. The first response module is configured to respond to single-object data and initialize the parent node mapping table, including: In response to the data object being a single object containing only basic data types, the AttrArray[K] array is decremented by 1, and N is set to N+1, where the initial value of K is set to 1; Scan all single-object data within the data object, fill in the abstract data structure based on the scan results. If there are multiple single-object data, apply for and fill in the abstract data structure for each single-object data in turn, and form a storage linked list. The second response module is configured to respond to non-single-object data by scanning all child node data of the data object, marking the current data object as the parent node, and determining and identifying it as the last child node. The mapping module is configured to scan the next data object, up to the last data object, and build an Attr_map_table hash mapping table based on all ModAttr nodes to establish mapping relationships; Also includes: The update module is configured to construct an array Map_table_name[N] to store ModAttr nodes and fields, where N is initialized to 0; Define a ModAttr node, which contains two fields: modName and AttrArray[K]. modName represents the module name, and AttrArray[K] represents the mapping association table of submodules. Each ModAttr node contains the data object itself and references to the parent and child nodes.

5. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the program, implements the mapping method for non-quantitative combinations of structured data as described in any one of claims 1-3.

6. A non-transitory computer-readable storage medium, characterized in that, in, The non-transitory computer-readable storage medium stores computer instructions for causing the computer to execute the mapping method for an indefinite combination of structured data as described in any one of claims 1-3.

Images