CN111767279A - Data merging method and apparatus - Google Patents

Abstract

The application provides a data merging method and a data merging device, wherein the method comprises the following steps: the data table to be merged is obtained, whether the initial data table and the data table to be merged meet preset aggregation conditions or not is judged, and if the initial data table and the data table to be merged meet the preset aggregation conditions, the initial data table and the data table to be merged are merged to generate a target data table. Therefore, the generated data items are generated into the data lists in real time, and the data lists meeting the aggregation condition are combined, so that the memory is saved, the related data lists can be rapidly provided during query, and the query efficiency is improved.

Description

Data merging method and apparatus

technical field

The present application relates to the technical field of data processing, and in particular, to a data merging method and apparatus.

Background technique

With the rapid development of Internet technology, for example, the advertising system accesses a large number of requests every day and generates a large amount of data. How to perform statistical analysis on the massive data is a very challenging task.

In related technologies, the batch computing of hadoop or spark is used to perform statistical analysis and generate statistical reports. Specifically, the collected data is first written into the distributed file system of hadoop, and the computing tasks of hadoop or spark are periodically started for offline processing. Completion of statistical analysis tasks.

However, in the above methods, the lack of timeliness results in the inability to obtain key data such as advertising effects and website access frequency in a timely manner, and inability to quickly adjust services, and consume a large amount of storage and computing resources, resulting in poor query efficiency.

SUMMARY OF THE INVENTION

The present application aims to solve one of the technical problems in the related art at least to a certain extent.

To this end, the present application proposes a data merging method and device, which are used to solve the lack of timeliness in the prior art, resulting in the inability to obtain key data such as advertising effects and website access frequency in a timely manner, and inability to quickly perform business adjustments, and It consumes a lot of storage resources and computing resources, which leads to technical problems of poor query efficiency, realizes efficient data consolidation, and improves the performance of data statistical analysis.

In order to achieve the above purpose, a first aspect embodiment of the present application proposes a data merging method, including:

Get the data table to be merged;

Judging whether the initial data table and the data table to be merged meet the preset aggregation conditions;

If it is determined that the initial data table and the data table to be merged meet the preset aggregation conditions, the initial data table and the data table to be merged are merged to generate a target data table.

In the data merging method of this embodiment, by acquiring the data table to be merged, then judging whether the initial data table and the data table to be merged meet the preset aggregation conditions, if it is judged that the initial data table and the data table to be merged meet the preset aggregation conditions, Then the initial data table and the data table to be merged are combined to generate the target data table. Therefore, by generating a data list from the generated data entries in real time, and merging the various data lists that meet the aggregation conditions, memory is saved, and related data tables may be quickly provided during query, thereby improving query efficiency.

In order to achieve the above purpose, a second aspect embodiment of the present application provides a data merging device, including:

The first acquisition module is used to acquire the data table to be merged;

a judgment module for judging whether the initial data table and the to-be-merged data table satisfy a preset aggregation condition;

The merging module is configured to merge the initial data table and the data table to be merged to generate a target data table if it is determined that the initial data table and the data table to be merged meet a preset aggregation condition.

The data merging device of this embodiment obtains the data table to be merged, and then judges whether the initial data table and the data table to be merged meet the preset aggregation conditions, and if it is determined that the initial data table and the data table to be merged meet the preset aggregation conditions, Then the initial data table and the data table to be merged are combined to generate the target data table. Therefore, by generating a data list from the generated data entries in real time, and merging the various data lists that meet the aggregation conditions, memory is saved, and related data tables may be quickly provided during query, thereby improving query efficiency.

In order to achieve the above purpose, an embodiment of the third aspect of the present application provides a computer device, comprising: a processor and a memory; wherein, the processor executes and executes the operation with the said processor by reading executable program codes stored in the memory. A program corresponding to the executable program code is used to implement the data merging method according to the embodiment of the first aspect.

In order to achieve the above purpose, a fourth aspect embodiment of the present application provides a non-transitory computer-readable storage medium on which a computer program is stored, and when the program is executed by a processor, the data as described in the first aspect embodiment is realized. Merge method.

In order to achieve the above object, the fifth aspect embodiment of the present application provides a computer program product, which implements the data merging method described in the first aspect embodiment when an instruction in the computer program product is executed by a processor.

Additional aspects and advantages of the present application will be set forth, in part, in the following description, and in part will be apparent from the following description, or learned by practice of the present application.

