A method, server and storage medium for optimizing tree table generation

The n-forktree depth-first way creates table rows recursively, solving the performance problems of traditional tree table controls in multi-level data processing, and achieving rapid initialization and efficient data display.

CN114510913BActive Publication Date: 2024-11-26XIAMEN HYMAKE TECH
View PDF 7 Cites 0 Cited by

Patent Information

Application Number
CN202210022041.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-01-10
Publication Date
2024-11-26
Estimated Expiration
2042-01-10

AI Technical Summary

Technical Problem

When traditional tree table controls process multi-level data, frequent creation and insertion of table rows lead to performance problems, resulting in a long interface initialization time and affecting the user experience.

Method used

The tree-level data is processed using n forktree depth priority, and table rows are created through recursive iteration to avoid insertion operations, and table rows are directly added to the table row list.

Benefits of technology

It greatly improves the efficiency of table row creation, reduces performance problems, and reduces the initialization time from 10-15 seconds to about 300ms, improving the user experience.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114510913B_ABST
    Figure CN114510913B_ABST
Patent Text Reader

Abstract

The embodiment of the present application discloses a method, server and storage medium for optimizing the generation of a tree-shaped table, which is used for a client-side tree-shaped table control to display large quantities of data. The method of the embodiment of the present application includes: a receiving step, in which the tree-shaped table receives a data list; a traversal step, in which the data in the data list is traversed, and corresponding table rows are generated according to the traversed data and added to the table row list. Determine whether the current table row is expanded; when the current table row is expanded and there are sub-items, read the sub-item list, jump to the receiving step, receive the sub-table row of the current table row; when the current table row is folded, jump to the traversal step, and generate the next table row in the list; when the tree-shaped table receives the last piece of data in the data list in the receiving step, the tree-shaped table generation optimization process ends. Through this method, the efficiency of creating table rows is greatly improved, and the performance problems caused by the traditional insertion method of appending table rows to the table row list are reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of digital information technology, and in particular to a method, server and storage medium for optimizing tree table generation. Background Art

[0002] The tree table can intuitively display the hierarchical relationship of data. It is a commonly used and popular interface control in the process of software interface development. The tree table control has two main features: ① Hierarchical; the parent node holds the child node, the child node holds the grandchild node... It can be nested infinitely within the business scope. ② Stateful; each node is stateful (expanded / collapsed), and the state is persisted to the associated data. When filling or refreshing the table, it is necessary to create table rows according to the expanded or collapsed state of the data.

[0003] The widely used tree table control data filling method is to create table rows by level, generate sub-item table rows layer by layer, and finally generate a flat table row list. By using the layer-by-layer creation method, the creation of sub-items can be controlled by the expansion / collapse status of the data. The collapsed data does not need to create table rows, thereby achieving the purpose of minimizing the creation of table rows during initialization. Take the table control in Eclipse SWT / Jface as an example, Figure 1 The following is the process of generating a tree-shaped data table in a partially collapsed state with three layers. The steps are as follows:

[0004] (1) Generate the first-level table rows. Get the first-level data through the getElements(Obj) method of the content provider ContentProvider and generate table rows coded as A01 to A03. When generating table rows, you need to call the view layer label provider (labelProvider) to fill in the text, foreground color, background color, image and other information required for each cell in the table row. Figure 2 shown.

[0005] (2) Traverse the first-layer table rows according to their status (expanded / collapsed), and determine whether there are child items through the hasChildren(Obj) and getChildren(obj) methods of the content provider ContentProvider. If the first-layer data is in the expanded state, insert the child item list under the current table row; if the first-layer data is in the collapsed state, insert a blank row, such as Figure 3 shown.

[0006] (3) According to the state of the second-layer table row (expanded / collapsed), traverse the second-layer table rows and determine whether there are child items through the hasChildren(Obj) and getChildren(obj) methods of the content provider ContentProvider. If the second-layer data is in the expanded state, insert the child item list under the current table row. If the second-layer data is in the collapsed state, insert a blank row. The final effect is shown in the figure below. Figure 1 shown.

[0007] The tree table row will be set to the level of the table row during the generation process. The level of the first-level table row is 1, the second-level is 2, and so on. For easy access, the table control will set the parent table row of the first-level table row to empty, and the parent table row of the second-level table row is the first-level table row to which it belongs.

[0008] Currently, when processing tree-like hierarchical data, the tree-like table control creates / inserts table rows layer by layer, and realizes the tree-like appearance through the level when drawing the interface. That is, the tree-like data is stored in the table control through the flattened list-type table rows. When creating the first layer of data, the table rows are created sequentially. When creating the second layer of data, the table data is inserted into the corresponding first layer table rows, and so on. Finally, the tree-like table creation process is realized by adding / inserting table rows. Figure 5 shown.

