WO2021004266A1

WO2021004266A1 - Data insertion method and apparatus, device and storage medium

Info

Publication number: WO2021004266A1
Application number: PCT/CN2020/097563
Authority: WO
Inventors: 张泓毅; 陈振强
Original assignee: 星环信息科技（上海）有限公司
Priority date: 2019-07-10
Filing date: 2020-06-23
Publication date: 2021-01-14
Also published as: CN110362577B; CN110362577A

Abstract

Disclosed are a data insertion method and apparatus, a device and a storage medium. The data insertion method comprises: determining, according to an acquired data insertion command, an insertion action type of the data insertion command; insofar as the insertion action type is dynamic partition insertion, determining, according to meta-information of a target table, partition and bucket division information of the target table; dividing, according to the partition and bucket division information, data, which is to be inserted, into at least one group; sorting said data in each group according to the partition and bucket division information; and according to the sequence of said data in each group, dynamically inserting said data in each group into a corresponding target table file in sequence.

Description

Data insertion method, device, equipment and storage medium

This application claims the priority of the Chinese patent application filed with the Chinese Patent Office with application number 201910619873.3 on July 10, 2019. The entire content of this application is incorporated into this application by reference.

Technical field

This application relates to data storage technology, such as a data insertion method, device, equipment, and storage medium.

Background technique

As application scenarios become more complex, data often flows between different databases. With the advent of the big data era, the amount of data imported or exported between databases is also increasing.

Partitioning is a commonly used data organization method in databases. Most of the related technologies use a single partition to insert one by one, and the performance cannot meet the requirements when processing large quantities of data. If you want to insert different partitions at the same time, it will cause system instability due to operating too many files in different partitions at the same time for a long time, such as excessive memory usage and too many open file handles.

Summary of the invention

This application provides a data insertion method, device, equipment, and storage medium to improve the performance of dynamic partition insertion while ensuring system stability.

Provides a data insertion method, including:

Determine the type of insertion action of the data insertion command according to the acquired data insertion command;

In a case where the insertion action type is dynamic partition insertion, determine the partition and bucket information of the target table according to the meta information of the target table;

Divide the data to be inserted into at least one group according to the partition and bucket information;

Sort the data to be inserted in each group according to the partition and bucket information;

According to the sequence of the data to be inserted in each group, each group of data to be inserted is dynamically inserted into the corresponding target table file in turn.

A data insertion device is also provided, including:

An insert action type determining module, configured to determine the insert action type of the data insert command according to the acquired data insert command;

The partitioning bucket information determining module is configured to determine the partitioning and bucketing information of the target table according to the meta-information of the target table when the insertion action type is dynamic partition insertion;

A data grouping module, configured to divide the data to be inserted into at least one group according to the partition and bucket information;

A data sorting module, configured to sort the data to be inserted in each group according to the partition and bucket information;

The data insertion module is configured to dynamically insert each group of data to be inserted into the corresponding target table file in sequence according to the sequence of the data to be inserted in each group.

A device is also provided, and the device includes:

One or more processors;

Memory, set to store one or more programs,

When the one or more programs are executed by the one or more processors, the one or more processors implement the data insertion method provided in any embodiment of the present application.

A storage medium containing computer-executable instructions is also provided, and the computer-executable instructions are used to execute the data insertion method provided in any embodiment of the present application when executed by a computer processor.

Description of the drawings

FIG. 1 is a flowchart of a data insertion method in Embodiment 1 of the present application;

2 is a flowchart of a data insertion method in Embodiment 2 of the present application;

FIG. 3 is a flowchart of a data insertion method in Embodiment 3 of the present application;

4 is a flowchart of a data insertion method in the fourth embodiment of the present application;

FIG. 5 is a flowchart of a data insertion method in Embodiment 5 of the present application;

6 is a schematic structural diagram of a data insertion device in the sixth embodiment of the present application;

FIG. 7 is a schematic structural diagram of a device in Embodiment 7 of the present application.

Detailed ways

The application will be described below with reference to the drawings and embodiments. The drawings only show a part but not all of the structure related to this application.

Example one

Fig. 1 is a flowchart of a data insertion method provided in the first embodiment of this application. This embodiment is applicable to the case of importing data into a database. The method can be executed by a data insertion device, which can be hardware and/or Software implementation, including the following steps:

Step 110: Determine the insertion action type of the data insertion command according to the acquired data insertion command.

Among them, when a data insertion task needs to be executed, a corresponding insertion command will be executed. According to the data insertion command of the database engine, it can be determined whether it is a dynamic partition insertion or a static partition insertion. Static partition insertion refers to specifying the target partition when inserting data, and it can only be inserted into one partition at a time; dynamic partition insertion refers to not specifying the target partition when inserting data, but dynamically judging the target partition of the data according to the partition column. Insert into multiple partitions.

Step 120: When the insert action type is dynamic partition insertion, determine the partition and bucket information of the target table according to the meta information of the target table.

Among them, if it is a dynamic partition insertion, the meta information of the target table is obtained, and the partition and bucket information of the target table is determined. For example, according to the insert command of the sql statement, determine whether it is a dynamic partition insert, and then obtain the meta-information of the target table, determine whether the target table is a partitioned non-bucketed table, or a partitioned bucketed table, and partition columns , Bucket column and other information.

Step 130: According to the partition and bucket information, divide the data to be inserted into at least one group.

Among them, if the target table is a bucketed table, when the data to be inserted is grouped, ensure that the data of the same bucketed file is in the same group. If the target table is not a bucketed table, theoretically any grouping of the inserted data will not be inserted into the dynamic partition. Make an impact. In order that the amount of data to be inserted in a single group will not be too large, resulting in too much data that needs to be sorted in the group, the data to be inserted can be grouped to avoid too much data to be inserted in a single group. Generally, the data to be inserted can be Group evenly. Optionally, when the target table is a partitioned non-bucketed table, the data to be inserted is divided into at least one group according to the first grouping rule. For example, dividing the data to be inserted into at least one group according to the first grouping rule includes: obtaining a preset number of groups; determining the group identification number of each piece of data to be inserted, wherein the group identification number includes the preset field of the data to be inserted The hash value or the random number corresponding to the data to be inserted; the result of modulo the preset group number and the group number according to the group identification number, and the data to be inserted is allocated to the result of the modulus and the group number corresponding to the Array. That is, determine how many groups the data to be inserted will be divided into, calculate the hash value for each selected field of the data to be inserted, or generate a random number for each data to be inserted, and use the obtained hash value or random number as the The group identification number of the data to be inserted is modulo the preset grouping number according to the group identification number, and the result of the modulus is matched with the group number, so that the data to be inserted is allocated to the array corresponding to each group of data to be inserted. For example, the preset group number is 7 (group number is 0-6), the hash value of a selected field of the data to be inserted is 123878437872, and the modulo 7 is 0, so the data to be inserted is assigned to the group number 0 group. It is also possible to divide the data to be inserted into at least one group according to the amount of data to be inserted and the amount of the preset single group of data; wherein the amount of data to be inserted in each group is less than or equal to the amount of the preset single group of data. If the number of data to be inserted is less than or equal to the preset single group of data, then only one group is enough; if the number of data to be inserted is greater than the preset single group of data, then it is divided into multiple groups, each group to be inserted The amount of data is less than or equal to the preset single set of data amount. Among them, the data can be grouped in equal proportions or in unequal proportions, which is not limited here.

Step 140: Sort the data to be inserted in each group according to the partition and bucket information.

Among them, after grouping, each group of data to be inserted is sorted within the group according to the value of the partition column, and the sorting is to ensure that the data of the same partition is arranged continuously. In this way, when inserting is performed in a group, the data to be inserted corresponding to the same target table partition is adjacent and arranged consecutively. The data to be inserted corresponding to the same target table partition is inserted into the partition file of the target table. Insert the data to be inserted into the next target table partition.

Step 150: According to the order of the data to be inserted in each group, dynamically insert each group of data to be inserted into the corresponding target table file in turn.

Among them, insert according to the order of the data to be inserted in the group. After the data to be inserted corresponding to the same target table partition is inserted, the next target table partition that needs to be inserted data is automatically identified until all the data to be inserted in the group is inserted When finished, insert each group of data to be inserted, thereby completing all the data to be inserted into the target table file.

Automatically identify the scenario of dynamic partition insertion, divide and sort the data for partitions and bucket columns, so that during the process of dynamic partition insertion, the effect of inserting one partition at a time is the same as static partition insertion. The premise is to perform an operation This not only avoids repeated table scans for multiple partitions, but also avoids huge pressure on memory or file handles.