Description of drawings

The above and/or additional aspects and advantages of the present application will become apparent and readily understood from the following description of embodiments taken in conjunction with the accompanying drawings, wherein:

1 is a schematic flowchart of a data merging method provided by an embodiment of the present application;

2 is a schematic diagram of a data table to be merged provided by an embodiment of the present application;

3 is a schematic diagram of real-time merged storage of data tables provided by an embodiment of the present application;

FIG. 4 is an example diagram of data table merging provided by an embodiment of the present application;

5 is a schematic flowchart of another data merging method provided by an embodiment of the present application;

FIG. 6 is a schematic flowchart of another data merging method provided by an embodiment of the present application

FIG. 7 is a schematic structural diagram of a data merging apparatus provided by an embodiment of the present application;

FIG. 8 is a schematic structural diagram of another data merging apparatus provided by an embodiment of the present application;

FIG. 9 is a schematic structural diagram of another data merging apparatus provided by an embodiment of the present application; and

FIG. 10 is a schematic structural diagram of a computer device provided by an embodiment of the present application.

Detailed ways

The following describes in detail the embodiments of the present application, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary, and are intended to be used to explain the present application, but should not be construed as a limitation to the present application.

The data merging method and apparatus according to the embodiments of the present application will be described below with reference to the accompanying drawings.

FIG. 1 is a schematic flowchart of a data merging method provided by an embodiment of the present application.

As shown in Figure 1, the data merging method may include the following steps:

Step 101: Obtain a data table to be merged.

The data in the data merging method of the embodiment of the present application mainly refers to that the Internet system generates massive amounts of data that can be counted at every moment, such as advertisement data (such as clicks, purchases, etc.), and user browsing record data, etc. .

Based on the description of the above background technology, the existing methods of batch calculation and analysis cannot guarantee the timeliness, and need to consume a lot of memory resources and computing resources, and the query efficiency is low. Therefore, the present application generates a data list from the generated data entries in real time, and merges the various data lists that meet the aggregation conditions, so as to save memory, and it is possible to quickly provide relevant data tables during query, thereby improving query efficiency. details as follows:

First, obtain the data table to be merged. It can be understood that there may be one or more data tables to be merged, which can be selected to be merged with the initial data table according to preset conditions, or can be merged between the initial data table and a data table to be merged according to a preset order. After the tables are merged, they are then merged with the next data table to be merged.

Among them, there are many ways to obtain the data table to be merged. As an example, the corresponding data entry is obtained by querying the memory according to the preset number of dimensions, and the data table to be merged is generated according to the data entry; as another example, in order to further To improve the merging efficiency, the prefix index corresponding to the data table to be merged can be obtained, a plurality of initial data entries are determined according to the prefix index, and a target data entry is selected from the plurality of initial data entries to generate the data table to be merged.

In order to make the above description clearer to those in the art, the following describes in detail the advertisement data in conjunction with FIG. 2 . Cost), for example, in the table in Figure 2, you can select the dimensions of Time and Id as the prefix index. When the prefix index is established, for example, there will be one data entry in the index every 1024 rows, so the equivalent prefix index can only locate to an approximate range.

For example, in Figure 2, through the dimensions of Time and Id, it can be determined that the time is 2013/12/31 and the Id is 1 multiple initial data items, and then the Country is selected from the multiple initial data items as US, so that a target can be determined Data entry, and through the dimensions of Time and Id, it can be determined to include multiple initial data entries corresponding to 2013/12/31 and Id 1, and then select Country as US from multiple initial data entries, so that a target can be determined Data entry, through the two column dimensions of Time and Id, it can be determined to include multiple initial data entries corresponding to the time of 2014/01/01 and the Id of 2, and then select the Country as US and UK from the multiple initial data entries, so that the two data entries can be determined. A target data entry is generated, and finally a data table to be merged is generated according to the above target data entry.

Step 102: Determine whether the initial data table and the data table to be merged satisfy a preset aggregation condition.

Step 103: If it is determined that the initial data table and the data table to be merged meet the preset aggregation conditions, the initial data table and the data table to be merged are merged to generate a target data table.