[0009] However, when there are a lot of sub-item data, the table row list needs to repeatedly perform the table row insertion operation, which often leads to performance problems in the display of large-scale multi-level tree-shaped data. For the invention patent with application number 201710918445.1 and name "Data Display Optimization Method, Device, Terminal Equipment and Storage Medium", the table initialization only draws the visible area data, and when the scroll bar is scrolled, the newly added table rows and table columns in the visible area are calculated and then the newly added area table rows are drawn. When drawing the control, the performance problems in the drawing process are greatly optimized. However, it did not solve the performance problems caused by the frequent creation and insertion of table rows in the table row list unique to the table during the tree table row generation process.

[0010] In actual applications, when a table with 10,000 rows, 35 columns and 3 layers needs to be displayed, when the client is configured as (operating system - Windows 10 / CPU ​​- Intel Core i3 9100 / memory - DDR4 8G), the initialization time is about 10 seconds to 15 seconds without optimization after testing. After optimization through the above patent (201710918445.1), the initialization time is about 2-3 seconds. For client applications, the 2 to 3 seconds of waiting will cause the interface to freeze, affecting the user experience. Summary of the invention

[0011] In order to solve the performance problem caused by the traditional tree table control using breadth-first method to flatten multi-level data table rows, this application proposes a tree table generation optimization method, server and storage medium for client tree table control to display large amounts of data.

[0012] The first aspect of the present application provides a method for optimizing tree table generation, comprising:

[0013] Receiving step, the tree table receives the data list;

[0014] The traversal step traverses the data in the data list, generates corresponding table rows according to the traversed data, and adds them to the table row list.

[0015] Optionally, the method further includes:

[0016] Determine whether the current table row is expanded;

[0017] When the current table row is expanded and has sub-items, read the sub-item list, jump to the receiving step, and receive the sub-table row of the current table row;

[0018] When the current table row is collapsed, jump to the traversal step to generate the next table row in the list.

[0019] Optionally, when the tree-shaped table receives the last piece of data in the data list in the receiving step, the tree-shaped table generation optimization process ends.

[0020] Optionally, the tree-shaped table flattens the table by creating the table rows layer by layer when generating the table rows, and all the table rows are stored in the form of a list.

[0021] Optionally, fill in the style information in the table's visible area while creating the table row.

[0022] A second aspect of the present application provides a server, which may include:

[0023] Receiving module, used for receiving data list from tree table;

[0024] The traversal module is used to traverse the data in the data list, generate corresponding table rows according to the traversed data and add them to the table row list;

[0025] The judgment module is used to judge whether the current table row is expanded;

[0026] The table expansion processing module is used to read the sub-item list when the current table row is expanded and has sub-items, jump to the receiving module, and receive the sub-table row of the current table row;

[0027] The table folding processing module is used to jump to the traversal module and generate the next table row in the list when the current table row is folded.

[0028] Optionally, when the tree table in the receiving module receives the last piece of data in the data list, the tree table generation optimization process ends.

[0029] Optionally, the tree-shaped table flattens the table by creating the table rows layer by layer when generating the table rows, and all the table rows are stored in the form of a list.

[0030] Optionally, fill in the style information in the table's visible area while creating the table row.

[0031] A third aspect of the present application provides a server, which may include:

[0032] A memory storing executable program code;

[0033] a processor and a transceiver coupled to the memory;

[0034] The processor calls the executable program code stored in the memory, so that the processor and the transceiver execute the method as described in the first aspect of the present application.

[0035] On another aspect, the present application provides a computer-readable storage medium, comprising instructions, which, when executed on a processor, enables the processor to execute the method described in the first aspect of the present application.

[0036] Yet another aspect of the present invention discloses a computer program product. When the computer program product is run on a computer, the computer is enabled to execute the method described in the first aspect of the present application.

[0037] Yet another aspect of the present invention discloses an application publishing platform, which is used to publish a computer program product. When the computer program product runs on a computer, the computer executes the method described in the first aspect of the present application.

[0038] It can be seen from the above technical solutions that the embodiments of the present application have the following advantages:

[0039] In an embodiment of the present invention, an n-ary tree depth-first method is adopted to process the process of creating table rows during the flattening of tree-like hierarchical data. In the process of creating table rows, only the table rows need to be appended to the table row list by adding, which greatly improves the efficiency of table row creation and reduces the performance problems caused by the traditional method of appending table rows to the table row list by inserting. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments and the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application, and other drawings can be obtained based on these drawings.

