WO2021114025A1 - Procédé et appareil de détermination de données incrémentielles, serveur et dispositif terminal - Google Patents

Procédé et appareil de détermination de données incrémentielles, serveur et dispositif terminal Download PDF

Info

Publication number
WO2021114025A1
WO2021114025A1 PCT/CN2019/124035 CN2019124035W WO2021114025A1 WO 2021114025 A1 WO2021114025 A1 WO 2021114025A1 CN 2019124035 W CN2019124035 W CN 2019124035W WO 2021114025 A1 WO2021114025 A1 WO 2021114025A1
Authority
WO
WIPO (PCT)
Prior art keywords
file
target
original
block
updated
Prior art date
Application number
PCT/CN2019/124035
Other languages
English (en)
Chinese (zh)
Inventor
赵杰
Original Assignee
深圳市欢太科技有限公司
Oppo广东移动通信有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 深圳市欢太科技有限公司, Oppo广东移动通信有限公司 filed Critical 深圳市欢太科技有限公司
Priority to PCT/CN2019/124035 priority Critical patent/WO2021114025A1/fr
Priority to CN201980099820.1A priority patent/CN114503076A/zh
Publication of WO2021114025A1 publication Critical patent/WO2021114025A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/40—Support for services or applications

Definitions

  • This application belongs to the technical field of file updating, and in particular relates to an incremental data determination method, determination device, terminal equipment, and computer-readable storage medium.
  • an incremental update method is often used, that is, the terminal equipment only updates the places that need to be changed, and does not need to be updated or the places that have been updated. Will not be updated repeatedly.
  • the traditional incremental update algorithm is: using the server/client (Client/Server, C/S) architecture, the difference between the updated target file and the original file to be updated is compared on the server side to obtain the incremental data, and then the increase The amount of data is returned to the terminal device to update the file in the terminal device.
  • One of the objectives of the embodiments of this application is to provide a method, a determining device, terminal equipment, and a computer-readable storage medium for determining incremental data, aiming to solve to a certain extent that traditional incremental update algorithms cannot efficiently update files.
  • a method for determining incremental data is provided, which is applied to a server, and the method includes:
  • the above N target blocks are allocated to different calculation modules to instruct each calculation module to execute: calculate the incremental data of the target block and the original block, where the original block is The above-mentioned original documents or parts of the above-mentioned original documents;
  • a device for determining incremental data applied to a server, and the device includes:
  • the file obtaining module is used to obtain the original file to be updated in the terminal device, and obtain the updated target file corresponding to the original file;
  • the block module is used to block the above-mentioned updated target file to obtain N target blocks, where N is an integer greater than 1;
  • the allocation module is used to allocate the above N target blocks to different calculation modules according to the load balancing algorithm to instruct each calculation module to execute: calculate the incremental data of the obtained target block and the original block, where,
  • the original block is the above-mentioned original file or a part of the above-mentioned original file;
  • the incremental return module is used to obtain each incremental data returned by each calculation module and return each incremental data to the terminal device to instruct the terminal device to update the original file according to each incremental data.
  • a server including a memory, a processor, and a computer program stored in the memory and running on the processor.
  • the processor executes the computer program, the steps of the method in the first aspect are implemented. .
  • a computer-readable storage medium stores a computer program, and when the above-mentioned computer program is executed by a processor, the steps of the method in the above-mentioned first aspect are realized.
  • a computer program product in a fifth aspect, includes a computer program, and when the above-mentioned computer program is executed by one or more processors, the steps of the method in the above-mentioned first aspect are implemented.
  • this application provides a method for determining incremental data applied to the server side.
  • obtain the original file to be updated for example, the original file may be an old version of the application installation package stored in the terminal device
  • obtain the updated target file corresponding to the original file for example, the updated target file may be a new version of the application installation package saved on the server side
  • block the updated target file to obtain multiple
  • the above multiple target blocks are allocated to different calculation modules to instruct each calculation module to execute: calculate the incremental data of the obtained target block and the original block,
  • the original block is the aforementioned original file or a partial file of the aforementioned original file (that is: the aforementioned target blocks are evenly allocated to different calculation modules.
  • the first and third target blocks can be allocated to the calculation module 1, and the second target block is allocated to the calculation module 2, so that the calculation module 1 and the calculation module 2 respectively perform the calculation operation of the incremental data) ;
  • each incremental data returned by each calculation module is obtained, and each incremental data is returned to the terminal device to instruct the terminal device to update the original file according to each incremental data.
  • the incremental data can be accelerated to a certain extent.
  • the acquisition speed can improve the file update efficiency of the terminal device to a certain extent.
  • FIG. 1 is a schematic flowchart of a method for determining incremental data provided in Embodiment 1 of the present application;
  • FIG. 2 is a schematic diagram of segmenting the updated target file according to the first embodiment of the present application.
  • FIG. 3 is a schematic diagram of a calculation module shown in Embodiment 1 of the present application.
  • FIG. 4 is a schematic flowchart of another method for determining incremental data provided in Embodiment 2 of the present application.
  • FIG. 5 is a schematic diagram of the target block, the original block and the calculation unit in the second embodiment of the present application.
  • FIG. 6 is a schematic flowchart of yet another method for determining incremental data provided by Embodiment 3 of the present application.
  • FIG. 7 is a schematic structural diagram of a device for determining incremental data provided by Embodiment 4 of the present application.
  • FIG. 8 is a schematic structural diagram of a server provided in Embodiment 5 of the present application.
  • the term “if” can be interpreted as “when” or “once” or “in response to determination” or “in response to detection” depending on the context .
  • the phrase “if determined” or “if detected [described condition or event]” can be interpreted as meaning “once determined” or “in response to determination” or “once detected [described condition or event]” depending on the context ]” or “in response to detection of [condition or event described]”.
  • the following describes a method for determining incremental data provided in the first embodiment of the present application.
  • the method for determining incremental data is applied to the server side. Please refer to FIG. 1.
  • the method for determining includes:
  • step S101 the original file to be updated in the terminal device is obtained, and the updated target file corresponding to the original file is obtained;
  • the server may execute this step S101 after receiving the update file request sent by the terminal device.
  • the terminal device needs to update file X to file X1
  • it can send a file update request to the server
  • the server receives the file update request, it obtains file X and file X1.
  • the above-mentioned updated target file is often already stored in the server. Therefore, the updated target file can be directly read from the memory.
  • this application does not limit the method of obtaining the updated target file.
  • obtaining the original file to be updated in the terminal device may specifically be: obtaining the version identifier of the original file to be updated in the terminal device, and based on the version identifier, obtaining the terminal device to be updated.
  • Original file the server can quickly obtain the original file to be updated (because the server usually saves files with different version identifications, so after the identification is obtained, the original file to be updated can be directly obtained from the storage. Avoid transferring original files with a large amount of data).
  • the method of determining the original file to be updated by obtaining the version identifier may cause the original file obtained by the server to be different from the original file actually saved in the terminal device (for example, the user may modify the file to be updated), resulting in The update fails.
  • the original file to be updated can be determined in the following manner: accept the original file to be updated sent by the terminal device.
  • This method can ensure that the original file obtained by the server is completely consistent with the original file to be updated in the terminal device.
  • this requires a large amount of data transmission between the terminal device and the server, and therefore, the file update efficiency may be reduced.
  • the server can receive the version identification of the original file to be updated and the number of times the user has modified the original file; if the user does not modify it, it directly obtains the file to be updated from the memory Original file; if there is a modification, communicate with the terminal device to obtain the original file to be updated.
  • step S102 block the above-mentioned updated target file to obtain N target blocks, where N is an integer greater than 1;
  • each target block can be as shown in Figure 2(a) and 2(b), and there is no cross-repetitive data between the two; or, as shown in Figure 2(c), there is At least two target blocks have cross-repetitive data, and the application does not limit the method of dividing the target blocks.
  • this block method can improve the anti-interference performance between the terminal device and the server to a certain extent (for example, when the terminal device performs a file update operation, if the target block 1 is obtained according to the incremental data There is no segment of duplicate data between the target block 2 and the target block 2, which means that there is interference in the transmission of the incremental data. At this time, the server can be requested to resend the incremental data.
  • the block method described in step S102 can be as shown in Figure 2(a). Except for the last target block, the data amount of each target block is exactly the same (the data amount of the last target block).
  • the size depends on the size of the target file after the update. It may be the same as the size of each target block before, or it may be smaller than the size of each target block before); it can also be shown in Figure 2(b) without dividing each target block. The size is limited.
  • the updated target file can be randomly divided to obtain N target blocks.
  • Embodiment 2 and Embodiment 3 will give specific division methods. For details, please refer to the description of Embodiment 2 and Embodiment 3 in detail.
  • step S103 according to the load balancing algorithm, the above-mentioned N target blocks are respectively allocated to different calculation modules to instruct each calculation module to execute: calculate the obtained target block and the original block incremental data, where,
  • the original block is the above-mentioned original file or a part of the above-mentioned original file;
  • the "computing module" described in this step S103 may be a computing terminal set up separately from the server (terminal devices 302 and 303 as shown in FIG. 3), or it may be a thread or process in the server, which is not covered by this application. Make a limit.
  • step S102 the server needs to allocate corresponding target blocks to multiple calculation modules according to the current calculation burden of each calculation module, so as to ensure that the calculation load of each calculation module is balanced, so as to obtain incremental data faster. For example, if step S102 divides 3 target blocks, there are a total of 2 calculation modules, and before the target block is allocated, both calculation modules are idle. At this time, one target block can be allocated to one of the calculation modules. , To assign two target blocks to another computing module.
  • the original block used by the calculation module when calculating incremental data may be the same as or different from the original block used by other calculation modules. This application does not limit this.
  • the original block used by each calculation module is the original file itself, the amount of incremental data obtained by each calculation module is the least (because the current incremental data
  • the calculation method of is usually: get the ID of the same part of the target block and the original file and the added part.
  • the ID of the same part will occupy a larger percentage, and this part can only record the ID Therefore, the amount of incremental data obtained is less), and accordingly, the time to return each incremental data to the terminal device will be shorter, which is convenient for faster file update.
  • step S104 obtain the incremental data returned by each calculation module, and return each incremental data to the above-mentioned terminal device to instruct the terminal device to update the above-mentioned original file according to each incremental data;
  • the server may summarize various incremental data to obtain a total incremental data, and then return the total incremental data to the above-mentioned terminal device; or, it may also use the calculation based on each calculation module Speed.
  • the advantage of returning each of the above incremental data to the terminal device in turn and returning to the terminal device in turn is that the amount of data processed by the terminal device at a single point in time is not large, which is beneficial to reducing the computing burden of the terminal device.
  • the following describes another method for determining incremental data provided in the second embodiment of the present application.
  • the method for determining incremental data is also applied to the server side.
  • the computing module is specifically a computing terminal set up separately from the server.
  • the method for determining incremental data includes:
  • step S201 the original file to be updated in the terminal device is obtained, and the updated target file corresponding to the original file is obtained;
  • step S201 is completely the same as that of step S101 in the first implementation.
  • step S101 in the first implementation.
  • step S202 based on the file type of each file contained in the updated target file, the updated target file is divided into N target blocks, where each file contained in each target block has the same file type, and N Is an integer greater than 1;
  • a method of dividing the target block is given, and correspondingly, in the subsequent step S203, for each target block, each of the original files of the same file type will be The file is determined to be the original block corresponding to the target block.
  • the file type of the target block is the same as that of the corresponding original file.
  • the incremental data can be calculated quickly.
  • the original block corresponding to each target block may be the original file to be updated obtained in step S201. Although they are all original files, it can still be ensured that each incremental data is small. However, this may cause the need to transmit larger data between the terminal device and the computing terminal, and the transmission will take a long time.
  • step S202 uses FIG. 5 to describe each step included in the second embodiment of the present application.
  • step S202 is described below:
  • the updated target file is divided into 4 target partitions, where target partition 1 is a jpg type file, the target partition is a 2-bit dll type file, and the target partition 3 is a dat type file.
  • the target block 4 is a txt file.
  • the file types of the two target blocks are allowed to be the same, for example, when the file ratio of a certain type in the target file after the update is greater than a certain preset ratio (for example, 80%), this type of file can be divided into multiple target partitions, that is, there may be cases where the file types of target partition 1 and target partition 2 are the same.
  • step S203 for each target segment, based on the file type of the file contained in the target segment, extract each file corresponding to the file type in the original file, and determine each file as corresponding to the target segment The original block;
  • the original file can be divided into blocks based on this step S203. For details, please refer to Figure 5.
  • each file in the original file whose file type is jpg is determined to be the original block 1 corresponding to the target block 1
  • each file in the original file whose file type is dll is determined to correspond to the target block 2.
  • the original block 2 of the original file is determined as the original block 3 corresponding to the target block 3 for each file of the file type dat
  • each file with the file type of txt in the original file is determined to be the original block corresponding to the target block 4.
  • the updated target file contains 3 target blocks, the types are type X, type Y, and type Z.
  • the original file only contains files of type X and type Y.
  • each file in the original file of type X can be determined as the original block corresponding to the target block of type X, and the type is
  • Each file in the original file of Y is determined as the original block corresponding to the target block of type Y, and the original file itself is determined as the original block corresponding to the target block of type Z.
  • the step S203 may specifically be: for each target block, if the original file contains each file of the same file type as the target block, then each file may be determined to be the same as the target block.
  • step S204 the method for determining incremental data should further include the following steps:
  • the original file For each target block, if the original file does not contain files of the same file type as the target block, the original file itself can be determined as the original block corresponding to the target block.
  • step S204 for each target block, the target block and the original block corresponding to the target block are determined as the calculation unit corresponding to the target block;
  • step S202 and step S203 As shown in FIG. 5, according to the results of step S202 and step S203, 4 calculation units are obtained.
  • step S205 according to the load balancing algorithm, the above-mentioned N computing units are respectively allocated to different computing terminals to instruct each computing terminal to execute: the target block in the computing unit acquired by calculation and the original score in the acquired computing unit Incremental data of the block;
  • the data running burden of each computing terminal can be obtained first. If the data running burden difference between the two computing terminals is less than the preset difference, the following method 1 or method can be used 2 to allocate each target block (wherein, the above-mentioned data running burden is a parameter representing the operating status of the computing terminal data or program, and the data running burden can be determined by parameters such as CPU occupancy, memory occupancy and/or system load average) :
  • each computing unit is allocated to different computing terminals, wherein the identification sequence number takes a value of 1, 2...N.
  • the identification sequence number takes a value of 1, 2...N.
  • computing unit 1 and computing unit 2 can be allocated to computing terminal 1
  • computing unit 3 and computing unit 4 can be allocated to computing terminal 2.
  • Manner 2 Determine the check value of each calculation unit, and allocate each calculation unit to different calculation terminals based on the check value of each calculation unit. For example, as shown in Figure 5, assuming there are two computing terminals, the message-digest algorithm 5 (MD5) check value of each computing unit can be calculated, which is determined according to the last digit of the check value The computing unit is allocated to which computing terminal. For example, if the last bit is 0, it is allocated to computing terminal 1, and if the last bit is 1, it is allocated to computing terminal 2.
  • MD5 message-digest algorithm 5
  • step S206 obtain the incremental data returned by each computing terminal, and return each incremental data to the above-mentioned terminal device to instruct the terminal device to update the above-mentioned original file according to each incremental data;
  • step S206 is the same as that of step S104 in the first embodiment.
  • step S104 in the first embodiment.
  • the second embodiment of the present application clarifies that the computing module is a separate computing terminal from the server, and therefore, the requirements for the hardware and software of the server and the maintenance cost are reduced.
  • the second embodiment of the present application also clarifies the determination method of the target block and the original block. This method can ensure that the calculation burden of the computing terminal is small, and the calculated incremental data is also small, which can further accelerate the file update. speed.
  • the determining method includes:
  • step S301 the original file to be updated in the terminal device is obtained, and the updated target file corresponding to the original file is obtained;
  • step S301 is completely the same as that of step S101 in the first embodiment, and the description of the first embodiment can be added to the description, and the details are not repeated here.
  • step S302 based on the storage order of the data in the updated target file, the updated target file is divided into N target blocks, where each target block contains files in continuous storage order, and N is greater than An integer of 1;
  • the target block segmentation method described in step S302 is a relatively simple segmentation method, which is convenient for programmers to develop.
  • step S303 for each target block, the target block and the original file are determined as the calculation unit corresponding to the target block;
  • the third embodiment of this application is different from the foregoing second embodiment.
  • the foregoing second embodiment is divided according to file types. Therefore, each original block may be each file of the corresponding file type.
  • the original file since it is simply divided according to the storage order, in order to ensure that the amount of incremental data is small, the original file itself needs to be determined as the original block corresponding to each target block ( The specific reason is described in step S103 in the first embodiment. For details, please refer to the description of the first embodiment, which will not be repeated here).
  • step S304 according to the load balancing algorithm, the above-mentioned N computing units are respectively allocated to different computing terminals to instruct each computing terminal to execute: calculate the target block in the obtained computing unit and the original score in the obtained computing unit. Incremental data of the block;
  • step S305 the incremental data returned by each computing terminal is obtained, and each incremental data is returned to the above-mentioned terminal device to instruct the terminal device to update the above-mentioned original file according to each incremental data.
  • steps S304-S305 is completely the same as steps S205-S206 in the second embodiment, and the details can be referred to the description of the second embodiment, which will not be repeated here.
  • the method for determining incremental data provided in the third embodiment of the present application is much simpler than that in the second embodiment, and therefore, it is more convenient for programmers to develop.
  • the fourth embodiment of the present application provides a device for determining incremental data, which is applied to a server.
  • the incremental data determining device 400 includes:
  • the file obtaining module 401 is configured to obtain the original file to be updated in the terminal device, and obtain the updated target file corresponding to the original file;
  • the block module 402 is configured to block the above-mentioned updated target file to obtain N target blocks, where N is an integer greater than 1;
  • the allocation module 403 is configured to allocate the aforementioned N target blocks to different calculation modules according to the load balancing algorithm, so as to instruct each calculation module to execute: calculate the obtained incremental data of the target block and the original block, where ,
  • the original block is the above-mentioned original file or a part of the above-mentioned original file;
  • the incremental return module 404 is configured to obtain each incremental data returned by each calculation module, and return each incremental data to the above-mentioned terminal device, so as to instruct the above-mentioned terminal device to update the above-mentioned original file according to each incremental data.
  • the foregoing computing module is a computing terminal communicatively connected with the foregoing server;
  • the aforementioned allocation module 403 includes:
  • the calculation unit determining unit is configured to determine, for each target block, a calculation unit corresponding to the target block, wherein the calculation unit includes the target block and the original block, wherein the original block is the The original document itself or part of the original document;
  • the calculation unit allocation unit is configured to allocate the N calculation units to different calculation terminals according to the load balancing algorithm, so as to instruct each calculation terminal to execute: the target block in the calculated calculation unit and the obtained calculation unit Incremental data of the original block in.
  • the aforementioned blocking module 402 is specifically configured to:
  • calculation unit determining unit is specifically used for:
  • the original file itself is determined as the original block corresponding to the target block, and the target block and the original file are determined as the computing unit corresponding to the target block.
  • the aforementioned blocking module 402 is specifically configured to:
  • the foregoing calculation unit determining unit includes:
  • the original file determining subunit is used for each target block, based on the file type of the file contained in the target block, extract each file corresponding to the file type in the original file, and determine each file as the target file type.
  • the calculation unit determines a sub-unit for determining, for each target block, the target block and the original block corresponding to the target block as the calculation unit corresponding to the target block.
  • the above-mentioned computing unit allocating unit is specifically configured to:
  • each computing unit is allocated to different computing terminals, wherein the identification sequence number takes the value: 1, 2...N;
  • the data operation burden is a parameter representing the data or program operation status of the computing terminal.
  • the above-mentioned computing unit allocating unit is specifically configured to:
  • the data operation burden is a parameter representing the data or program operation status of the computing terminal.
  • the aforementioned blocking module 402 is specifically configured to:
  • the updated target file is divided into blocks to obtain N target blocks, wherein at least two target blocks have cross-repetitive data.
  • files with various version identifications are stored in the foregoing server;
  • the aforementioned file obtaining module 401 specifically obtains the original file to be updated in the terminal device in the following manner:
  • the aforementioned increment return module 404 is specifically configured to:
  • the various incremental data are sequentially returned to the terminal device.
  • FIG. 8 is a schematic diagram of a server provided in Embodiment 5 of the present application.
  • the server 500 of this embodiment includes a processor 501, a memory 502, and a computer program 503 that is stored in the memory 502 and can run on the processor 501.
  • the above-mentioned processor 501 implements the steps in the above-mentioned method embodiments when the above-mentioned computer program 503 is executed.
  • the processor 501 executes the computer program 503, the functions of the modules/units in the foregoing device embodiments are implemented.
  • the foregoing computer program 503 may be divided into one or more modules/units, and the foregoing one or more modules/units are stored in the foregoing memory 502 and executed by the foregoing processor 501 to complete the application.
  • the foregoing one or more modules/units may be a series of computer program instruction segments capable of completing specific functions, and the instruction segments are used to describe the execution process of the foregoing computer program 503 in the foregoing server 500.
  • the above-mentioned computer program 503 can be divided into a file acquisition module, a block module, an allocation module, and an incremental return module.
  • the specific functions of each module are as follows:
  • the above N target blocks are allocated to different calculation modules to instruct each calculation module to execute: calculate the incremental data of the target block and the original block, where the original block is The above-mentioned original documents or parts of the above-mentioned original documents;
  • the foregoing server may include, but is not limited to, a processor 501 and a memory 502.
  • FIG. 8 is only an example of the server 500 and does not constitute a limitation on the server 500. It may include more or less components than shown, or a combination of certain components, or different components, such as
  • the aforementioned server may also include input and output devices, network access devices, buses, and so on.
  • the so-called processor 501 may be a central processing unit (Central Processing Unit, CPU), other general processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), Field-Programmable Gate Array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc.
  • the general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like.
  • the storage 502 may be an internal storage unit of the server 500, such as a hard disk or a memory of the server 500.
  • the memory 502 may also be an external storage device of the server 500, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, or a flash memory card equipped on the server 500. Flash Card) etc.
  • the aforementioned memory 502 may also include both an internal storage unit of the aforementioned server 500 and an external storage device.
  • the above-mentioned memory 502 is used to store the above-mentioned computer program and other programs and data required by the above-mentioned server.
  • the aforementioned memory 502 can also be used to temporarily store data that has been output or will be output.
  • the units described above as separate components may or may not be physically separated, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments.
  • the functional units in the various embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.
  • the above-mentioned integrated unit can be implemented in the form of hardware or software functional unit.
  • the above integrated modules/units are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer readable storage medium. Based on this understanding, this application implements all or part of the processes in the foregoing method embodiments, and can also be completed by instructing relevant hardware through a computer program.
  • the foregoing computer program may be stored in a computer-readable storage medium. When the program is executed by the processor, it can implement the steps of the foregoing method embodiments.
  • the above-mentioned computer program includes computer program code, and the above-mentioned computer program code may be in the form of source code, object code, executable file, or some intermediate forms.
  • the above-mentioned computer-readable medium may include: any entity or device capable of carrying the above-mentioned computer program code, recording medium, U disk, mobile hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), random Access memory (RAM, Random Access Memory), electrical carrier signal, telecommunications signal, and software distribution media, etc.
  • ROM Read-Only Memory
  • RAM Random Access Memory
  • electrical carrier signal telecommunications signal
  • telecommunications signal and software distribution media, etc.
  • the content contained in the above-mentioned computer-readable media can be appropriately added or deleted in accordance with the requirements of the legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to the legislation and patent practice, the computer-readable media cannot Including electric carrier signal and telecommunication signal.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention concerne un procédé et un appareil de détermination de données incrémentielles, ainsi qu'un serveur et un support de stockage lisible. Le procédé comprend les étapes consistant à : acquérir un fichier d'origine devant être mis à jour dans un dispositif terminal et acquérir un fichier cible mis à jour correspondant au fichier d'origine (S101) ; diviser le fichier cible mis à jour en blocs de façon à obtenir N blocs cibles, N étant un entier supérieur à un (S102) ; en fonction d'un algorithme d'équilibrage de charge, attribuer respectivement les N blocs cibles à différents modules de calcul de façon à ordonner à chaque module de calcul de calculer les données incrémentielles des blocs cibles acquis par rapport à un bloc d'origine, le bloc d'origine étant le fichier d'origine ou une partie du fichier d'origine (S103) ; puis acquérir les données incrémentielles respectivement renvoyées par chaque module de calcul et renvoyer chaque donnée incrémentielle au dispositif terminal de façon à ordonner au dispositif terminal de mettre à jour le fichier d'origine en fonction de chaque donnée incrémentielle (S104). Le procédé peut, dans une certaine mesure, accroître l'efficacité d'un dispositif terminal lors de la mise à jour d'un fichier.