Among them, the initial data table can be the data table imported for the first time. For example, as shown in Figure 3, the data table imported in a single batch is called Singleton Delta, and the accumulated and merged data table can be divided into Cumulative Delta and Base Delta. Among them, base is the initial data table. Each time a batch of data tables is imported, the base will be updated. For example, the version number in Figure 3 increases from 0, so any version that counts from 0 is called the base version. When the import version is continuously added, the data table is also continuously merged into a larger version, which may finally be merged into the base version of 0-60 in Figure 3.

It can be understood that there are many ways to judge whether the initial data table and the data table to be merged meet the preset aggregation conditions. As a possible implementation method, obtain each initial dimension in the initial data table, and obtain the For each dimension to be merged, it is determined whether the initial data table and the data table to be merged meet the preset aggregation conditions according to whether each initial dimension and each dimension to be merged are consistent.

After judging that the initial data table and the data table to be merged meet the preset aggregation conditions, the initial data table and the data table to be merged are merged to generate the target data table. and the data table to be merged meet the preset aggregation conditions.

Among them, there are many ways to combine the initial data table and the data table to be merged to generate the target data table, such as summation, maximum value and minimum value, etc., which can be selected and set according to actual application needs.

As an example, such as the example shown in FIG. 4 , the initial data table Base and the data table Delta to be merged are summed to generate the target data table New Base, so that the data has been merged during statistical analysis, which greatly reduces the amount of calculation.

It should be noted that, in order to further improve the accuracy of merging and the flexibility of subsequent queries, it is also possible to judge whether the dimensions of Click and Cost in Figure 4 above satisfy the preset exchange law, and then proceed when the exchange law is satisfied. merge.

In the data merging method of this embodiment, by acquiring the data table to be merged, then judging whether the initial data table and the data table to be merged meet the preset aggregation conditions, if it is judged that the initial data table and the data table to be merged meet the preset aggregation conditions, Then the initial data table and the data table to be merged are combined to generate the target data table. Therefore, by generating a data list from the generated data entries in real time, and merging the various data lists that meet the aggregation conditions, memory is saved, and related data tables may be quickly provided during query, thereby improving query efficiency.

Based on the description of the above embodiment, in order to further save memory, after the initial data table and the data table to be merged are merged to generate the target data table, as shown in Figure 5, it also includes:

Step 201: Acquire a preset deletion period corresponding to the data table to be merged.

Step 202: Delete the data table to be merged after the preset deletion period of the target data table is generated.

Specifically, a certain deletion period, such as one day, one week, or one month, can be set for each data table to be merged, which can be selected according to actual needs. After the preset deletion period, the data table to be merged will be deleted.

In this way, memory can be saved. In addition, users can read the list to be merged in subsequent queries, which can also be provided directly to improve query efficiency. For example, Cumulative Delta in Figure 3: 61-70, 61-80 And 61-90, 61-70 and 61-80 can be reserved for a period of time, and users can directly query 61-70 to improve query efficiency.

Based on the description of the above-mentioned embodiment, after the initial data table and the data table to be merged are combined to generate the target data table, as shown in FIG. 6 , it also includes:

Step 301, obtaining a query request.

Step 302: Analyze the query request to determine the request data table.

Step 303, outputting and displaying the request data table.

Specifically, after receiving the query request, the query request can be parsed, and the requested data table can be determined, such as the data table to be merged, the initial data table, and the target data table, etc., and the request data table can be directly output and displayed to improve the query performance. Efficiency, user-friendly, and improved user experience.

In order to realize the above embodiments, the present application also proposes a data merging apparatus.

FIG. 7 is a schematic structural diagram of a data merging apparatus provided by an embodiment of the present application.

As shown in FIG. 7 , the data merging apparatus may include: a first obtaining module 710 , a judging module 720 and a merging module 730 . in,

The first obtaining module 710 is configured to obtain the data table to be merged.

The judgment module 720 is used for judging whether the initial data table and the data table to be merged satisfy a preset aggregation condition.

The combining module 730 is configured to combine the initial data table and the data table to be combined to generate a target data table if it is determined that the initial data table and the data table to be combined meet the preset aggregation conditions.

In a possible implementation manner of the embodiment of the present application, the first obtaining module 710 is specifically configured to: obtain a prefix index corresponding to the data table to be merged; determine a plurality of initial data entries according to the prefix index; select from a plurality of initial data entries The target data entry generates the data table to be merged.