[0041] Figure 1 This is a schematic diagram of an exemplary three-layer tree-shaped data table in a partially collapsed state;

[0042] Figure 2 A schematic diagram of a tree data table for generating first-level table rows according to current technology;

[0043] Figure 3 A schematic diagram of a tree data table for traversing the first-level table rows according to current technology;

[0044] Figure 4 A schematic diagram of the overall process of tree table generation optimization in an embodiment of the present application;

[0045] Figure 5 This is a tree table diagram for filling data in a Grid table in an Eclipse Nebula project in an embodiment of the present application;

[0046] Figure 6 A schematic diagram of obtaining data to generate table rows in an embodiment of the present application;

[0047] Fig. 7A A schematic diagram of generating table row sub-items in an embodiment of the present application;

[0048] Figure 7B Another schematic diagram of generating table row sub-items in an embodiment of the present application;

[0049] Figure 8 Another schematic diagram of returning to the upper layer to generate a table row in an embodiment of the present application;

[0050] Fig. 9 A schematic diagram of an embodiment of a server in an embodiment of the present invention;

[0051] Fig.10 This is another schematic diagram of an embodiment of the server in the embodiment of the present application. DETAILED DESCRIPTION

[0052] The embodiments of the present application provide a method, a server and a storage medium for optimizing the generation of a tree-shaped table, which are used to process the creation process of table rows during the flattening of tree-shaped hierarchical data.

[0053] The present invention is mainly to solve the performance problem caused by the traditional tree table control using a breadth-first method to flatten multi-level data table rows, and provides a new method for creating table rows based on an n-ary tree depth-first method. The method uses a recursive iterative method to create table rows. After creating the table rows, by judging the state of the current table row (expanded / collapsed), if it is expanded, continue to create the table row of the next layer of the current table row; if it is collapsed, process the next table row of the same layer of the current table row, and so on and so forth. The table row data to be created is added to the table row list in order, thereby avoiding performance problems caused by list insertion operations.

[0054] In order to make the technical personnel in the technical field better understand the scheme of the present application, the technical scheme in the embodiment of the present application will be described below in conjunction with the drawings in the embodiment of the present application. Obviously, the described embodiment is only a part of the embodiment of the present application, not all of the embodiments. Based on the embodiments in the present application, they should all fall within the scope of protection of the present application.

[0055] The following is a further explanation of the technical solution of this application. This part involves the description of the key data structure of the electronic spreadsheet, the row and column analysis, and the specific generation optimization algorithm. The part that does not constitute an obstacle to understanding the technical solution will be omitted. Figure 4 As shown, it is a schematic diagram of the overall process of tree table generation optimization in an embodiment of the present application.

[0056] The steps included in the flowchart are described as follows:

[0057] Step S401: the tree table receives a data list; when the tree table receives the last piece of data in the data list, the generation optimization process ends.

[0058] Step S402: traverse the data in the data list, generate corresponding table rows according to the traversed data and add them to the table row list;

[0059] Step S403: Determine whether the current table row is expanded;

[0060] Step S404: if the current table row is expanded and has sub-items, read the sub-item list and jump to step S401 to continue creating a sub-table row of the current table row;

[0061] Step S405: If the current table row is collapsed, jump to step S402 and continue to iterate to generate the next table row in the list.

[0062] The technical solution of the present application is further described below by way of embodiments. Figure 5As shown, it is a schematic diagram of an embodiment of tree table generation optimization in the embodiment of the present application, and the performance tuning of the Grid table is implemented in the Eclipse Nebula project. The method embodiment can be applied to the server and may include:

[0063] 1. Grid receives the tree table data list;

[0064] 1) Tree table data structure definition

[0065] The main data structure definition of the electronic form is shown in Table 1 below. This data structure will serve as the basic data structure for template definition and form compilation:

[0066]

[0067]

[0068] The dictionary construction in Table 1 follows the data structure definition shown in Table 2 below:

[0069]

[0070] Table 2Grid data example is as follows:

[0071]

[0072]

[0073] 2) Table generation data description

[0074] Through the above data definition and description, we can understand that the format of the spreadsheet is mainly represented by the data definition of rows, columns and cells. The spreadsheet displays data in a tree-like hierarchical data format. The table row hierarchy can be infinitely nested, and the table rows of non-leaf nodes have two states: expanded / collapsed.