The technical solution of this embodiment solves the problem of system instability caused by operating a large number of files in different partitions at the same time for a long time by sorting the data to be inserted into the target table one by one, inserting into the target table one by one, and ensuring the stability of the system. Next, the effect of improving the performance of dynamic partition insertion.

Example two

Fig. 2 is a flowchart of a data insertion method provided in the second embodiment of the application. The technical solution of this embodiment is described on the basis of the above technical solution, and includes the following steps:

Step 210: Determine the insertion action type of the data insertion command according to the acquired data insertion command.

Step 220: When the insert action type is dynamic partition insertion, determine the partition and bucket information of the target table according to the meta information of the target table.

Step 230: When the target table is a partitioned and bucketed table, group the data to be inserted according to the hash value of the bucketed column.

Among them, after obtaining the partition and bucket information, if the target table is a partition and bucket table, first divide the source table data into a bucket array according to the hash value of the bucket column of the target table, so as to ensure that the same bucket file should be inserted at the end The data must be in the same group, which is semantically equivalent to distribute by buckets.

Step 240: Sort the data to be inserted in the group according to the partition and bucket information.

Step 250: According to the sequence of the data to be inserted in the group, dynamically insert each group of data to be inserted into the corresponding target table file in turn.

The technical solution of this embodiment, by grouping the data in the same bucket, ensures that the data to be inserted that needs to be inserted into the same bucket file are in the same group, so as to avoid repeated scanning of partitions during dynamic partition insertion, and improve dynamic partition insertion. performance.

Example three

Fig. 3 is a flowchart of a data insertion method provided in the third embodiment of the application. The technical solution of this embodiment is described on the basis of the above technical solution, and includes the following steps:

Step 310: Determine the insertion action type of the data insertion command according to the acquired data insertion command.

Step 320: When the insert action type is dynamic partition insertion, determine the partition and bucket information of the target table according to the meta information of the target table.

Step 330: According to the partition and bucket information, divide the data to be inserted into at least one group.

Step 340: When the target table is a multi-level partition table, sort the data to be inserted in the group according to the order of the partitions of the target table.

Wherein, if the target table is a multi-level partition table determined by the partition and bucket information, the data to be inserted in the group is sorted in order according to the partition order of the target table. Semantically equivalent to sort by partition column 1, partition column 2... This ensures the continuous arrangement of data in the same partition.

Step 350: When the target table is a multi-level range partition table, sort the data to be inserted in the group according to the sequence after the target table partition field is mapped to the range partition of the target table.

Among them, if the target table is determined by the partition and bucket information to be a multi-level range partition table, because the multi-level range partition table is not a single-value partition corresponding to a value of a partition key, but a range of a partition corresponding to a partition key value. That is, the range of the value of a partition key. Therefore, multi-level range partition sorting should sort the data to be inserted in the group after the partition field is mapped to the partition. Exemplarily, for the range partition r1, r2 with 2 fields. r1 is the date (date) type, r2 is the integer (int) type, and the range partition is first partitioned by the month of r1 ([1970-01-01,1970-01-31] a partition, [1970-02-01,1970 -02-28] a partition), and then partition according to the hundreds of r2 (ie [0,99] is in a partition, [100,199] is in a partition, etc.). Then, to_month(r1), r2/10 should be sorted. The equivalent syntax is distribute by to_month(r1), r2/10. If the data to be inserted in the group is sorted directly by the value of the partition key, the following order may appear: (1970-01-01,1),(1970-01-01,11),(1970-01-02,2 ), and they belong to partition 1, partition 2, and partition 1, respectively. The data in the same partition is not arranged together. If it is for a single range partition field, it can be simplified to directly sort the data to be inserted in the group by the value of the partition field.

Step 360: According to the sequence of the data to be inserted in the group, dynamically insert each group of data to be inserted into the corresponding target table file in turn.

In an embodiment, step 340 and step 350 are executed selectively according to the partition type of the target table, and the order of execution is not limited as shown in FIG. 3.

In the technical solution of this embodiment, the data to be inserted in the group is sorted through the case that the target table is a range partition to ensure that the data to be inserted in the same partition is arranged continuously, so that when the data in the group is dynamically partitioned and inserted sequentially, There is no need to repeatedly open different partition files, which improves the performance of dynamic partition insertion.