PCT/CN2019/124035 2019-12-09 2019-12-09 Procédé et appareil de détermination de données incrémentielles, serveur et dispositif terminal WO2021114025A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2019/124035 WO2021114025A1 (fr) 2019-12-09 2019-12-09 Procédé et appareil de détermination de données incrémentielles, serveur et dispositif terminal
CN201980099820.1A CN114503076A (zh) 2019-12-09 2019-12-09 增量数据确定方法、确定装置、服务器及终端设备

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2019/124035 WO2021114025A1 (fr) 2019-12-09 2019-12-09 Procédé et appareil de détermination de données incrémentielles, serveur et dispositif terminal

Publications (1)

Publication Number Publication Date
WO2021114025A1 true WO2021114025A1 (fr) 2021-06-17

Family

ID=76329285

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/124035 WO2021114025A1 (fr) 2019-12-09 2019-12-09 Procédé et appareil de détermination de données incrémentielles, serveur et dispositif terminal

Country Status (2)

Country Link
CN (1) CN114503076A (fr)
WO (1) WO2021114025A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113641388A (zh) * 2021-08-24 2021-11-12 北京百度网讯科技有限公司 云手机更新方法、相关装置及计算机程序产品
CN114116031A (zh) * 2021-11-22 2022-03-01 曙光信息产业股份有限公司 选项参数同步方法、装置、计算机设备和存储介质
CN114928580A (zh) * 2022-04-12 2022-08-19 深圳市优必选科技股份有限公司 数据增量发送方法、接收方法、终端设备及存储介质
CN116894014A (zh) * 2023-09-08 2023-10-17 荣耀终端有限公司 缓存更新方法、服务器、终端设备及芯片系统

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117170690B (zh) * 2023-11-02 2024-03-22 湖南三湘银行股份有限公司 一种分布式构件管理系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102123279A (zh) * 2010-12-28 2011-07-13 乐视网信息技术（北京）股份有限公司 一种分布式实时转码方法与系统
US20150112941A1 (en) * 2013-10-18 2015-04-23 Power-All Networks Limited Backup management system and method thereof
CN105162855A (zh) * 2015-08-18 2015-12-16 浪潮(北京)电子信息产业有限公司 增量数据同步方法和装置
CN107506260A (zh) * 2017-07-27 2017-12-22 南京南瑞集团公司 一种动态分块数据库增量备份方法
CN107835206A (zh) * 2017-09-19 2018-03-23 平安普惠企业管理有限公司 数据更新方法、服务器以及计算机可读存储介质

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105491069B (zh) * 2016-01-14 2018-08-21 西安电子科技大学 云存储中基于抵抗主动攻击的完整性验证方法
CN106250195A (zh) * 2016-08-10 2016-12-21 青岛海信电器股份有限公司 更新系统文件的方法、设备及系统
CN108664331B (zh) * 2018-05-22 2020-08-11 腾讯大地通途（北京）科技有限公司 分布式数据处理方法及装置、电子设备、存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102123279A (zh) * 2010-12-28 2011-07-13 乐视网信息技术（北京）股份有限公司 一种分布式实时转码方法与系统
US20150112941A1 (en) * 2013-10-18 2015-04-23 Power-All Networks Limited Backup management system and method thereof
CN105162855A (zh) * 2015-08-18 2015-12-16 浪潮(北京)电子信息产业有限公司 增量数据同步方法和装置
CN107506260A (zh) * 2017-07-27 2017-12-22 南京南瑞集团公司 一种动态分块数据库增量备份方法
CN107835206A (zh) * 2017-09-19 2018-03-23 平安普惠企业管理有限公司 数据更新方法、服务器以及计算机可读存储介质

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113641388A (zh) * 2021-08-24 2021-11-12 北京百度网讯科技有限公司 云手机更新方法、相关装置及计算机程序产品
CN114116031A (zh) * 2021-11-22 2022-03-01 曙光信息产业股份有限公司 选项参数同步方法、装置、计算机设备和存储介质
CN114928580A (zh) * 2022-04-12 2022-08-19 深圳市优必选科技股份有限公司 数据增量发送方法、接收方法、终端设备及存储介质
CN114928580B (zh) * 2022-04-12 2023-06-02 深圳市优必选科技股份有限公司 数据增量发送方法、接收方法、终端设备及存储介质
CN116894014A (zh) * 2023-09-08 2023-10-17 荣耀终端有限公司 缓存更新方法、服务器、终端设备及芯片系统
CN116894014B (zh) * 2023-09-08 2024-02-27 荣耀终端有限公司 缓存更新方法、服务器、终端设备及芯片系统