In a possible implementation manner of the embodiment of the present application, the judgment module 720 is specifically configured to: obtain each initial dimension in the initial data table; obtain each dimension to be merged in the data table to be merged; according to each initial dimension and each dimension to be merged Whether it is consistent to determine whether the initial data table and the data table to be merged meet the preset aggregation conditions.

In a possible implementation manner of the embodiment of the present application, as shown in FIG. 8 , on the basis of FIG. 7 , it further includes: a second acquiring module 740 and a deleting module 750 .

The second obtaining module 740 is configured to obtain the preset deletion period corresponding to the data table to be merged.

The deletion module 750 is configured to delete the data table to be merged after the preset deletion period of the target data table is generated.

In a possible implementation manner of the embodiment of the present application, as shown in FIG. 9 , on the basis of FIG. 7 , it further includes: a third acquiring module 760 , a parsing module 770 and an outputting module 780 .

Wherein, the third obtaining module 760 is used to obtain the query request.

The parsing module 770 is configured to parse the query request and determine the request data table.

The output module 780 is used for outputting and displaying the request data table.

It should be noted that, the foregoing explanations on the data merging method embodiment are also applicable to the data merging apparatus of this embodiment, and the implementation principles thereof are similar, which will not be repeated here.

The data merging apparatus of the embodiment of the present application obtains the data table to be merged, and then judges whether the initial data table and the data table to be merged meet the preset aggregation conditions, and if it is determined that the initial data table and the data table to be merged meet the preset aggregation conditions , the initial data table and the data table to be merged are combined to generate the target data table. Therefore, by generating a data list from the generated data entries in real time, and merging the various data lists that meet the aggregation conditions, memory is saved, and related data tables may be quickly provided during query, thereby improving query efficiency.

In order to realize the above embodiments, the present application also proposes a computer device, including: a processor and a memory. Wherein, the processor executes the program corresponding to the executable program code by reading the executable program code stored in the memory, so as to implement the data merging method described in the foregoing embodiments.

FIG. 10 is a schematic structural diagram of a computer device provided by an embodiment of the present application, and shows a block diagram of an exemplary computer device 90 suitable for implementing the embodiment of the present application. The computer device 90 shown in FIG. 10 is only an example, and should not impose any limitations on the functions and scope of use of the embodiments of the present application.

As shown in FIG. 10, computer device 90 takes the form of a general-purpose computer device. Components of computer device 90 may include, but are not limited to, one or more processors or processing units 906 , system memory 910 , and a bus 908 connecting various system components including system memory 910 and processing unit 906 .

Bus 908 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, a graphics acceleration port, a processor, or a local bus using any of a variety of bus structures. For example, these architectures include, but are not limited to, Industry Standard Architecture (hereinafter referred to as: ISA) bus, Micro Channel Architecture (hereinafter referred to as: MAC) bus, enhanced ISA bus, video electronic standard Association (Video Electronics Standards Association; hereinafter referred to as: VESA) local bus and Peripheral Component Interconnection (Peripheral Component Interconnection; hereinafter referred to as: PCI) bus.

Computer device 90 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by computer device 90, including both volatile and nonvolatile media, removable and non-removable media.

The system memory 910 may include computer system readable media in the form of volatile memory, such as random access memory (Random Access Memory; hereinafter referred to as: RAM) 911 and/or cache memory 912 . Computer device 90 may further include other removable/non-removable, volatile/non-volatile computer system storage media. For example only, storage system 913 may be used to read and write to non-removable, non-volatile magnetic media (not shown in FIG. 10, commonly referred to as a "hard drive"). Although not shown in FIG. 10, disk drives for reading and writing to removable non-volatile magnetic disks (eg, "floppy disks") and removable non-volatile optical disks (eg, compact disk read only memory) may be provided. Disc ReadOnly Memory; hereinafter referred to as: CD-ROM), Digital Video Disc Read Only Memory (hereinafter referred to as: DVD-ROM) or other optical media) read and write optical disc drives. In these cases, each drive may be connected to bus 908 through one or more data media interfaces. System memory 910 may include at least one program product having a set (eg, at least one) of program modules configured to perform the functions of various embodiments of the present application.

A computer-readable signal medium may include a propagated data signal in baseband or as part of a carrier wave, with computer-readable program code embodied thereon. Such propagated data signals may take a variety of forms including, but not limited to, electromagnetic signals, optical signals, or any suitable combination of the foregoing. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device .