Example four

FIG. 4 is a flowchart of a data insertion method provided in Embodiment 4 of this application. The technical solution of this embodiment is described on the basis of the above technical solution, and includes the following steps:

Step 410: Determine the insertion action type of the data insertion command according to the acquired data insertion command.

Step 420: When the insert action type is dynamic partition insertion, determine the partition and bucket information of the target table according to the meta information of the target table.

Step 430: According to the partition and bucket information, divide the data to be inserted into at least one group.

Step 440: Sort the data to be inserted in the group according to the partition and bucket information.

Step 450: Read the first row in the current group, open the file handle corresponding to the first row as the current file handle, and write the data to be inserted in the first row into the current file handle.

Step 460: Read the next row as the current row in sequence, and if the current row belongs to the target table file corresponding to the current file handle, write the data to be inserted in the current row into the current file handle.

Step 470: If the current row does not belong to the target table file corresponding to the current file handle, close the current file handle, open the file handle corresponding to the current row, and write the data to be inserted in the current row into the file handle corresponding to the current row.

Step 480: When the next row cannot be read in the current group, the insertion operation of the data to be inserted in the group is ended; the insertion operation of all groups is completed in a preset order.

Among them, after the data to be inserted is grouped, if the target table is a partitioned and bucketed table, it is guaranteed that the data in the same bucket must be grouped into a group, and the data to be inserted in the group is sorted according to the partition attribution, thus ensuring The data belonging to the same partition must be arranged continuously during the insertion process. Therefore, in the process of inserting files, you only need to open one file at a time for continuous insertion. When a row is found that does not belong to the currently opened file, then all the data to be inserted belonging to the currently opened file in this group must have been inserted previously. Therefore, you can directly close the currently opened file, and open the corresponding file to which the current line belongs, and you can continue to insert.

In the technical solution of this embodiment, after the data to be inserted is grouped and sorted within the group, only one file needs to be opened at a time to perform continuous insertion of the data to be inserted, and the same file does not need to be opened repeatedly, thus ensuring the stability of the system Next, improve the performance of dynamic partition insertion.

Example five

This embodiment is an optional embodiment of the application. As shown in FIG. 5, the SQL insert instruction is executed to query the meta information of the target table to obtain the partition and bucket information of the target table. Determine whether it is a dynamic partition insertion. If it is, determine whether the target table is bucketed according to the meta-information of the target table. If the target table is bucketed, group the source table data according to the hash value of the bucket column. If the target table is not bucketed according to The preset rules divide the data to be inserted into at least one group. Perform sorting within the group according to the partition column field for each grouping. After that, take the first row in the group as the current row, open the handle corresponding to the current row, determine whether the current row belongs to the file corresponding to the current handle, if the current row belongs to the file corresponding to the current handle, write the current row to the file handle, and read the next row As the current line; if the current line does not belong to the file corresponding to the current handle, close the current handle, open the handle corresponding to the current line, write the current line to the file handle, and read the next line as the current line. Judge whether the next line exists, if there is the next line, return to determine whether the current line belongs to the file corresponding to the current handle, if the next line does not exist, this group of insertion ends. After that, follow the steps above to insert other groups of data. For example, the target table is a partitioned and bucketed table, as shown in Table 1.

Table 1

Obtain the meta-information of the target table, and then divide the source data into 4 groups according to the bucket column, as shown in Table 2.

Table 2

Then perform intra-group sorting on partition columns for each group to ensure that columns with the same partition key must be adjacent. According to the above grouping and partitioning information, you can open only one file at the same time, insert the data corresponding to the partition and bucket, and then insert the next file, as shown in Table 3.

table 3

Example Six

6 is a schematic structural diagram of a data insertion device provided by Embodiment 6 of the application. The device can be configured in a database. The device includes: an insertion action type determination module 610, a partition and bucket information determination module 620, and a data grouping module 630 , The data sorting module 640 and the data inserting module 650.

The insertion action type determining module 610 is configured to determine the insertion action type of the data insertion command according to the acquired data insertion command;

The partition bucket information determining module 620 is configured to determine the partition bucket information of the target table according to the meta information of the target table when the insert action type is dynamic insert;