[0075] The data source of the table is created layer by layer, and the data structure defined in the data dictionary corresponds to the columns of the table rows. Figure 5 The tree data shown in the figure, when constructing the data source, first generate the first layer data list, which is the data encoded as L01, L02, L03, then generate the child data layer by layer according to the first layer data and associate it with the current parent data, and so on, and finally generate Figure 5 The data source shown.

[0076] 2. If Figure 6 As shown, the first data in the list is obtained, and a table row GridItem is generated, the code column is L01, and the style information of the table row in the table visual area is filled;

[0077] 3. If Fig. 7AAs shown, it is determined whether the table row numbered L01 has a sub-item. If so, a table row numbered 010101001001 is created, and the style information of the table row in the table visible area is filled;

[0078] 4. If Figure 7B As shown, it is determined whether the table row numbered 010101001001 has a sub-item. If so, a table row numbered 10101004 is created, and the style information of the table row in the table visible area is filled;

[0079] 5. If Figure 8 As shown, it is determined whether the table row numbered 10101004 has a sub-item. If there is no sub-item, return to the upper table row 010101001001 to continue creating the table row numbered 10101006, and fill in the style information of the table row in the visible area of ​​the table;

[0080] 6. The following steps are repeated in the same way to obtain the second data in the list, continue to create a table row coded as L02, and fill in the style information of the table row in the visible area of ​​the table;

[0081] 7. Get the third data in the list, continue to create a table row coded as L03, and fill in the style information of the table row in the visible area of ​​the table;

[0082] 8. Determine whether the table row numbered L03 has subitems. If yes, create a table row numbered 010101005001 and fill in the style information of the table row in the visible area of ​​the table;

[0083] 9. Determine whether the table row numbered 010101005001 has subitems. If yes, create a table row numbered 10101004 and fill in the style information of the table row in the visible area of ​​the table;

[0084] 10. The data in the list is obtained and the data in the visible area of ​​the Grid control table row is finally filled.

[0085] It can be understood that the method provided in the embodiment of the present application can be encapsulated as an SDK (generally referring to a software development kit) or provided as a service in an independent form. Users can convert various types of electronic spreadsheets to meet the input requirements of the method of the present invention (or other data input forms to which the method can be applied) to obtain information on redundant rows and columns, and then perform streamlining operations.

[0086] Optionally, the data structure definition may be modified accordingly, the data format may be described in other protocol formats (such as XML (Extensible Markup Language)), or the local algorithm may be fine-tuned.

[0087] By using an n-ary tree depth-first approach to handle the table row creation process during the tree-level data flattening process, table rows only need to be appended to the table row list in the creation process, greatly improving the efficiency of table row creation and reducing performance issues caused by the traditional insertion method of appending table rows to the table row list.

[0088] In actual applications, through testing with performance testing tools (such as jprofiler), it was found that by using the method of this application to create table rows and combining the patent "201710918445.1-Data display optimization method, device, terminal device and storage medium", when the client is configured as (operating system-Windows10 / CPU-Intel Core i3 9100 / memory-DDR4 8G), the time consumed to display a table data of 10,000 rows, 35 columns and 3 layers is about 300ms, which greatly improves the efficiency of the software in processing large-scale data display and improves user satisfaction with human-computer interaction.

[0089] like Fig. 9 FIG. 1 is a schematic diagram of an embodiment of a server in an embodiment of the present invention, which may include:

[0090] Receiving module 901, used for receiving a data list in a tree table;

[0091] A traversal module 902, used to traverse the data in the data list, generate corresponding table rows according to the traversed data and add them to the table row list;

[0092] The judging module 903 is used to judge whether the current table row is expanded;

[0093] The table expansion processing module 904 is used to read the sub-item list when the current table row is expanded and has sub-items, jump to the receiving module, and receive the sub-table row of the current table row;

[0094] The table folding processing module 905 is used to jump to the traversal module and generate the next table row in the list when the current table row is folded.

[0095] Optionally, when the tree table in the receiving module receives the last piece of data in the data list, the tree table generation optimization process ends.

[0096] Optionally, the tree-shaped table flattens the table by creating the table rows layer by layer when generating the table rows, and all the table rows are stored in the form of a list.

[0097] Optionally, fill in the style information in the table's visible area while creating the table row.

[0098] like Fig.10As shown, it is another embodiment schematic diagram of the server in the embodiment of the present application, which may include:

[0099] A memory 1001 storing executable program codes;

[0100] A processor 1002 coupled to the memory 1001;

[0101] Processor 1002, for receiving a data list in a tree-shaped table; traversing the data in the data list, generating corresponding table rows according to the traversed data and adding the rows to the table row list;