Program code embodied on a computer readable medium may be transmitted using any suitable medium including, but not limited to, wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Computer program code for performing the operations of the present application may be written in one or more programming languages, including object-oriented programming languages—such as Java, Smalltalk, C++, but also conventional Procedural programming language - such as the "C" language or similar programming language. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer, or entirely on the remote computer or server.

A program/utility 914 having a set (at least one) of program modules 9140, which may be stored, for example, in system memory 910, such program modules 9140 including, but not limited to, an operating system, one or more application programs, other program modules, and programs Data, each or some combination of these examples may include an implementation of a network environment. Program modules 9140 generally perform the functions and/or methods of the embodiments described herein.

Computer device 90 may also communicate with one or more external devices 10 (eg keyboard, pointing device, display 100, etc.), may also communicate with one or more devices that enable a user to interact with the terminal device 90, and/or communicate with Any device (eg, network card, modem, etc.) that enables the computer device 90 to communicate with one or more other computing devices. Such communication may take place through input/output (I/O) interface 902 . In addition, the computer device 90 can also communicate with one or more networks (eg, Local Area Network (hereinafter referred to as: LAN), Wide Area Network (hereinafter referred to as: WAN) and/or public networks, such as the Internet through the network adapter 900 ) ) communication. As shown in FIG. 10 , network adapter 900 communicates with other modules of computer device 90 via bus 908 . It should be understood that, although not shown in FIG. 10, other hardware and/or software modules may be used in conjunction with computer device 90, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tapes drives and data backup storage systems.

The processing unit 906 executes various functional applications and data merging by running the programs stored in the system memory 910, for example, implementing the data merging method mentioned in the foregoing embodiments.

In order to implement the above-mentioned embodiments, the present application further provides a non-transitory computer-readable storage medium on which a computer program is stored, and when the program is executed by a processor, implements the data merging method described in the foregoing embodiments.

In order to implement the above-mentioned embodiments, the present application further proposes a computer program product, when the instructions in the computer program product are executed by a processor, the data merging method as described in the foregoing embodiments is implemented.

In the description of this specification, description with reference to the terms "one embodiment," "some embodiments," "example," "specific example," or "some examples", etc., mean specific features described in connection with the embodiment or example , structure, material or feature is included in at least one embodiment or example of the present application. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, those skilled in the art may combine and combine the different embodiments or examples described in this specification, as well as the features of the different embodiments or examples, without conflicting each other.

In addition, the terms "first" and "second" are only used for descriptive purposes, and should not be construed as indicating or implying relative importance or implying the number of indicated technical features. Thus, a feature delimited with "first", "second" may expressly or implicitly include at least one of that feature. In the description of the present application, "plurality" means at least two, such as two, three, etc., unless expressly and specifically defined otherwise.

Any process or method description in the flowcharts or otherwise described herein may be understood to represent a module, segment or portion of code comprising one or more executable instructions for implementing custom logical functions or steps of the process , and the scope of the preferred embodiments of the present application includes alternative implementations in which the functions may be performed out of the order shown or discussed, including performing the functions substantially concurrently or in the reverse order depending upon the functions involved, which should It is understood by those skilled in the art to which the embodiments of the present application belong.

The logic and/or steps represented in flowcharts or otherwise described herein, for example, may be considered an ordered listing of executable instructions for implementing the logical functions, may be embodied in any computer-readable medium, For use with, or in conjunction with, an instruction execution system, apparatus, or device (such as a computer-based system, a system including a processor, or other system that can fetch instructions from and execute instructions from an instruction execution system, apparatus, or apparatus) or equipment. For the purposes of this specification, a "computer-readable medium" can be any device that can contain, store, communicate, propagate, or transport the program for use by or in connection with an instruction execution system, apparatus, or apparatus. More specific examples (non-exhaustive list) of computer readable media include the following: electrical connections with one or more wiring (electronic devices), portable computer disk cartridges (magnetic devices), random access memory (RAM), Read Only Memory (ROM), Erasable Editable Read Only Memory (EPROM or Flash Memory), Fiber Optic Devices, and Portable Compact Disc Read Only Memory (CDROM). In addition, the computer readable medium may even be paper or other suitable medium on which the program may be printed, as the paper or other medium may be optically scanned, for example, followed by editing, interpretation, or other suitable medium as necessary process to obtain the program electronically and then store it in computer memory.