The data grouping module 630 is configured to divide the data to be inserted into at least one group according to the partition and bucket information;

The data sorting module 640 is configured to sort the data to be inserted in each group according to the partition and bucket information;

The data insertion module 650 is configured to dynamically insert each group of data to be inserted into the corresponding target table file in sequence according to the sequence of the data to be inserted in each group.

Optionally, the data grouping module 630 includes:

The first grouping unit is configured to divide the data to be inserted into at least one group according to the first grouping rule when the target table is a partitioned non-bucketed table.

Optionally, the first grouping unit is set to:

The data to be inserted is divided into at least one group according to the amount of data to be inserted and the amount of the preset single group of data; wherein the amount of data to be inserted in each group is less than or equal to the amount of preset single group of data.

Optionally, the first grouping unit is set to:

Get the preset number of groups;

Determining the group identification number of each piece of data to be inserted, where the group identification number includes a hash value of a preset field of the data to be inserted or a random number corresponding to the data to be inserted;

According to the result of modulo the preset group number and the group number according to the group identification number, the data to be inserted is allocated to the corresponding array.

Optionally, the data grouping module 630 includes:

The second grouping unit is set to group the data to be inserted according to the hash value of the bucketing column when the target table is a partitioned bucketing table.

Optionally, the data sorting module 640 includes:

The first sorting unit is set to sort the data to be inserted in each group according to the order of the partitions of the target table when the target table is a multi-level partition table.

Optionally, the data sorting module 640 includes:

The second sorting unit is set to sort the data to be inserted in each group according to the sequence after the target table partition field is mapped to the range partition of the target table when the target table is a multi-level range partition table.

Optionally, the data insertion module 650 includes:

The first writing unit is set to read the first row in the current group, open the file handle corresponding to the first row as the current file handle, and write the data to be inserted in the first row into the current file handle;

The second writing unit is set to read the next row as the current row in sequence. If the current row belongs to the target table file corresponding to the current file handle, write the data to be inserted in the current row into the current file handle;

The third writing unit is set to close the current file handle if the current row does not belong to the target table file corresponding to the current file handle, open the file handle corresponding to the current row, and write the data to be inserted in the current row into the file handle corresponding to the current row ；

The insertion end unit of the group is set to end the insertion operation of the data to be inserted in the group when the next line cannot be read in the current group;

Full group insertion unit, set to complete the insertion operation of all groups in a preset order.

The data insertion device provided in the embodiment of the present application can execute the data insertion method provided in any embodiment of the present application, and has functional modules and beneficial effects corresponding to the execution method.

Example Seven

FIG. 7 is a schematic structural diagram of a device provided in Embodiment 7 of the application. As shown in FIG. 7, the device includes a processor 710, a memory 720, an input device 730, and an output device 740; the number of processors 710 in the device may be One or more, one processor 710 is taken as an example in FIG. 7; the processor 710, the memory 720, the input device 730, and the output device 740 in the device can be connected by a bus or other means. In FIG. 7, the connection by a bus is taken as an example .

As a computer-readable storage medium, the memory 720 can be used to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the data insertion method in the embodiment of the present application (for example, the insertion action in the data insertion device). Type determination module 610, partition and bucket information determination module 620, data grouping module 630, data sorting module 640, and data insertion module 650). The processor 710 executes various functional applications and data processing of the device by running the software programs, instructions, and modules stored in the memory 720, that is, realizes the aforementioned data insertion method.

The memory 720 may include a program storage area and a data storage area. The program storage area may store an operating system and an application program required for at least one function; the data storage area may store data created according to the use of the terminal, and the like. In addition, the memory 720 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state storage devices. In some examples, the memory 720 may include a memory remotely provided with respect to the processor 710, and these remote memories may be connected to the device through a network. Examples of the aforementioned networks include the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

The input device 730 may be used to receive inputted numeric or character information, and generate key signal input related to user settings and function control of the device. The output device 740 may include a display device such as a display screen.

Example eight

The eighth embodiment of the present application also provides a storage medium containing computer-executable instructions, which are used to execute a data insertion method when the computer-executable instructions are executed by a computer processor, and the method includes:

When the insertion action type is dynamic partition insertion, determine the partition and bucket information of the target table according to the meta information of the target table;

An embodiment of the present application provides a storage medium containing computer-executable instructions. The computer-executable instructions include the method operations described above, and can also perform related operations in the data insertion method provided in any embodiment of the present application.