Also Published As

Publication number Publication date
CN114503076A (zh) 2022-05-13

Similar Documents

Publication Publication Date Title
WO2021114025A1 (fr) Procédé et appareil de détermination de données incrémentielles, serveur et dispositif terminal
WO2020156259A1 (fr) Procédé et dispositif de gestion de mémoire, terminal mobile et support de stockage
CN109918018B (zh) 一种数据存储方法及存储设备
CN103970520A (zh) MapReduce架构中的资源管理方法、装置和架构系统
CN110119304B (zh) 一种中断处理方法、装置及服务器
CN109508326B (zh) 用于处理数据的方法、装置和系统
CN112269665B (zh) 内存的处理方法和装置、电子设备和存储介质
CN111343267B (zh) 一种配置的管理方法及系统
CN108563698B (zh) 一种HBase表的Region合并方法和装置
CN111796937A (zh) 基于内存的资源分配方法、计算机设备及存储介质
CN111651424B (zh) 一种数据处理方法、装置、数据节点及存储介质
CN109947667B (zh) 数据访问预测方法和装置
CN115129621B (zh) 一种内存管理方法、设备、介质及内存管理模块
CN114756527A (zh) Redis集群的扩容方法、装置、电子设备和存储介质
CN115033551A (zh) 一种数据库迁移方法、装置、电子设备及存储介质
WO2021097624A1 (fr) Procédé de traitement de fichier, appareil de traitement de fichier, et dispositif terminal
CN112631994A (zh) 数据迁移方法及系统
CN109614242B (zh) 一种计算能力共享方法、装置、设备及介质
CN118250206A (zh) 基于流量回放的高并发压测试方法及相关装置
CN109067649B (zh) 节点处理方法及装置、存储介质和电子设备
CN115151902A (zh) 集群扩容方法、装置、存储介质及电子设备
CN112948106B (zh) 任务分配方法及装置
CN113986134B (zh) 存储数据的方法、读取数据的方法和装置
CN112560721B (zh) 无感知模型切换方法、装置、电子设备及存储介质
CN111679909B (zh) 数据处理方法、装置及终端设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19955556

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 17/11/2022)

122 Ep: pct application non-entry in european phase

Ref document number: 19955556

Country of ref document: EP

Kind code of ref document: A1