CN110515964A - A kind of file updating method, device, electronic equipment and medium - Google Patents
A kind of file updating method, device, electronic equipment and medium Download PDFInfo
- Publication number
- CN110515964A CN110515964A CN201910818948.0A CN201910818948A CN110515964A CN 110515964 A CN110515964 A CN 110515964A CN 201910818948 A CN201910818948 A CN 201910818948A CN 110515964 A CN110515964 A CN 110515964A
- Authority
- CN
- China
- Prior art keywords
- record
- new
- file
- original
- former
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2379—Updates performed during online database operations; commit processing
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the present application discloses a kind of file updating method, device, electronic equipment and medium, is related to database technical field.Specific implementation are as follows: respectively in disk original and new file carry out cutting and obtain sub- original and the new file of son；Record in the sub- original is ranked up, and ranking results are stored in former sort file；Record in the new file of the son is ranked up, and ranking results are stored in new sort file；Compare the record in the record and the new sort file in the former sort file, obtains record to be synchronized, and the original is updated according to the record to be synchronized.By the technical solution of the application, the delta data in two big file can be rapidly found out, and then realizes the update of database according to the big file in delta data more new database, reduces update data of database amount, improves the renewal rate of database.
Description
Technical field
The invention relates to field of computer technology more particularly to database technical fields, and in particular to Yi Zhongwen
Part update method, device, electronic equipment and medium.
Background technique
In daily Data processing, it is often necessary to according to the data that its other party provides, pass through the file in more new database
To realize full dose more new database.Currently, can be write by the legacy data in the library that clears data every time, and by new data full dose
Enter the mode of database, Lai Shixian full dose more new database；Alternatively, add Last status to all data in each update,
Indicate to be updated；Later, more new data (there is update, there is no be then inserted into) one by one, and the data mode updated is changed
To have updated, when data update finishes, it is stateful for data to be updated to delete institute, Lai Shixian full dose more new database.
However, quantity is very huge for the big file far more than memory, but change may not be it is very big,
If will cause resource significant wastage, and a large amount of invalid operations by the way of above-mentioned full dose more new database, also increasing
The risk of database error.In turn, in order to effectively realize that database updates on demand, directly new and old text can be passed through at present
Part obtains the mode of delta data, carrys out more new database, but since memory can not be written in big file, and then this mode is not
Update suitable for the big file far more than memory.Therefore, it is necessary to use a kind of to can be convenient that find out two big file different
Mode realizes the update of database come the file in more new database.
Summary of the invention
The embodiment of the present application discloses a kind of file updating method, device, electronic equipment and medium, can rapidly find out two
Delta data in big file, and then realize according to the big file in delta data more new database the update of database, subtract
Lack update data of database amount, improves the renewal rate of database.
In a first aspect, the embodiment of the present application discloses a kind of file updating method, this method comprises:
Respectively in disk original and new file carry out cutting and obtain sub- original and the new file of son；
Record in the sub- original is ranked up, and ranking results are stored in former sort file；
Record in the new file of the son is ranked up, and ranking results are stored in new sort file；
Compare the record in the record and the new sort file in the former sort file, obtains record to be synchronized, and
The original is updated according to the record to be synchronized；
Wherein, the original and the size of the new file are greater than memory size；The sub- original and the son are new
The size of file is less than content capacity.
One embodiment in above-mentioned application has the following advantages that or the utility model has the advantages that by big to what is stored in disk respectively
Cutting is carried out in the original of memory size and new file to obtain less than the sub- original of memory size and the new file of son；Later may be used
In memory, the record in sub- original is ranked up and ranking results is stored in former sort file and antithetical phrase is new
Record in file is ranked up, and ranking results are stored in new sort file；And pass through more former sequence in memory
The variation in two files of former sort file and new sort file can be obtained in the record in record and new sort file in file
Data, that is, record to be synchronized, and then original is updated to realize the update of database according to record to be synchronized, solve current nothing
Method compares two sizes more than the file of memory size the problem of obtaining delta data, to realize database more in memory
Newly, while reducing update data of database amount, improve the renewal rate of database.
Optionally, the record in the sub- original is ranked up, and ranking results is stored in former sort file,
Include:
It is ranked up to obtain intermediate sub- original to the record in each sub- original respectively, and by the sub- original text in the centre
Disk is written in part；
Record in the sub- original in all centres is ranked up, and ranking results are stored in former sort file；
Record in the new file of the son is ranked up, and ranking results are stored in new sort file, comprising:
The record in the new file of each son is ranked up respectively to obtain intermediate sub new file, and will the intermediate new text of son
Disk is written in part；
Record in all intermediate new files of son is ranked up, and ranking results are stored in new sort file.
Optionally, the record in the sub- original in all centres is ranked up, and ranking results is stored in former sequence text
In part, comprising:
This former record that waits sorting is compared, and the former sequence of this target original record write-in is selected according to comparison result
File；
Read from the sub- original in centre belonging to this target original record new wait the former record that sorts, by this, other are waited for
The former record of sequence and new sequence original record are used as next time wait the former record that sorts；
Record in all intermediate new files of son is ranked up, and ranking results are stored in new sort file, is wrapped
It includes:
This new record to be sorted is compared, and selects this target new record that new sort is written according to comparison result
File；
New new record to be sorted is read from the new file of intermediate son belonging to this target new record, other are waited for by this
Sequence new record and new sequence new record are as new record to be sorted next time.
Above-mentioned optional way have the following advantages that or the utility model has the advantages that for size be greater than memory size original, pass through
The centre that each sub- original less than memory size that the original cutting obtains is ranked up respectively, and sequence is obtained
Disk is written in sub- original；The record in the sub- original in all centres is ranked up using endless form later, and then can be obtained
To the former sort file of the original, the new sort file of new file similarly can be obtained, the file of memory size is greater than for size
Middle record ordering provides a kind of new approaches.
Optionally, the record in the record and the new sort file in the former sort file, obtains to be synchronized
Record, comprising:
If the former record to be processed of this in the original sort file and this new record to be processed in the new sort file
Critical field value it is identical, then other words in this relatively described former record to be processed and this described new record to be processed
Whether section value is identical, and determines this record to be synchronized and this type to be synchronized according to comparison result, and from the original
Former record to be processed next time and new record to be processed next time are read in sort file and the new sort file respectively.
Optionally, the record in the record and the new sort file in the former sort file, obtains to be synchronized
Record, comprising:
If the former record to be processed of this in the original sort file and this new record to be processed in the new sort file
Critical field value it is different, then according to critical field of this former record to be processed and this new record to be processed
Value determines this record to be synchronized and this type to be synchronized；And it is literary from the former sort file or the new sort
Former record to be processed next time or new record to be processed next time are read in part.
Above-mentioned optional way has the following advantages that or the utility model has the advantages that former sort file and new file for original
New sort file, by using endless form, in memory by the former record to be processed read from former sort file and new row
The critical field value of the new record to be processed read in preface part is compared, and then former sequence can be determined according to comparison result
Delta data, that is, record to be synchronized in two files of file and new sort file is more than interior to compare two sizes in memory
It deposits the file of capacity and provides a kind of new approaches to obtain delta data.
In addition, other effects possessed by above-mentioned optional way are illustrated hereinafter in conjunction with specific embodiment.
Second aspect, the embodiment of the present application also disclose a kind of file updating device, which includes:
Cutting module, for respectively in disk original and new file carry out cutting and obtain sub- original and the new text of son
Part；
Sort writing module, for being ranked up to the record in the sub- original, and ranking results is stored in original
In sort file；
Sort writing module, is also used to be ranked up the record in the new file of the son, and ranking results are stored in
In new sort file；
Comparison module is recorded, for the record in the record and the new sort file in the former sort file,
Record to be synchronized is obtained, and the original is updated according to the record to be synchronized；
Wherein, the original and the size of the new file are greater than memory size；The sub- original and the son are new
The size of file is less than content capacity.
The third aspect, the embodiment of the present application also disclose a kind of electronic equipment, comprising:
At least one processor；And
The memory being connect at least one described processor communication；Wherein,
The memory is stored with the instruction that can be executed by least one described processor, and described instruction is by described at least one
A processor executes, so that at least one described processor is able to carry out the file update side as described in the application any embodiment
Method.
Fourth aspect, the embodiment of the present application, which also discloses, a kind of to be stored with the non-instantaneous of computer instruction and computer-readable deposits
Storage media, the file update side that the computer instruction is used to that the computer to be made to execute as described in the application any embodiment
Method.
Detailed description of the invention
Attached drawing does not constitute the restriction to the application for more fully understanding this programme.Wherein:
Fig. 1 is according to a kind of flow chart of file updating method provided by the embodiments of the present application；
Fig. 2 is the flow chart according to another file updating method provided by the embodiments of the present application；
Fig. 3 is the schematic diagram according to a kind of determining former sort file process provided in the embodiment of the present application；
Fig. 4 is the flow chart according to another file updating method provided by the embodiments of the present application；
Fig. 5 is according to a kind of structural schematic diagram of file updating device provided by the embodiments of the present application；
Fig. 6 is the block diagram for the electronic equipment for realizing the file updating method of the embodiment of the present application.
Specific embodiment
It explains below in conjunction with exemplary embodiment of the attached drawing to the application, including the various of the embodiment of the present application
Details should think them only exemplary to help understanding.Therefore, those of ordinary skill in the art should recognize
It arrives, it can be with various changes and modifications are made to the embodiments described herein, without departing from the scope and spirit of the present application.Together
Sample, for clarity and conciseness, descriptions of well-known functions and structures are omitted from the following description.
Fig. 1 is according to a kind of flow chart of file updating method provided by the embodiments of the present application, and the present embodiment is applicable to
How more the file in new data is to realize the more news of database, be particularly suitable for how finding out two sizes be greater than it is interior
The delta data between the file of capacity is deposited, and then file is updated to realize the update of database according to delta data.This method
It can be executed by file updating device, which can be realized by the way of software and/or hardware, and can be integrated in any
The equipment with computing capability on, such as server etc..
As shown in Figure 1, file updating method provided in this embodiment may include:
S110, respectively in disk original and new file carry out cutting and obtain sub- original and the new file of son.
In the present embodiment, original refers to the file in database；New file, can be from its other party for updating original
It obtains.Further, original and the size of new file are greater than memory size, can be stored in disk.
Optionally, the cutting of the original and new file that store in disk is carried out in memory.For example, in memory,
Can according to free memory capacity and the size of original, calculate original can cutting be several sub- originals；And according to original text
The size of a record in part determines record quantity and starting point record position and tail point record that each sub- original may include
Position etc., and then realize that carrying out cutting to original obtains sub- original.Wherein the size of each sub- original can be equal, can also
Differ.Such as, the size of original is 10G, and free memory capacity is 1G, and then determines that original can be averaged cutting as 10 son originals
File；If the size of a record is 10M in original, and then determines that the record data that each sub- original may include are 100
Item；Original sub- for first, starting point record position and tail point record position are respectively the 1st article of record position and the 100th article
Record position.
Optionally, using above-mentioned same process, it can be realized and the new file of son is obtained to the progress cutting of new file.Into one
Step, in the present embodiment, the size of sub- original and the new file of son is less than content capacity.
In addition, sub- original and the new file of son may also be stored in disk.It is illustrated by taking sub- original as an example, specifically
, it, can be from magnetic after determining the record quantity and starting point record position and tail point record position that each sub- original may include
The 0th to 100 article of record is read in disk and obtains first sub- original, and disk is written into this first sub- original；Later
The 101st article to 200 articles of record is read from disk and obtains second sub- original, and magnetic is written into this second sub- original
Disk, and so on, disk can be written in each sub- original.
S120, the record in sub- original is ranked up, and ranking results is stored in former sort file.
In the present embodiment, former sort file is the sort file of original, and former sort file can in disk or other
In the storage container of larger container, following to be illustrated so that former sort file is in disk as an example, but it is not limited to this.It is optional
, it in memory, can be according to the critical field value and setting ordering rule of the record of sub- original, to the note in sub- original
Record is ranked up, and will be in the former sort file of ranking results write-in disk.Wherein, refer to can be unique in file for critical field
Determine one or a set of field of described things；For example, critical field can be identity card in student database, it is crucial
Field value is identification card number；In map interest point data base, critical field can be coordinate of interest points, critical field value
As coordinate of interest points value.Setting ordering rule be it is preset, according to keywords section value sorts from small to large or from big
To it is small sequence etc..Optionally, the record in sub- original is ranked up, and ranking results is stored in former sort file
Detailed process will be described in detail in the following embodiments.
Record in the new file of S130, antithetical phrase is ranked up, and will be in the new sort file of ranking results write-in disk.
In the present embodiment, new sort file is the sort file of new file, and new sort file can in disk or other
In the storage container of larger container, following to be illustrated so that new sort file is in disk as an example, but it is not limited to this.It is optional
, in memory, according to the sub newly critical field value of the record of file and ordering rule can be set, the note in the new file of antithetical phrase
Record is ranked up, and will be in the new sort file of ranking results write-in disk.It should be noted that the record in the new file of antithetical phrase
The foundation being ranked up, with to the record in sub- original be ranked up according to identical.In addition, the record in the new file of antithetical phrase
It is ranked up, and ranking results is stored in the detailed process in new sort file, will also be described in detail in the following embodiments.
The record in record and new sort file in S140, the former sort file of comparison, obtains record to be synchronized, and according to
Record to be synchronized updates original.
In the present embodiment, record to be synchronized is the delta data in former sort file and new sort file, may include to
At least one of more new record, record to be deleted and record to be increased.Further, record to be synchronized can be stored in disk
In, it may also be stored in memory or other storage containers be medium.
Optionally, the critical field value that record in former sort file can be compared and the record in new sort file
Critical field value obtains record to be synchronized and asynchronous record, and then updates original according to record to be synchronized.Wherein,
Asynchronous record is the identical data in former sort file and new sort file, that is to say, that without update in original
Record.Asynchronous record can be stored in disk.
Optionally, according to record to be synchronized update original may include: according to the record to be increased in record to be synchronized,
Execute the operation that record is inserted into original；According to the record to be deleted in record to be synchronized, executes to delete and remember in original
The operation of record；According to the record to be updated in record to be synchronized, the operation for updating and recording in original is executed.Specifically, if to
Synchronous recording is stored in disk, then record to be synchronized can be first read from disk, is then executed according to record to be synchronized more
New original；If being stored in memory, original directly can be updated according to record to be synchronized.
Technical solution provided by the embodiments of the present application, by respectively to the original greater than memory size stored in disk
Cutting is carried out with new file to obtain less than the sub- original of memory size and the new file of son；It later can in memory, to sub- original text
Record in part is ranked up and arranges the record that ranking results are stored in former sort file and in the new file of antithetical phrase
Sequence, and ranking results are stored in new sort file；And it is arranged by the record in more former sort file in memory with new
The delta data record i.e. to be synchronized in two files of former sort file and new sort file can be obtained in record in preface part,
And then original is updated to realize the update of database according to record to be synchronized, can not be compared in memory at present by solving by two
Size is more than the file of memory size the problem of obtaining delta data, to realize the update of database, while reducing data
Library more amount of new data, improves the renewal rate of database.
Fig. 2 is according to the flow chart of another file updating method provided by the embodiments of the present application, and the present embodiment is above-mentioned
It on the basis of embodiment, is further ranked up to the record in sub- original, and ranking results is stored in former sequence text
In part；And the record in the new file of antithetical phrase is ranked up, and ranking results are stored in new sort file and are explained
It is bright.
As shown in Fig. 2, file updating method provided in this embodiment may include:
S210, respectively in disk original and new file carry out cutting and obtain sub- original and the new file of son.
S220, the record in each sub- original is ranked up to obtain intermediate sub- original respectively, and intermediate son is former
Disk is written in file.
In the present embodiment, intermediate sub- original is the sort file of sub- original.Specifically, in memory, it can foundation
Record sequence, is successively ranked up the record in each sub- original to obtain the sub- original in centre of each sub- original, and
Disk is written into intermediate sub- original.It further, can be from being read in disk in the sub- original for each sub- original
Record；It then can be according to the critical field value and setting ordering rule of the record of the sub- original, in the sub- original
Record be ranked up to obtain the sub- original in centre of the sub- original, and magnetic is written into the sub- original in the centre of the sub- original
Disk；The sub- original in centre of the sub- original can be deleted later.
It should be noted that the process of sequence involved in the present embodiment and subsequent embodiment, sort by is all the same, example
It can such as sort, can also be sorted from large to small according to critical field value from small to large according to critical field value.It is following equal
It is illustrated for sorting from small to large according to critical field value, but it is not limited to this.
For example, free memory capacity is 1G, and then can will be former as shown in figure 3, the size of original file_old is 10G
File cutting is 10 sub- originals old_1, old_2 ... and old_10.Then, sub- original old_ can be read from disk
1 record, and the critical field value of the record according to the sub- original old_1 and ordering rule from small to large, to son original
Record in file old_1 is ranked up to obtain the sub- original old_1_sort in centre of the sub- original old_1；By intermediate son
Original old_1_sort is written after disk, can then read the record of sub- original old_2 from disk, and using with it is upper
It states identical treatment process and obtains intermediate sub- original old_2_sort.And so on, intermediate sub- original old_3_ can be obtained
Sort, intermediate sub- original old_4_sort ... and intermediate sub- original old_10_sort.
S230, the record in the sub- original in all centres is ranked up, and ranking results is stored in former sort file
In.
Specifically, can according to critical field value and setting ordering rule, to the record in the sub- original in all centres into
Row sequence, and ranking results are stored in former sort file.It should be noted that the record in the sub- original in all centres
The foundation being ranked up, with to each sub- original be ranked up according to identical.
Illustratively, the record in the sub- original in all centres is ranked up, and ranking results is stored in former sequence
It may include: to be compared to this former record that waits sorting, and selected according to comparison result for sequencer procedure each time in file
It selects this target original record and former sort file is written；Read from the sub- original in centre belonging to this target original record it is new to
This other original that wait sorting is recorded and new sequence original record is used as record wait the original that sorts next time by sequence original record.
In the present embodiment, wait sort, former record refers to the record read from intermediate sub- original.Further, if this
For the first minor sort, then this former record that waits sorting may include first record read from every sub- original, corresponding
, specific sequencer procedure can be, and first record, and more read first record are read from every sub- original
Critical field value, and according to comparison result and setting ordering rule selection first time target original record, such as will be read
The smallest record of critical field value is recorded as first time target original in first record, and the first row of former sort file is written
In；First time target original record can be deleted from memory later.
If this is the second minor sort, this former record that waits sorting may include affiliated from first time target original record
Other remaining intermediate sub- originals in memory after the Article 2 record read in intermediate sub- original and the first minor sort
First record.Corresponding, specific sequencer procedure can be, from the sub- original in centre belonging to first time target original record
Article 2 record is read, then the key of more read Article 2 record and first record of other intermediate sub- originals
The of former sort file is written in field value, and select second target original record according to comparison result and setting ordering rule
In two rows；Second of target original record can be deleted from memory later.
If this is third minor sort, this former record that waits sorting may include affiliated from second of target original record
After the Article 2 record or Article 3 record and the second minor sort that are read in intermediate sub- original in memory it is remaining its
First record and Article 2 record of his intermediate sub- original or first record.Corresponding, specific sequencer procedure can be with
It is to read Article 2 record or Article 3 record from the sub- original in centre belonging to second of target original record, then compare
Critical field value of the relatively third time wait the former record that sorts, and third time target is selected according to comparison result and setting ordering rule
Original record is written in the third line of former sort file；Third time target original record can be deleted from memory later.
Optionally, and so on, until sequence is completed, the record in the sub- original in all centres can be all written to former row
In preface part as shown in Figure 3.
S240, the record in the new file of each son is ranked up to obtain the intermediate new file of son respectively, and intermediate son is new
Disk is written in file.
In the present embodiment, the intermediate new file of son is the sort file of the new file of son.To the collated of the new file of each son
Journey is identical as the sequencer procedure to each sub- original.Specifically, in memory, it can be according to record sequence, successively to each son
Record in new file is ranked up to obtain the intermediate new file of son of the new file of each son, and magnetic is written in the new file of intermediate son
Disk.It further, can be from the record read in disk in the new file of the son for each new file of son；It then can be according to this
The critical field value and setting ordering rule of the record of sub new file are ranked up this to the record in the new file of the son
The intermediate new file of son of sub new file, and disk is written into the new file of intermediate son of the new file of the son；It is new that the son can be deleted later
The intermediate new file of son of file.
S250, the record in all intermediate new files of son is ranked up, and ranking results is stored in new sort file
In.
In the present embodiment, to the process that the record in all intermediate new files of son is ranked up, and to all intermediate son originals
The process that record in file is ranked up is identical.It specifically may is that for sequencer procedure each time, to this new note that waits sorting
Record is compared, and selects this target new record that new sort file is written according to comparison result；From this target new record institute
New new record to be sorted is read in the new file of intermediate son of category, this other new record to be sorted and new sequence are newly remembered
Record is as new record to be sorted next time.
It should be noted that needing to write data into memory due to being ranked up to data, carry out in memory, but for
Size is more than the file of memory size, then can not be ranked up in memory.The application is greater than size the text of memory size
Part such as original, by being ranked up respectively to each sub- original less than memory size that the original cutting obtains, and
The sub- original write-in disk in the centre that sequence is obtained；Later using endless form to the record in the sub- original in all centres into
Row sequence, and then the sort file of the original can be obtained, the new sort file of new file similarly can be obtained, be greater than for size interior
It deposits record ordering in the file of capacity and provides a kind of new approaches.
The record in record and new sort file in S260, the former sort file of comparison, obtains record to be synchronized, and according to
Record to be synchronized updates original.
Technical solution provided by the embodiments of the present application, original and new file for size greater than memory size, passes through
The intermediate son that each sub- original less than memory size that original cutting obtains is ranked up respectively, and sequence is obtained
Disk is written in original；The record in the sub- original in all centres is ranked up using endless form later, and then available
The new sort file of new file similarly can be obtained in the former sort file of original, is greater than in the file of memory size for size and remembers
Record sequence provides a kind of new approaches；Later by the record and new sort file in more former sort file in memory
Record, can be obtained the delta data record i.e. to be synchronized in two files of former sort file and new sort file, so according to
Synchronous recording updates original to realize the update of database, and it is more than interior that two sizes can not be compared in memory at present by, which solving,
The file of capacity is deposited the problem of obtaining delta data, to realize the update of database, while reducing update data of database
Amount, improves the renewal rate of database.
Fig. 4 is according to the flow chart of another file updating method provided by the embodiments of the present application, and the present embodiment is above-mentioned
On the basis of embodiment, further to the record in the record and new sort file in more former sort file, obtain to be synchronized
Record is explained.
As shown in figure 4, file updating method provided in this embodiment may include:
S410, respectively in disk original and new file carry out cutting and obtain sub- original and the new file of son.
S420, the record in sub- original is ranked up, and ranking results is stored in former sort file.
Record in the new file of S430, antithetical phrase is ranked up, and ranking results are stored in new sort file.
S440, this new record to be processed in the former record to be processed of this in former sort file and new sort file is determined
Whether critical field value is identical；If they are the same, then S450 is executed；If it is different, then executing S470.
In the present embodiment, former record to be processed refers to the record read from former sort file；New record to be processed refers to
The record read from new sort file.It, can be to being read into memory it should be noted that treatment process terminates each time
The record in record and/or new sort file in former sort file is purged；This can be any secondary treatment process, right
It answers, record when this former record to be processed refers to this processing of progress, in original sort file stored in memory；This is waited for
Record when processing new record refers to this processing of progress, in new sort file stored in memory.
In order to make it easy to understand, can be realized according to container mode in the record and new sort file in more former sort file
Record.Optionally, two container As and B can be defined in memory, and wherein the corresponding former sort file of container A, container B are corresponding new
Sort file；That is the former record storage to be processed read from former sort file is in container A, from new sort file
The new record to be processed read is stored in container B.In turn, this former record to be processed is it is to be understood that carry out this processing
When, the former record to be processed that stores in container A；This new record to be processed is it is to be understood that when carrying out this processing, container B
The new record to be processed of middle storage.
Whether S450, other field values compared in this former record to be processed and this new record to be processed are identical,
And this record to be synchronized and this type to be synchronized are determined according to comparison result.
In the present embodiment, type to be synchronized is corresponding with type belonging to record to be synchronized；If it is to be synchronized be recorded as it is to be updated
Record, then type to be synchronized is to be updated；If to be synchronized be recorded as record to be deleted, type to be synchronized is to be deleted；If to
Synchronous recording is record to be increased, then type to be synchronized is to be increased.
Specifically, for treatment process each time, if the critical field value in this former record to be processed is waited for this
The critical field value handled in new record is identical, it is determined that other field values in this former record to be processed whether with this
Other field values in secondary new record to be processed are identical；If they are the same, then illustrate the former record to be processed of this in former sort file
It is identical with the new record to be processed of this in new sort file, i.e., this record in original and this note in new file
Picture recording does not change than, it is not necessary to be updated；If not identical, illustrate the record to be processed of this in former sort file and new row
The new record to be processed of this in preface part is not exactly the same, i.e., this record is the update of this in original record in new file
Record, and then can be using this new record to be processed as this record to be synchronized, and determine that this type to be synchronized is to be updated.
It is following to be illustrated so that this is first time treatment process as an example.If this is first time treatment process, this
Former record to be processed can be first record read from former sort file, this new record to be processed can be from new row
First record read in preface part.It is put into container A specifically, first record can be read from former sort file,
First record is read from new sort file to be put into container B；Compare the critical field value and container B recorded in container A
Whether the critical field value of middle record is identical；If it is different, then executing S470；If they are the same, then compare other recorded in container A
Whether other field values recorded in field value and container B are identical, if not identical, it is determined that record is container A in container B
The more new record of middle record, and then can be by record in container B as record to be synchronized for the first time, and determine to be synchronized for the first time
Type is to be updated.In addition, if other field values recorded in other field values and container B for recording in container A are identical,
Then determine that record is identical with recording in container A in container B, at this point, can be by record write-in disk in container A or container B
In asynchronous record file.
Later, it can delete and be recorded in container A and container B, and execute S460 and determine whether from former sort file and new sort
Second former record and second of new record to be processed to be processed are read in file respectively；If so, will be from former sort file
In read Article 2 record be put into container A, and by the Article 2 read from new sort file record be put into appearance
In device B, then returns and execute S440；If not, it is determined that processing is completed.
S460, determine whether from read respectively in former sort file and new sort file former record to be processed next time and under
Secondary new record to be processed；S440 is executed if so, returning；If it is not, then executing S490.
S470, according to the critical field value of this former record to be processed and this new record to be processed, determine that this is waited for
Synchronous recording and this type to be synchronized.
In the present embodiment, record ordering rule is different in former sort file and new sort file, this former record to be processed
Critical field value and this new record to be processed critical field value it is of different sizes, and then identified this waits for together
Step record is different with this type to be synchronized.It is sorted in ascending order i.e. for example, being recorded in former sort file and new sort file from small
To big sequence, if the critical field value of this former record to be processed is less than the critical field value of this new record to be processed,
Then illustrate that this original to be processed is recorded in record corresponding in original and has been deleted, it at this time can be by this former note to be processed
Record is used as this record to be synchronized, and determines that this type to be synchronized is to be deleted；If the keyword of this former record to be processed
Section value is greater than the critical field value of this new record to be processed, then illustrates that this new record to be processed is newly-increased data, into
And can be using this new record to be processed as this record to be synchronized, and determine that this type to be synchronized is to be increased.
In addition, the case where sequence sorts from large to small in descending order is recorded in former sort file and new sort file, with
It is opposite that the case where sorting from small to large is sorted in ascending order in record in above-mentioned original sort file and new sort file.Specifically, if
The critical field value of this former record to be processed is less than the critical field value of this new record to be processed, then illustrates that this is waited for
Processing new record is newly-increased data, and then can be using this new record to be processed as this record to be synchronized, and determines this
Type to be synchronized is to be increased；If the critical field value of this former record to be processed is greater than the key of this new record to be processed
Field value then illustrates that this original to be processed is recorded in record corresponding in original and has been deleted, at this time can be by this
Former record to be processed is used as this record to be synchronized, and determines that this type to be synchronized is to be deleted.
It is following to be illustrated so that this is first time treatment process as an example.If this is first time treatment process, in container A
The critical field value recorded in the critical field value and container B of record is different, and former sort file and new sort file
Middle record is sorted in ascending order and sorts from small to large, if the critical field value then recorded in container A is less than and records in container B
Critical field value, then can be by record in container A as record to be synchronized for the first time, and determines that type to be synchronized is for the first time
It is to be deleted；Later, it can delete in container A and record, and execute S480 and determine whether to read from former sort file second
Former record to be processed；If so, the Article 2 read from former sort file record is put into container A, then returns and hold
Row S440；If it is not, determining that processing is completed.
It, can be in addition, if the critical field value recorded in container A is greater than the critical field value that records in container B
By record in container B as record to be synchronized for the first time, and determine that type to be synchronized is to be increased for the first time；Later, it can delete
Except being recorded in container B, and executes S480 and determine whether to read second of new record to be processed from new sort file；If so,
Then the Article 2 read from new sort file record is put into container B, then returns and executes S440；If it is not, at determining
Reason is completed.
S480, determine whether to read from former sort file or new sort file former record to be processed next time or next time to
Handle new record；S440 is executed if so, returning；If it is not, then executing S490.
S490, processing are completed.
Technical solution provided by the embodiments of the present application, the new sort text of former sort file and new file for original
Part in memory will be from the former record and new sort file to be processed read in former sort file by using endless form
The critical field value of new record to be processed read is compared, and then former sort file and new can be determined according to comparison result
Delta data, that is, record to be synchronized in two files of sort file, to compare two sizes in memory more than memory size
File provides a kind of new approaches to obtain delta data；Original is updated to realize database according to record to be synchronized simultaneously
It updates, it is more than the file of memory size to obtain asking for delta data that two sizes can not be compared in memory at present by, which solving,
Topic, realizes the update of database, while reducing update data of database amount, improves the renewal rate of database.
Fig. 5 is according to a kind of structural schematic diagram of file updating device provided by the embodiments of the present application, and the device is executable
File updating method provided by the application any embodiment has the corresponding functional module of execution method and beneficial effect.It can
Choosing, which can be realized by the way of software and/or hardware, and can be integrated in the arbitrary equipment with computing capability
On, such as server etc..As shown in figure 5, the apparatus may include:
Cutting module 510, for respectively in disk original and new file carry out cutting obtain sub- original and son
New file；
Sort writing module 520, for being ranked up to the record in sub- original, and ranking results is stored in former row
In preface part；
Sort writing module 520, and the record being also used in the new file of antithetical phrase is ranked up, and ranking results are stored in newly
In sort file；
Record comparison module 530, for comparing the record in record and new sort file in former sort file, obtain to
Synchronous recording, and the original is updated according to record to be synchronized；
Wherein, original and the size of new file are greater than memory size；Sub- original and the size of the new file of son are less than interior
Hold capacity.
Technical solution provided by the embodiments of the present application, by respectively to the original greater than memory size stored in disk
Cutting is carried out with new file to obtain less than the sub- original of memory size and the new file of son；It later can in memory, to sub- original text
Record in part is ranked up and arranges the record that ranking results are stored in former sort file and in the new file of antithetical phrase
Sequence, and ranking results are stored in new sort file；And it is arranged by the record in more former sort file in memory with new
The delta data record i.e. to be synchronized in two files of former sort file and new sort file can be obtained in record in preface part,
And then original is updated to realize the update of database according to record to be synchronized, can not be compared in memory at present by solving by two
Size is more than the file of memory size the problem of obtaining delta data, to realize the update of database, while reducing data
Library more amount of new data, improves the renewal rate of database.
Illustratively, sequence writing module 520 may include:
First sequence writing unit obtains intermediate sub- original text for being ranked up respectively to the record in each sub- original
Part, and disk is written into intermediate sub- original；
Second sequence writing unit, for being ranked up to the record in the sub- original in all centres, and by ranking results
It is stored in former sort file；
First sequence writing unit is also used to be ranked up to obtain to the record in the new file of each son respectively intermediate sub new
File, and disk is written into the new file of intermediate son；
Second sequence writing unit is also used to be ranked up the record in all intermediate new files of son, and sequence is tied
Fruit is stored in new sort file.
Illustratively, the second sequence writing unit specifically can be used for:
This former record that waits sorting is compared, and the former sequence of this target original record write-in is selected according to comparison result
File；
Read from the sub- original in centre belonging to this target original record new wait the former record that sorts, by this, other are waited for
The former record of sequence and new sequence original record are used as next time wait the former record that sorts；
Illustratively, the second sequence writing unit specifically can be also used for:
This new record to be sorted is compared, and selects this target new record that new sort is written according to comparison result
File；
New new record to be sorted is read from the new file of intermediate son belonging to this target new record, other are waited for by this
Sequence new record and new sequence new record are as new record to be sorted next time.
Illustratively, record comparison module 530 specifically can be used for:
If the keyword of this new record to be processed in the former record to be processed of this in former sort file and new sort file
Section value is identical, then whether other field values compared in this former record to be processed and this new record to be processed are identical,
And this record to be synchronized and this type to be synchronized are determined according to comparison result, and from former sort file and new sort file
It is middle to read former record to be processed next time and new record to be processed next time respectively.
Illustratively, record comparison module 530 specifically can be also used for:
If the keyword of this new record to be processed in the former record to be processed of this in former sort file and new sort file
Section value is different, then according to the critical field value of this former record to be processed and this new record to be processed, determines that this is waited for
Synchronous recording and this type to be synchronized；And former note to be processed next time is read from former sort file or new sort file
Record or new record to be processed next time.
Illustratively, record comparison module 530 according to comparison result determine this it is to be synchronized record and this wait for together
When walking type, specifically it can be used for:
If comparison result be it is not identical, will this described new record to be processed as this record to be synchronized, and determine
This type to be synchronized is to be updated.
Illustratively, it is sorted in ascending order if being recorded in former sort file and new sort file, records comparison module 530 and exist
According to the critical field value of this former record to be processed and this new record to be processed, this record to be synchronized and sheet are determined
When secondary type to be synchronized, specifically it can be used for:
If the critical field value of this former record to be processed is less than the critical field value of this new record to be processed,
It regard this former record to be processed as this record to be synchronized, and determines that this type to be synchronized is to be deleted；
If the critical field value of this former record to be processed is greater than the critical field value of this new record to be processed,
Using this new record to be processed as this record to be synchronized, and determine that this type to be synchronized is to be increased.
According to an embodiment of the present application, present invention also provides a kind of electronic equipment and a kind of readable storage medium storing program for executing.
As shown in fig. 6, being the block diagram according to the electronic equipment of the file updating method of the embodiment of the present application.Electronic equipment purport
Indicating various forms of digital computers, such as, laptop computer, desktop computer, workbench, personal digital assistant,
Server, blade server, mainframe computer and other suitable computer.Electronic equipment also may indicate that various forms
Mobile device, such as, personal digital assistant, cellular phone, smart phone, wearable device and other similar calculating dresses
It sets.Component, their connection and relationship shown in this article and their function are merely exemplary, and are not intended to limit
The realization of described herein and/or requirement the application.
As shown in fig. 6, the electronic equipment includes: one or more processors 601, memory 602, and each for connecting
The interface of component, including high-speed interface and low-speed interface.All parts are interconnected using different buses, and can be pacified
It installs in other ways on public mainboard or as needed.Processor can to the instruction executed in electronic equipment into
Row processing, including storage in memory or on memory (such as, to be coupled to interface in external input/output device
Display equipment) on show graphic user interface (Graphical User Interface, GUI) graphical information instruction.In
In other embodiment, if desired, can be by multiple processors and/or multiple bus and multiple memories and multiple memories one
It rises and uses.It is also possible to connect multiple electronic equipments, each equipment provides the necessary operation in part, for example, as server battle array
Column, one group of blade server or multicomputer system.In Fig. 6 by taking a processor 601 as an example.
Memory 602 is non-transitory computer-readable storage medium provided herein.Wherein, the memory is deposited
The instruction that can be executed by least one processor is contained, so that at least one described processor executes file provided herein
Update method.The non-transitory computer-readable storage medium of the application stores computer instruction, and the computer instruction is based on making
Calculation machine executes file updating method provided herein.
Memory 602 is used as a kind of non-transitory computer-readable storage medium, can be used for storing non-instantaneous software program, non-
Instantaneous computer executable program and module, such as the corresponding program instruction/mould of the file updating method in the embodiment of the present application
Block, for example, attached cutting module 510 shown in fig. 5, sequence writing module 520 and record comparison module 530.Processor 601 passes through
Non-instantaneous software program, instruction and the module of operation storage in the memory 602, are answered thereby executing the various functions of server
With and data processing, i.e., realization above method embodiment in file updating method.
Memory 602 may include storing program area and storage data area, wherein storing program area can store operation system
Application program required for system, at least one function；Storage data area can be stored according to the electricity for being used to realize file updating method
Sub- equipment uses created data etc..In addition, memory 602 may include high-speed random access memory, can also wrap
Include non-transitory memory, a for example, at least disk memory, flush memory device or other non-instantaneous solid-state memories.In
In some embodiments, optional memory 602 includes the memory remotely located relative to processor 601, these remote memories
It can be by being connected to the network to the electronic equipment for being used to realize file updating method.The example of above-mentioned network is including but not limited to mutual
Networking, intranet, local area network, mobile radio communication and combinations thereof.
For realizing that the electronic equipment of file updating method can also include: input unit 603 and output device 604.Place
Reason device 601, memory 602, input unit 603 can be connected with output device 604 by bus or other modes, in Fig. 6
For being connected by bus.
Input unit 603 can receive the number or character information of input, and generates and be used to realize file updating method
Electronic equipment user setting and function control related key signals input, such as touch screen, keypad, mouse, track
The input units such as plate, touch tablet, indicating arm, one or more mouse button, trace ball, control stick.Output device 604 can be with
Including display equipment, auxiliary lighting apparatus and haptic feedback devices etc., wherein auxiliary lighting apparatus such as light emitting diode
(Light Emitting Diode, LED), haptic feedback devices such as vibrating motor etc..The display equipment may include but not
It is limited to, liquid crystal display (Liquid Crystal Display, LCD), light-emitting diode display and plasma scope.Some
In embodiment, display equipment can be touch screen.
The various embodiments of system and technology described herein can be in digital electronic circuitry, integrated circuit system
System, dedicated specific integrated circuit (Application Specific Integrated Circuit, ASIC), computer hardware,
It is realized in firmware, software, and/or their combination.These various embodiments may include: to implement in one or more meter
In calculation machine program, which can be in programmable system containing at least one programmable processor
Execute and/or explain, which can be dedicated or general purpose programmable processors, can from storage system, to
A few input unit and at least one output device receive data and instruction, and data and instruction is transmitted to the storage
System, at least one input unit and at least one output device.
These calculation procedures are also referred to as program, software, software application or code, the machine including programmable processor
Instruction, and can use programming language, and/or the compilation/machine language of level process and/or object-oriented to implement these
Calculation procedure.As used herein, term " machine readable media " and " computer-readable medium " are referred to for referring to machine
Order and/or data are supplied to any computer program product, equipment, and/or the device of programmable processor, for example, disk, light
Disk, memory, programmable logic device (Programmable Logic Device, PLD), including, it receives as machine readable
The machine readable media of the machine instruction of signal.Term " machine-readable signal " is referred to for by machine instruction and/or data
It is supplied to any signal of programmable processor.
In order to provide the interaction with user, system and technology described herein, the computer can be implemented on computers
Include for user show information display device, for example, cathode-ray tube (Cathode Ray Tube, CRT) or
LCD monitor；And keyboard and indicator device, for example, mouse or trace ball, user can pass through the keyboard and the direction fills
It sets to provide input to computer.The device of other types can be also used for providing the interaction with user；For example, being supplied to use
The feedback at family may be any type of sensory feedback for example, visual feedback, audio feedback or touch feedback)；And it can be with
It is inputted with any form, including vocal input, voice input or tactile, to receive input from the user.
System described herein and technology can be implemented including the computing system of background component for example, taking as data
Business device；Or implement including the computing system of middleware component for example, application server；Or implement including front end component
The computing system such as subscriber computer with graphic user interface or web browser, user can use by the figure
Perhaps the web browser to interact or implement with the embodiment of system described herein and technology including this at family interface
In any combination of computing system of kind background component, middleware component or front end component.Can by any form or
The digital data communications of medium, for example, communication network, the component of system is connected with each other.The example of communication network includes: office
Domain net (Local Area Network, LAN), wide area network (Wide Area Network, WAN) and internet.
Computer system may include client and server.Client and server is generally off-site from each other and usually logical
Communication network is crossed to interact.By being run on corresponding computer and each other with the meter of client-server relation
Calculation machine program generates the relationship of client and server.
According to the technical solution of the embodiment of the present application, by respectively to the original greater than memory size stored in disk
Cutting is carried out with new file to obtain less than the sub- original of memory size and the new file of son；It later can in memory, to sub- original text
Record in part be ranked up and by ranking results write-in disk former sort file in and the new file of antithetical phrase in record into
Row sequence, and will be in the new sort file of ranking results write-in disk；And pass through the note in more former sort file in memory
Record in record and new sort file, can be obtained the delta data in two files of former sort file and new sort file i.e. to same
Step record, and then original is updated to realize the update of database according to record to be synchronized, solving at present can not be in memory
Comparing two sizes the problem of obtaining delta data, realizes the update of database more than the file of memory size, subtracts simultaneously
Lack update data of database amount, improves the renewal rate of database.
It should be understood that various forms of processes illustrated above can be used, rearrangement increases or deletes step.Example
Such as, each step recorded in the application of this hair can be performed in parallel or be sequentially performed the order that can also be different and execute,
As long as it is desired as a result, being not limited herein to can be realized technical solution disclosed in the present application.
Above-mentioned specific embodiment does not constitute the limitation to the application protection scope.Those skilled in the art should be bright
White, according to design requirement and other factors, various modifications can be carried out, combination, sub-portfolio and substitution.It is any in the application
Spirit and principle within made modifications, equivalent substitutions and improvements etc., should be included within the application protection scope.
Claims (10)
1. a kind of file updating method characterized by comprising
Respectively in disk original and new file carry out cutting and obtain sub- original and the new file of son；
Record in the sub- original is ranked up, and ranking results are stored in former sort file；
Record in the new file of the son is ranked up, and ranking results are stored in new sort file；
Compare the record in the record and the new sort file in the former sort file, obtains record to be synchronized, and according to
The record to be synchronized updates the original；
Wherein, the original and the size of the new file are greater than memory size；The sub- original and the new file of son
Size be less than content capacity.
2. the method according to claim 1, wherein being ranked up to the record in the sub- original, and will
Ranking results are stored in former sort file, comprising:
The record in each sub- original is ranked up respectively to obtain intermediate sub- original, and the sub- original in the centre is write
Enter disk；
Record in the sub- original in all centres is ranked up, and ranking results are stored in former sort file；
Record in the new file of the son is ranked up, and ranking results are stored in new sort file, comprising:
The record in the new file of each son is ranked up respectively to obtain the intermediate new file of son, and the intermediate new file of son is write
Enter disk；
Record in all intermediate new files of son is ranked up, and ranking results are stored in new sort file.
3. according to the method described in claim 2, it is characterized in that, be ranked up to the record in the sub- original in all centres,
And ranking results are stored in former sort file, comprising:
This former record that waits sorting is compared, and the former sequence text of this target original record write-in is selected according to comparison result
Part；
Read from the sub- original in centre belonging to this target original record new wait the former record that sorts, by this, other wait sorting
Original record and new sequence original record are used as next time wait the former record that sorts；
Record in all intermediate new files of son is ranked up, and ranking results are stored in new sort file, comprising:
This new record to be sorted is compared, and this target new record write-in new sort text is selected according to comparison result
Part；
New new record to be sorted is read from the new file of intermediate son belonging to this target new record, other wait sorting by this
New record and new sequence new record are as new record to be sorted next time.
4. the method according to claim 1, wherein record and the new row in the original sort file
Record in preface part obtains record to be synchronized, comprising:
If the pass of this in the original sort file former record and this new record to be processed in the new sort file to be processed
Key field value is identical, then other fields in this relatively more described former record to be processed and this described new record to be processed take
Whether value is identical, and determines this record to be synchronized and this type to be synchronized according to comparison result, and sort from the original
Former record to be processed next time and new record to be processed next time are read in file and the new sort file respectively.
5. method according to claim 1 or 4, which is characterized in that the record and described in the original sort file
Record in new sort file obtains record to be synchronized, comprising:
If the pass of this in the original sort file former record and this new record to be processed in the new sort file to be processed
Key field value is different, then is taken according to the critical field of this described former record to be processed and this new record to be processed
Value determines this record to be synchronized and this type to be synchronized；And from the former sort file or the new sort file
Middle former record to be processed reading next time or next new record to be processed.
6. according to the method described in claim 4, it is characterized in that, determining this record to be synchronized and sheet according to comparison result
Secondary type to be synchronized, comprising:
If comparison result be it is not identical, will this described new record to be processed as this record to be synchronized, and determine this
Type to be synchronized is to be updated.
7. according to the method described in claim 5, it is characterized in that, if remembering in the original sort file and the new sort file
Record is sorted in ascending order, then records critical field value with this new record to be processed according to this described original to be processed,
Determine this record to be synchronized and this type to be synchronized, comprising:
If the critical field that the critical field value of this former record to be processed is less than this new record to be processed takes
Value then regard this described former record to be processed as this record to be synchronized, and determines that this type to be synchronized is to be deleted；
If the critical field that the critical field value of this former record to be processed is greater than this new record to be processed takes
Value then by this described new record to be processed as this record to be synchronized, and determines that this type to be synchronized is to be increased.
8. the device that a kind of file updates characterized by comprising
Cutting module, for respectively in disk original and new file carry out cutting and obtain sub- original and the new file of son；
Sort writing module, for being ranked up to the record in the sub- original, and ranking results is stored in former sequence
In file；
Sort writing module, is also used to be ranked up the record in the new file of the son, and ranking results are stored in new row
In preface part；
Comparison module is recorded, for the record in the record and the new sort file in the former sort file, is obtained
Record to be synchronized, and the original is updated according to the record to be synchronized；
Wherein, the original and the size of the new file are greater than memory size；The sub- original and the new file of son
Size be less than content capacity.
9. a kind of electronic equipment characterized by comprising
At least one processor；And
The memory being connect at least one described processor communication；Wherein,
The memory is stored with the instruction that can be executed by least one described processor, and described instruction is by described at least one
It manages device to execute, so that at least one described processor is able to carry out file updating method of any of claims 1-7.
10. a kind of non-transitory computer-readable storage medium for being stored with computer instruction, which is characterized in that the computer refers to
It enables for making the computer perform claim require file updating method described in any one of 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910818948.0A CN110515964A (en) | 2019-08-30 | 2019-08-30 | A kind of file updating method, device, electronic equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910818948.0A CN110515964A (en) | 2019-08-30 | 2019-08-30 | A kind of file updating method, device, electronic equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110515964A true CN110515964A (en) | 2019-11-29 |
Family
ID=68629995
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910818948.0A Pending CN110515964A (en) | 2019-08-30 | 2019-08-30 | A kind of file updating method, device, electronic equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110515964A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111639103A (en) * | 2020-06-02 | 2020-09-08 | 中国工商银行股份有限公司 | Service data processing method, device, computer system and medium |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101236554A (en) * | 2007-11-29 | 2008-08-06 | 中兴通讯股份有限公司 | Database mass data comparison process |
| CN101248421A (en) * | 2005-08-26 | 2008-08-20 | 松下电器产业株式会社 | Data recording system, data recording method and data recording program |
| CN101290628A (en) * | 2008-06-17 | 2008-10-22 | 中兴通讯股份有限公司 | Data file updating storage method |
| CN101576834A (en) * | 2009-05-08 | 2009-11-11 | 西安蓝海本立信息科技有限公司 | System and method for protecting continuous data for establishing data view based on time stamp |
| CN102752372A (en) * | 2012-06-18 | 2012-10-24 | 天津神舟通用数据技术有限公司 | File based database synchronization method |
| CN105653554A (en) * | 2014-11-14 | 2016-06-08 | 卓望数码技术（深圳）有限公司 | File data comparison method and system |
| CN107301203A (en) * | 2017-05-27 | 2017-10-27 | 北京思特奇信息技术股份有限公司 | The comparison method and system of a kind of mass data |
| CN107463332A (en) * | 2016-06-03 | 2017-12-12 | 阿里巴巴集团控股有限公司 | A kind of file splitting method and device |
| CN107832401A (en) * | 2017-11-01 | 2018-03-23 | 郑州云海信息技术有限公司 | Database data access method, system, device and computer-readable recording medium |
| CN108762798A (en) * | 2017-04-25 | 2018-11-06 | 腾讯科技（深圳）有限公司 | A kind of method and device of incremental update file |
| CN109325026A (en) * | 2018-08-14 | 2019-02-12 | 中国平安人寿保险股份有限公司 | Data processing method, device, equipment and medium based on big data platform |
| CN109842661A (en) * | 2017-11-28 | 2019-06-04 | 珠海市君天电子科技有限公司 | A kind of data transmission method, device, electronic equipment and storage medium |
| CN109947787A (en) * | 2017-10-30 | 2019-06-28 | 阿里巴巴集团控股有限公司 | A kind of storage of data hierarchy, hierarchical query method and device |
-
2019
- 2019-08-30 CN CN201910818948.0A patent/CN110515964A/en active Pending
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101248421A (en) * | 2005-08-26 | 2008-08-20 | 松下电器产业株式会社 | Data recording system, data recording method and data recording program |
| CN101236554A (en) * | 2007-11-29 | 2008-08-06 | 中兴通讯股份有限公司 | Database mass data comparison process |
| CN101290628A (en) * | 2008-06-17 | 2008-10-22 | 中兴通讯股份有限公司 | Data file updating storage method |
| CN101576834A (en) * | 2009-05-08 | 2009-11-11 | 西安蓝海本立信息科技有限公司 | System and method for protecting continuous data for establishing data view based on time stamp |
| CN102752372A (en) * | 2012-06-18 | 2012-10-24 | 天津神舟通用数据技术有限公司 | File based database synchronization method |
| CN105653554A (en) * | 2014-11-14 | 2016-06-08 | 卓望数码技术（深圳）有限公司 | File data comparison method and system |
| CN107463332A (en) * | 2016-06-03 | 2017-12-12 | 阿里巴巴集团控股有限公司 | A kind of file splitting method and device |
| CN108762798A (en) * | 2017-04-25 | 2018-11-06 | 腾讯科技（深圳）有限公司 | A kind of method and device of incremental update file |
| CN107301203A (en) * | 2017-05-27 | 2017-10-27 | 北京思特奇信息技术股份有限公司 | The comparison method and system of a kind of mass data |
| CN109947787A (en) * | 2017-10-30 | 2019-06-28 | 阿里巴巴集团控股有限公司 | A kind of storage of data hierarchy, hierarchical query method and device |
| CN107832401A (en) * | 2017-11-01 | 2018-03-23 | 郑州云海信息技术有限公司 | Database data access method, system, device and computer-readable recording medium |
| CN109842661A (en) * | 2017-11-28 | 2019-06-04 | 珠海市君天电子科技有限公司 | A kind of data transmission method, device, electronic equipment and storage medium |
| CN109325026A (en) * | 2018-08-14 | 2019-02-12 | 中国平安人寿保险股份有限公司 | Data processing method, device, equipment and medium based on big data platform |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111639103A (en) * | 2020-06-02 | 2020-09-08 | 中国工商银行股份有限公司 | Service data processing method, device, computer system and medium |
| CN111639103B (en) * | 2020-06-02 | 2023-09-12 | 中国工商银行股份有限公司 | Service data processing method, device, computer system and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103440285B (en) | Large-scale mobile phone games system and database update method thereof | |
| CN112115113B (en) | Data storage system, method, device, equipment and storage medium | |
| US20200342029A1 (en) | Systems and methods for querying databases using interactive search paths | |
| CN108958731B (en) | Application program interface generation method, device, equipment and storage medium | |
| CN104267974B (en) | The call method and device of business interface | |
| CN110633281A (en) | Method and device for processing multi-type data sources | |
| CN112487036A (en) | Data processing method and device | |
| CN113655895B (en) | Information recommendation method and device applied to input method and electronic equipment | |
| CN110515964A (en) | A kind of file updating method, device, electronic equipment and medium | |
| CN111858581A (en) | Page query method and device, storage medium and electronic equipment | |
| CN112306452A (en) | Method, device and system for processing service data by merging and sorting algorithm | |
| CN110019750A (en) | The method and apparatus that more than two received text problems are presented | |
| CN115130442A (en) | Report generation method and device, storage medium and computer equipment | |
| US9972109B2 (en) | Implementing out of order access to reversal operations in images | |
| CN107885452A (en) | 3D Touch analogy methods and device, computer installation and computer-readable recording medium | |
| CN112612757A (en) | Application display method, device, equipment, storage medium and program product | |
| CN112989769A (en) | Method, device and platform for constructing multi-data-source form based on form engine | |
| CN112329943A (en) | Combined index selection method and device, computer equipment and medium | |
| CN109815123A (en) | Interface testing case script classification method, device, electronic equipment and medium | |
| CN111079771A (en) | Method and system for extracting characteristics of click-to-read image, terminal device and storage medium | |
| CN109561146A (en) | Document down loading method, device, terminal device | |
| CN114741147B (en) | Method for displaying page on mobile terminal and mobile terminal | |
| US20220198301A1 (en) | Method and apparatus for update processing of question answering system | |
| CN111090824B (en) | Content processing method and device | |
| CN110175116B (en) | Test date switching method, device and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191129 |