[0102] Optionally, processor 1002 is specifically used to determine whether the current table row is expanded; when the current table row is expanded and has sub-items, read the sub-item list, continue to receive and create sub-table rows of the current table row; when the current table row is folded, continue to iterate and generate the next table row in the list.

[0103] Optionally, processor 1002, when the tree table receives the last piece of data in the data list, the tree table generation optimization process ends.

[0104] Optionally, the processor 1002, when generating table rows, the tree-shaped table adopts a layer-by-layer creation method to achieve table flattening, and all table rows are stored in the form of a list.

[0105] Optionally, the processor 1002 fills the style information in the visible area of ​​the table while creating the table row.

[0106] In the above embodiments, all or part of the embodiments may be implemented by software, hardware, firmware or any combination thereof. When implemented by software, all or part of the embodiments may be implemented in the form of a computer program product.

[0107] The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function described in the embodiment of the present invention is generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from a website site, a computer, a server, or a data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (Digital Subscriber Line, DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server, or data center. The computer-readable storage medium may be any available medium that a computer can store or a data storage device such as a server or a data center that includes one or more available media integrated. The available medium may be a magnetic medium, (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state drive (SSD)), etc.

[0108] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0109] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0110] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0111] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0112] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a disk or an optical disk.

[0113] As described above, the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. A method for optimizing tree table generation, characterized in that: include: Receiving step, the tree table receives the data list; Traversal step, traversing the data in the data list, generating corresponding table rows according to the traversed data and adding them to the table row list; Determine whether the current table row is expanded; When the current table row is expanded and has sub-items, read the sub-item list, jump to the receiving step, and receive the sub-table row of the current table row; When the current table row is collapsed, jump to the traversal step to generate the next table row in the list; The data displayed in the spreadsheet is tree-like hierarchical data, and the table row hierarchy can be infinitely nested; the data source of the table is created layer by layer, and the data structure defined in the data dictionary corresponds to the columns of the table row; When constructing a data source, first generate the first-level data list data, then generate the child item data layer by layer based on the first-level data and associate it with the current parent item data, and so on, and finally generate a data source for the tree data; By using an n-ary tree depth-first approach to process the creation process of table rows during the flattening of tree-like hierarchical data, the table rows only need to be appended to the table row list in the creation process.

2. The method according to claim 1, characterized in that When the tree-shaped table receives the last piece of data in the data list in the receiving step, the tree-shaped table generation optimization process ends.

3. The method according to any one of claims 1 to 2, characterized in that: The tree-shaped table flattens the table by creating the table rows layer by layer when generating the table rows, and all the table rows are stored in the form of a list.

4. The method according to claim 3, characterized in that Also includes: When creating a table row, fill in the style information in the table's visible area.

5. A server, characterized in that: include: Receiving module, used for receiving data list from tree table; The traversal module is used to traverse the data in the data list, generate corresponding table rows according to the traversed data and add them to the table row list; The judgment module is used to judge whether the current table row is expanded; The table expansion processing module is used to read the sub-item list when the current table row is expanded and has sub-items, jump to the receiving module, and receive the sub-table row of the current table row; The table folding processing module is used to jump to the traversal module and generate the next table row in the list when the current table row is folded; The data displayed in the spreadsheet is tree-like hierarchical data, and the table row hierarchy can be infinitely nested; the data source of the table is created layer by layer, and the data structure defined in the data dictionary corresponds to the columns of the table row; When constructing a data source, first generate the first-level data list data, then generate the child item data layer by layer based on the first-level data and associate it with the current parent item data, and so on, and finally generate a data source for the tree data; By using an n-ary tree depth-first approach to process the creation process of table rows during the flattening of tree-like hierarchical data, the table rows only need to be appended to the table row list in the creation process.

6. The server according to claim 5, characterized in that: When the tree table in the receiving module receives the last piece of data in the data list, the tree table generation optimization process ends.

7. A server, characterized in that: include: A memory storing executable program code; and a processor coupled to the memory; The processor calls the executable program code stored in the memory to execute the method according to any one of claims 1 to 4.

8. A computer-readable storage medium comprising instructions, which, when executed on a processor, causes the processor to perform the method according to any one of claims 1 to 4.

Citation Information

Patent Citations

  • XML (Extensible Markup Language) document structure based on extended adjacent matrix and semantic similarity calculation method

    CN101799825A

  • HTML table semantic venation analysis method

    CN102043819A

  • Data display optimization method and device, terminal equipment and storage medium

    CN107704576A

  • Data UE visual design system

    CN111190597A

  • High-performance list implementation method and equipment based on tree structure data

    CN112434030A