It should be understood that various parts of this application may be implemented in hardware, software, firmware, or a combination thereof. In the above-described embodiments, various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware as in another embodiment, it can be implemented by any one of the following techniques known in the art, or a combination thereof: discrete with logic gates for implementing logic functions on data signals Logic circuits, application specific integrated circuits with suitable combinational logic gates, Programmable Gate Arrays (PGA), Field Programmable Gate Arrays (FPGA), etc.

Those skilled in the art can understand that all or part of the steps carried by the methods of the above embodiments can be completed by instructing the relevant hardware through a program, and the program can be stored in a computer-readable storage medium, and the program can be stored in a computer-readable storage medium. When executed, one or a combination of the steps of the method embodiment is included.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing module, or each unit may exist physically alone, or two or more units may be integrated into one module. The above-mentioned integrated modules can be implemented in the form of hardware, and can also be implemented in the form of software function modules. If the integrated modules are implemented in the form of software functional modules and sold or used as independent products, they may also be stored in a computer-readable storage medium.

The above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, and the like. Although the embodiments of the present application have been shown and described above, it should be understood that the above embodiments are exemplary and should not be construed as limitations to the present application. Embodiments are subject to variations, modifications, substitutions and variations.

Claims (12)

1. a data merging method, is characterized in that, comprises the following steps: Get the data table to be merged; Judging whether the initial data table and the data table to be merged meet the preset aggregation conditions; If it is determined that the initial data table and the data table to be merged meet the preset aggregation conditions, the initial data table and the data table to be merged are merged to generate a target data table. 2. The method of claim 1, wherein after the initial data table and the to-be-merged data table are combined to generate a target data table, the method further comprises: obtaining a preset deletion period corresponding to the data table to be merged; The data table to be merged is deleted after the preset deletion period of the target data table is generated. 3. The method of claim 1, wherein the judging whether the initial data table and the first data table to be merged satisfy a preset aggregation condition comprises: obtaining each initial dimension in the initial data table; Obtain each dimension to be merged in the data table to be merged; Whether the initial data table and the to-be-merged data table satisfy a preset aggregation condition is determined according to whether the initial dimensions and the to-be-merged dimensions are consistent. 4. The method of claim 1, further comprising: said acquiring the data table to be merged, comprising: Obtain the prefix index corresponding to the data table to be merged; determining a plurality of initial data entries according to the prefix index; The target data entry is selected from the plurality of initial data entries to generate the data table to be merged. 5. The method according to claim 1, wherein after merging the initial data table and the data table to be merged to generate a target data table, further comprising: Get query request; Analyze the query request to determine the request data table; The request data table is output and displayed. 6. A data merging device, characterized in that, comprising: The first acquisition module is used to acquire the data table to be merged; a judgment module for judging whether the initial data table and the to-be-merged data table satisfy a preset aggregation condition; The merging module is configured to merge the initial data table and the data table to be merged to generate a target data table if it is determined that the initial data table and the data table to be merged meet a preset aggregation condition. 7. The apparatus of claim 6, further comprising: a second obtaining module, configured to obtain the preset deletion period corresponding to the data table to be merged; A deletion module, configured to delete the data table to be merged after the preset deletion period of the target data table is generated. 8. The device according to claim 6, wherein the judgment module is specifically used for: obtaining each initial dimension in the initial data table; Obtain each dimension to be merged in the data table to be merged; Whether the initial data table and the to-be-merged data table satisfy a preset aggregation condition is determined according to whether the initial dimensions and the to-be-merged dimensions are consistent. 9. The apparatus according to claim 6, further comprising: the first acquisition module, which is specifically configured to: Obtain the prefix index corresponding to the data table to be merged; determining a plurality of initial data entries according to the prefix index; The target data entry is selected from the plurality of initial data entries to generate the data table to be merged. 10. The apparatus of claim 6, further comprising: The third obtaining module is used to obtain the query request; a parsing module for parsing the query request to determine the request data table; The output module is used for outputting and displaying the request data table. 11. A computer device, comprising a processor and a memory; Wherein, the processor runs a program corresponding to the executable program code by reading the executable program code stored in the memory, so as to realize the data according to any one of claims 1-5 Merge method. 12. A non-transitory computer-readable storage medium on which a computer program is stored, characterized in that, when the program is executed by a processor, the data merging method according to any one of claims 1-5 is implemented.

Images