This application can be implemented with the help of software and necessary general-purpose hardware, or can be implemented with hardware. The technical solution of this application can be embodied in the form of a software product. The computer software product can be stored in a computer-readable storage medium, such as a computer floppy disk, read-only memory (ROM), and random access memory ( Random Access Memory, flash memory (FLASH), hard disk or optical disk, etc., including at least one instruction to make a computer device (which can be a personal computer, a server, or a network device, etc.) execute the multiple embodiments of this application Methods.

In the above embodiment of the data insertion device, the multiple units and modules included are only divided according to the functional logic, but are not limited to the above division, as long as the corresponding functions can be realized; in addition, the multiple functional units The names are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application.

Claims

A data insertion method, including:

Determine the type of insertion action of the data insertion command according to the acquired data insertion command;

In a case where the insertion action type is dynamic partition insertion, determine the partition and bucket information of the target table according to the meta information of the target table;

Divide the data to be inserted into at least one group according to the partition and bucket information;

Sort the data to be inserted in each group according to the partition and bucket information;

According to the sequence of the data to be inserted in each group, each group of data to be inserted is dynamically inserted into the corresponding target table file in turn.
The method according to claim 1, wherein the dividing the data to be inserted into at least one group according to the partition and bucketing information comprises:

In a case where the target table is a partitioned non-bucketed table, the data to be inserted is divided into at least one group according to the first grouping rule.
The method according to claim 2, wherein the dividing the data to be inserted into at least one group according to the first grouping rule comprises:

Get the preset number of groups;

Determining the group identification number of each piece of data to be inserted, where the group identification number includes a hash value of a preset field of the data to be inserted or a random number corresponding to the data to be inserted;

The data to be inserted is allocated to an array corresponding to the result of the modulus and the group number according to the result of modulo the preset group number and the group number.
The method according to claim 1, wherein the dividing the data to be inserted into at least one group according to the partition and bucketing information comprises:

When the target table is a partitioned and bucketed table, the data to be inserted is grouped according to the hash value of the bucketed column.
The method according to claim 1, wherein the sorting the data to be inserted in each group according to the partition and bucket information comprises:

In the case that the target table is a multi-level partition table, the data to be inserted in each group is sorted according to the order of the partition of the target table.
The method according to claim 1, wherein the sorting the data to be inserted in each group according to the partition and bucket information comprises:

In the case that the target table is a multi-level range partition table, the data to be inserted in each group is sorted according to the sequence after the target table partition field is mapped to the range partition of the target table.
The method according to claim 1, wherein the step of dynamically inserting each group of data to be inserted into the corresponding target table file in turn according to the sequence of the data to be inserted in each group includes:

Read the first row in the current group, open the file handle corresponding to the first row as the current file handle, and write the data to be inserted in the first row into the current file handle;

Sequentially read the next row as the current row, and in the case that the current row belongs to the target table file corresponding to the current file handle, write the data to be inserted in the current row into the current file handle;

In the case that the current row does not belong to the target table file corresponding to the current file handle, the current file handle is closed, the file handle corresponding to the current row is opened, and the data to be inserted in the current row is written to the State the file handle corresponding to the current line;

In the case that the next row cannot be read in the current group, end the insertion operation of the data to be inserted in the group;

Complete the insert operation of all groups in the preset order.
A data insertion device includes:

An insert action type determining module, configured to determine the insert action type of the data insert command according to the acquired data insert command;

The partitioning bucket information determining module is configured to determine the partitioning and bucketing information of the target table according to the meta-information of the target table when the insertion action type is dynamic partition insertion;

A data grouping module, configured to divide the data to be inserted into at least one group according to the partition and bucket information;

A data sorting module, configured to sort the data to be inserted in each group according to the partition and bucket information;

The data insertion module is configured to dynamically insert each group of data to be inserted into the corresponding target table file in sequence according to the sequence of the data to be inserted in each group.
A device that includes:

One or more processors;

Memory, set to store one or more programs,

The one or more programs are executed by the one or more processors, so that the one or more processors implement the data insertion method according to any one of claims 1-7.
A storage medium containing computer-executable instructions, when the computer-executable instructions are executed by a computer processor, are used to execute the data insertion method according to any one of claims 1-7.