CN110472205B - File differentiation comparison method and device, storage medium and electronic device - Google Patents
File differentiation comparison method and device, storage medium and electronic device Download PDFInfo
- Publication number
- CN110472205B CN110472205B CN201910779924.9A CN201910779924A CN110472205B CN 110472205 B CN110472205 B CN 110472205B CN 201910779924 A CN201910779924 A CN 201910779924A CN 110472205 B CN110472205 B CN 110472205B
- Authority
- CN
- China
- Prior art keywords
- file
- ranges
- sub
- symbols
- comparison
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/17—Details of further file system functions
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a method and a device for comparing file differentiation, a storage medium and an electronic device, wherein the method comprises the following steps: comparing the first file with the second file according to the sequence of symbols in the files; dividing symbol sequences in the first file and the second file into a plurality of sub-ranges according to the same row symbols appearing in the comparison result; and executing the longest common subsequence LCS on the unmatched symbol sequences in the first file and the second file according to the multiple sub-ranges to obtain a comparison difference result. The invention solves the problem that the accuracy and the readability of the result obtained by differential comparison are poor due to the fact that the longest common subsequence of two character sequences is found in the related technology, or the symbol which is converted into the other sequence is equivalently found through the minimum mode of deleting or inserting operands, and improves the accuracy and the expandability of the file difference.
Description
Technical Field
The present invention relates to the field of computers, and in particular, to a method and apparatus for comparing file differentiation, a storage medium, and an electronic apparatus.
Background
The problem of differential alignment of documents, which is one of the bottom steps of the functional implementation of many applications, based on the content of each line within the document and a string of characters or symbol sequences, has been reduced to determining the difference between two symbol sequences, and has been widely studied, and algorithms for this problem have many applications, including spelling correction systems, document comparison tools, and genetic evolution studies.
The prior art adopts the following modes: finding one longest common subsequence (Longest Common Subsequence, abbreviated LCS) of two character sequences, or equivalently finding the smallest way to convert the symbols of one sequence into the other by deleting or inserting operands, while this approach produces differences that are often not human readable, the differentiation comparison in the prior art results in poor accuracy and readability.
There is currently no effective solution to the above-described problems in the related art.
Disclosure of Invention
The embodiment of the invention provides a method and a device for comparing file differentiation, a storage medium and an electronic device, which at least solve the problems that in the related technology, one longest common subsequence of two character sequences is found, or equivalently, a symbol for converting one sequence into the other sequence is found, and the accuracy and the readability of a result obtained by comparing the differentiation are poor in a minimum mode of deleting or inserting an operand.
According to an embodiment of the present invention, there is provided an alignment method of file differentiation, including: comparing the first file with the second file according to the sequence of symbols in the files; dividing symbol sequences in the first file and the second file into a plurality of sub-ranges according to the same row symbols appearing in the comparison result; and executing the longest common subsequence LCS on the unmatched symbol sequences in the first file and the second file according to the multiple sub-ranges to obtain a comparison difference result.
According to another embodiment of the present invention, there is provided an alignment apparatus for file differentiation, including: the comparison module is used for comparing the first file with the second file according to the sequence of the symbols in the files; the dividing module is used for dividing the symbol sequences in the first file and the second file into a plurality of sub-ranges according to the same row symbols appearing in the comparison result; and the execution module is used for executing the longest common subsequence LCS on the unmatched symbol sequences in the first file and the second file according to the multiple sub-ranges to obtain a comparison difference result.
According to a further embodiment of the invention, there is also provided a storage medium having stored therein a computer program, wherein the computer program is arranged to perform the steps of any of the method embodiments described above when run.
According to a further embodiment of the invention, there is also provided an electronic device comprising a memory having stored therein a computer program and a processor arranged to run the computer program to perform the steps of any of the method embodiments described above.
According to the invention, the first file and the second file are compared according to the sequence of the symbol sequences in the files, the symbol sequences in the first file and the second file are divided into a plurality of sub-ranges according to the same row symbols appearing in the comparison result, and further, according to the plurality of sub-ranges, the longest common sub-sequence LCS is executed on the unmatched symbol sequences in the first file and the second file to obtain a comparison difference result, so that the problem that the accuracy and the readability of the result are poor due to the fact that one longest common sub-sequence of two character sequences is found in the related technology, or equivalently, the symbol of which one sequence is converted into the other sequence is found, is solved, and the accuracy and the expandability of the file difference are improved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiments of the invention and together with the description serve to explain the invention and do not constitute a limitation on the invention. In the drawings:
fig. 1 is a hardware configuration block diagram of a terminal of a method of file differential alignment according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method of file differencing alignment according to an embodiment of the present invention;
fig. 3 is a block diagram of a device for differential file alignment according to an embodiment of the present invention.
Detailed Description
The invention will be described in detail hereinafter with reference to the drawings in conjunction with embodiments. It should be noted that, in the case of no conflict, the embodiments and features in the embodiments may be combined with each other.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order.
Example 1
The method embodiment provided in the first embodiment of the present application may be executed in a terminal, a computer terminal, or a similar computing device. Taking the operation on the terminal as an example, fig. 1 is a block diagram of a hardware structure of the terminal of a method for comparing file differentiation according to an embodiment of the present invention. As shown in fig. 1, the terminal 10 may include one or more (only one is shown in fig. 1) processors 102 (the processor 102 may include, but is not limited to, a microprocessor MCU or a processing device such as a programmable logic device FPGA) and a memory 104 for storing data, and optionally a transmission device 106 for communication functions and an input-output device 108. It will be appreciated by those skilled in the art that the structure shown in fig. 1 is merely illustrative and not limiting on the structure of the terminal described above. For example, the terminal 10 may also include more or fewer components than shown in FIG. 1, or have a different configuration than shown in FIG. 1.
The memory 104 may be used to store a computer program, for example, a software program of application software and a module, such as a computer program corresponding to a method for file differential alignment in an embodiment of the present invention, and the processor 102 executes the computer program stored in the memory 104 to perform various functional applications and data processing, that is, implement the above-mentioned method. Memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include memory located remotely from the processor 102, which may be connected to the terminal 10 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission means 106 is arranged to receive or transmit data via a network. The specific examples of the network described above may include a wireless network provided by a communication provider of the terminal 10. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, simply referred to as NIC) that can connect to other network devices through a base station to communicate with the internet. In one example, the transmission device 106 may be a Radio Frequency (RF) module, which is used to communicate with the internet wirelessly.
In this embodiment, a method for comparing file differentiation running on the terminal is provided, and fig. 2 is a flowchart of a method for comparing file differentiation according to an embodiment of the present invention, as shown in fig. 2, where the flowchart includes the following steps:
step S202, comparing the first file with the second file according to the sequence of symbols in the files;
step S204, dividing symbol sequences in the first file and the second file into a plurality of sub-ranges according to the same row symbols appearing in the comparison result;
in step S206, according to the multiple sub-ranges, the longest common subsequence LCS is executed on the unmatched symbol sequences in the first file and the second file to obtain a comparison difference result.
Through the steps S202 to S204, the first file and the second file are compared according to the sequence of the symbol sequences in the files, and the symbol sequences in the first file and the second file are divided into a plurality of sub-ranges according to the same row symbols appearing in the comparison result, and then the longest common sub-sequence LCS is executed on the unmatched symbol sequences in the first file and the second file according to the plurality of sub-ranges to obtain a comparison difference result, thereby solving the problems that in the related art, one longest common sub-sequence of two character sequences is found, or equivalently, the symbol of one sequence converted into the other sequence is found, and the accuracy and the readability of the result are poor due to the fact that the difference comparison result is caused by the minimum mode of deleting or inserting operands, and improving the accuracy and the expandability of the file difference.
In an optional embodiment of the present application, the comparing the first file and the second file according to the order of the symbol sequences in the files in step S202 may further include:
step S202-11, two-way comparison is carried out on the first file and the second file according to the two ends of the symbol sequence ordering in the files until the symbol in the first file and the symbol in the second file are compared;
and step S202-12, reserving the same row of symbols appearing in the comparison process.
In this application, the comparison of the files is performed by a bidirectional comparison method, and in a specific application scenario, the comparison may be: a. first, a range [ a, b ] is determined; the comparison is carried out from the two ends a and b of the range at the same time, so that the comparison efficiency can be accelerated; from a down, from b up until a and b meet and stop, retaining the same row when aligned; the rows of the same content are compared as a comparison result.
In another optional embodiment of the present application, for the manner of dividing the symbol sequences in the first file and the second file into a plurality of sub-ranges according to the same row symbols appearing in the comparison result referred to in step S204, the method may further include:
step S204-11, judging whether the same row symbols appear for a plurality of times in the comparison result;
step S204-12, under the condition that the same row symbol appears for a plurality of times in the comparison result, performing the duplicate removal operation on the same row symbol appearing for a plurality of times;
in step S204-13, the symbol sequences in the first file and the second file are divided into a plurality of sub-ranges according to the same row symbols after the deduplication operation is performed.
For the above steps S204-11 to S204-13, the following files a and B (corresponding to the first file and the second file) are exemplified in a specific application scenario, as shown in table 1,
TABLE 1
The comparison of the file A and the file B in the table 1 is carried out, and the comparison result of the obtained same row symbols is as follows: a, a, e, b, c; it can be seen that a appears twice in the result, so that the deduplication operation is performed, and the final comparison result is: a, e, b, c.
In another optional embodiment of the present application, for the manner of performing the longest common subsequence LCS on the unmatched symbol sequences in the first file and the second file according to the multiple sub-ranges referred to in step S206 to obtain the comparison difference result, the method may further include:
step S206-11, respectively comparing a plurality of sub-ranges in the first file and the second file;
step S206-12, deleting or adding the symbol corresponding to the empty line under the condition that the empty line appears in any one of the compared sub-ranges;
step S206-13, skipping the sub-range under the condition that two sub-ranges in the compared sub-range are empty rows;
step S206-14, in the case that no unique row exists in the two sub-ranges in the compared sub-ranges, the rows in the two compared sub-ranges are aligned.
It should be noted that, the way to compare the multiple sub-ranges in the first file and the second file in step S206-11 may further be: judging whether the two compared sub-ranges have unique and same symbols or not; under the condition that the unique same symbols exist in the two compared sub-ranges, dividing the two sub-ranges again according to the unique same symbols, and comparing the sub-ranges divided again; in case that there is no unique identical symbol in the two sub-ranges being compared, the execution of the comparison operation of the sub-ranges is triggered.
That is, the rows in which two files appear exactly once in the comparison result are selected, then these uniquely appearing rows are used as the reference for dividing the sub-ranges, LCS is performed on the rows that are not matched in the newly divided sub-ranges to match them together, or referred to as alignment, for the case of grouping, a certain row in the two files, and an empty content, the output is added or deleted depending on which file the group of the content belongs to.
The following explanation will be made with the files a and B in table 1;
aligning each sub-range for file a and file B results in:
the (a, e, b, c) sub-ranges in file a, separated by unique matching rows: 21 d31|5252|null|x
The (a, e, B, c) sub-ranges in file B, separated by unique matching rows: 12 13 d|2525|null| null.
Since in the first sub-range d is now both unique, the second calculates the difference as a new unique character matching sequence for that sub-range, dividing it into two new sub-ranges. The new first sub-range (21 vs 12, 13) does not have any unique row, so it will be aligned with the LCS algorithm. The second new sub-range (31 vs empty) is deleted. The second packet above (5252 vs 2525) does not have any unique row, corresponding to delete 5252 add 2525. The third new sub-range (empty vs. empty) is skipped and the last packet (x vs. empty) outputs x as deleted
It should be noted that, if the divided new sub-range can still be divided continuously, the above comparison process is repeated until there is no unique matching line termination program in the sub-range, and the comparison difference result of the final files a and B is as follows:
the symbol "-" before indicates deleted, the symbol "+" before indicates added, the others are original unchanged contents:
a
a
-21
+12
+13
d
-31
e
-5252
+2525
b
c
-x
according to the embodiment of the application, in order to generate the file difference comparison result which is more in line with human cognition and understanding, the same parts of two files are reserved, and contents such as empty special line changing symbols and the like cannot be analyzed in error, so that the program has better expandability and maintainability.
From the description of the above embodiments, it will be clear to a person skilled in the art that the method according to the above embodiments may be implemented by means of software plus the necessary general hardware platform, but of course also by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art in the form of a software product stored in a storage medium (e.g. ROM/RAM, magnetic disk, optical disk) comprising instructions for causing a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to perform the method according to the embodiments of the present invention.
Example 2
The embodiment also provides a device for comparing file differentiation, which is used for implementing the above embodiment and the preferred embodiment, and is not described again. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. While the means described in the following embodiments are preferably implemented in software, implementation in hardware, or a combination of software and hardware, is also possible and contemplated.
Fig. 3 is a block diagram of a device for differential file alignment according to an embodiment of the present invention, as shown in fig. 3, the device includes: a comparison module 32 for comparing the first file with the second file according to the order of the symbol sequences in the files; the dividing module 34 is coupled to the comparing module 32, and is configured to divide the symbol sequences in the first file and the second file into a plurality of sub-ranges according to the same row symbols appearing in the comparison result; the execution module 36 is coupled to the dividing module 34, and is configured to execute the longest common subsequence LCS on the unmatched symbol sequences in the first file and the second file according to the multiple sub-ranges to obtain a comparison difference result.
Optionally, the comparing module 32 in the present application may further include: the first comparison unit is used for carrying out bidirectional comparison on the first file and the second file according to the two ends of the symbol sequence ordering in the files until the symbol in the first file and the symbol in the second file are compared; and the reservation unit is used for reserving the same row symbols appearing in the comparison process.
Optionally, the dividing module 34 in the present application may further include: the judging unit is used for judging whether the same row of symbols appear for a plurality of times in the comparison result; the duplicate removal unit is used for executing duplicate removal operation on the same row symbols which appear for a plurality of times under the condition that the same row symbols appear for a plurality of times in the comparison result; and the dividing unit is used for dividing the symbol sequences in the first file and the second file into a plurality of sub-ranges according to the same row symbols after the deduplication operation is performed.
Optionally, the execution module 36 in the present application may further include: the second comparison unit is used for respectively comparing a plurality of sub-ranges in the first file and the second file; the first processing unit is used for deleting or adding symbols corresponding to empty rows under the condition that the empty rows occur in any one of the compared sub-ranges; the second processing unit is used for skipping the sub-range under the condition that two sub-ranges in the compared sub-ranges are empty rows; and the third processing unit is used for aligning the rows in the two compared sub-ranges in the case that no unique row exists in the two compared sub-ranges.
Optionally, the second alignment unit further includes: a judging subunit, configured to judge whether two compared sub-ranges have unique and identical symbols; the processing subunit is used for dividing the two sub-ranges again according to the unique same symbols and comparing the sub-ranges divided again under the condition that the unique same symbols exist in the two compared sub-ranges; and the triggering subunit is used for triggering and executing the comparison operation of the sub-ranges under the condition that no unique identical symbol exists in the two compared sub-ranges.
It should be noted that each of the above modules may be implemented by software or hardware, and for the latter, it may be implemented by, but not limited to: the modules are all located in the same processor; alternatively, the above modules may be located in different processors in any combination.
Example 3
An embodiment of the invention also provides a storage medium having a computer program stored therein, wherein the computer program is arranged to perform the steps of any of the method embodiments described above when run.
Alternatively, in the present embodiment, the above-described storage medium may be configured to store a computer program for performing the steps of:
s1, comparing a first file with a second file according to the sequence of symbols in the files;
s2, dividing symbol sequences in the first file and the second file into a plurality of sub-ranges according to the same row symbols appearing in the comparison result;
and S3, executing the longest common subsequence LCS on the unmatched symbol sequences in the first file and the second file according to the multiple sub-ranges to obtain a comparison difference result.
Alternatively, in the present embodiment, the storage medium may include, but is not limited to: a usb disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing a computer program.
An embodiment of the invention also provides an electronic device comprising a memory having stored therein a computer program and a processor arranged to run the computer program to perform the steps of any of the method embodiments described above.
Optionally, the electronic apparatus may further include a transmission device and an input/output device, where the transmission device is connected to the processor, and the input/output device is connected to the processor.
Alternatively, in the present embodiment, the above-described processor may be configured to execute the following steps by a computer program:
s1, comparing a first file with a second file according to the sequence of symbols in the files;
s2, dividing symbol sequences in the first file and the second file into a plurality of sub-ranges according to the same row symbols appearing in the comparison result;
and S3, executing the longest common subsequence LCS on the unmatched symbol sequences in the first file and the second file according to the multiple sub-ranges to obtain a comparison difference result.
Alternatively, specific examples in this embodiment may refer to examples described in the foregoing embodiments and optional implementations, and this embodiment is not described herein.
It will be appreciated by those skilled in the art that the modules or steps of the invention described above may be implemented in a general purpose computing device, they may be concentrated on a single computing device, or distributed across a network of computing devices, they may alternatively be implemented in program code executable by computing devices, so that they may be stored in a memory device for execution by computing devices, and in some cases, the steps shown or described may be performed in a different order than that shown or described, or they may be separately fabricated into individual integrated circuit modules, or multiple modules or steps within them may be fabricated into a single integrated circuit module for implementation. Thus, the present invention is not limited to any specific combination of hardware and software.
The above description is only of the preferred embodiments of the present invention and is not intended to limit the present invention, but various modifications and variations can be made to the present invention by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the principle of the present invention should be included in the protection scope of the present invention.
Claims (8)
1. A method of document differentiation alignment, comprising:
comparing the first file with the second file according to the sequence of symbols in the files;
dividing a symbol sequence in the first file and the second file into a plurality of sub-ranges according to the same row symbols appearing in the comparison result, wherein the symbol sequence is used for representing the content contained in each row in the file, and the same row symbols are the content contained in the same row in the first file and the second file;
according to the multiple sub-ranges, executing the longest common subsequence LCS on the unmatched symbol sequences in the first file and the second file to obtain a comparison difference result, including: respectively comparing a plurality of sub-ranges in the first file and the second file; under the condition that empty rows appear in any one of the compared sub-ranges, deleting or adding symbols corresponding to the empty rows; under the condition that two sub-ranges in the compared sub-ranges are empty rows, skipping the sub-ranges; aligning the rows in the two compared sub-ranges without unique rows in the two compared sub-ranges, wherein the unique rows comprise rows in which the first file and the second file both appear exactly once in the two compared sub-ranges;
wherein the comparing the multiple sub-ranges in the first file and the second file respectively includes: judging whether the two compared sub-ranges have unique and same symbols or not; under the condition that unique identical symbols exist in the two sub-ranges to be compared, dividing the two sub-ranges again according to the unique identical symbols, and comparing the sub-ranges divided again; in case that there is no unique identical symbol in the two sub-ranges being compared, the execution of the comparison operation of the sub-ranges is triggered.
2. The method of claim 1, wherein comparing the first file with the second file in the order of the symbol sequences in the files comprises:
two-way comparison is carried out on a first file and a second file according to two ends of symbol sequence ordering in the files until symbol comparison in the first file and the second file is completed;
the same row symbols that occur during the alignment are reserved.
3. The method of claim 1, wherein the dividing the symbol sequences in the first file and the second file into a plurality of sub-ranges according to the same row symbols occurring in the comparison result comprises:
judging whether the same row of symbols appear for a plurality of times in the comparison result;
under the condition that the same row symbols appear for a plurality of times in the comparison result, performing de-duplication operation on the same row symbols appearing for a plurality of times;
and dividing symbol sequences in the first file and the second file into a plurality of sub-ranges according to the same row symbols after the deduplication operation is executed.
4. A document differentiated comparison device, comprising:
the comparison module is used for comparing the first file with the second file according to the sequence of the symbols in the files;
the dividing module is used for dividing a symbol sequence in the first file and the second file into a plurality of sub-ranges according to the same row symbols appearing in the comparison result, wherein the symbol sequence is used for representing the content contained in each row in the files, and the same row symbols are the content contained in the same row in the first file and the second file;
the execution module is used for executing the longest common subsequence LCS to the unmatched symbol sequences in the first file and the second file according to the multiple sub-ranges to obtain a comparison difference result;
wherein the execution module comprises: a second comparing unit, configured to compare a plurality of sub-ranges in the first file and the second file respectively; the first processing unit is used for deleting or adding symbols corresponding to empty rows under the condition that the empty rows occur in any one of the compared sub-ranges; the second processing unit is used for skipping the sub-range under the condition that two sub-ranges in the compared sub-ranges are empty rows; a third processing unit, configured to align the rows in the two compared sub-ranges if there is no unique row in the two compared sub-ranges, where the unique row includes a row in which the first file and the second file occur exactly once in the two compared sub-ranges;
the second comparison unit includes: a judging subunit, configured to judge whether two compared sub-ranges have unique and identical symbols; the processing subunit is used for dividing the two sub-ranges again according to the unique identical symbols when the unique identical symbols exist in the two compared sub-ranges, and comparing the sub-ranges divided again; and the triggering subunit is used for triggering and executing the comparison operation of the sub-ranges under the condition that no unique identical symbol exists in the two compared sub-ranges.
5. The apparatus of claim 4, wherein the comparison module comprises:
the first comparison unit is used for carrying out bidirectional comparison on the first file and the second file according to the two ends of the symbol sequence ordering in the files until the symbol in the first file and the symbol in the second file are compared;
and the reservation unit is used for reserving the same row symbols appearing in the comparison process.
6. The apparatus of claim 4, wherein the partitioning module comprises:
the judging unit is used for judging whether the same row of symbols appear for a plurality of times in the comparison result;
the duplicate removal unit is used for executing duplicate removal operation on the same row symbols which appear for a plurality of times under the condition that the same row symbols appear for a plurality of times in the comparison result;
and the dividing unit is used for dividing the symbol sequences in the first file and the second file into a plurality of sub-ranges according to the same row symbols after the deduplication operation is performed.
7. A storage medium having a computer program stored therein, wherein the computer program is arranged to perform the method of any of claims 1 to 3 when run.
8. An electronic device comprising a memory and a processor, characterized in that the memory has stored therein a computer program, the processor being arranged to run the computer program to perform the method of any of the claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910779924.9A CN110472205B (en) | 2019-08-22 | 2019-08-22 | File differentiation comparison method and device, storage medium and electronic device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910779924.9A CN110472205B (en) | 2019-08-22 | 2019-08-22 | File differentiation comparison method and device, storage medium and electronic device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110472205A CN110472205A (en) | 2019-11-19 |
| CN110472205B true CN110472205B (en) | 2023-06-06 |
Family
ID=68513441
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910779924.9A Active CN110472205B (en) | 2019-08-22 | 2019-08-22 | File differentiation comparison method and device, storage medium and electronic device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110472205B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111949604A (en) * | 2020-08-24 | 2020-11-17 | 北京明略昭辉科技有限公司 | File storage method and device, electronic equipment and readable storage medium |
| CN114416077B (en) * | 2021-12-09 | 2024-10-01 | 北京四方继保工程技术有限公司 | Continuous function diagram graph comparison method based on dynamic programming algorithm |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103678451A (en) * | 2012-09-12 | 2014-03-26 | 国际商业机器公司 | Method and system for spreadsheet schema extraction |
| CN109062889A (en) * | 2018-06-27 | 2018-12-21 | 北京明略软件系统有限公司 | A kind of text marking method and apparatus, computer readable storage medium |
| CN109408790A (en) * | 2018-10-17 | 2019-03-01 | 北京我知科技有限公司 | A kind of method that more people edit document |
| CN109597913A (en) * | 2018-11-05 | 2019-04-09 | 东软集团股份有限公司 | The method for being aligned document picture, device, storage medium and electronic equipment |
| CN109815452A (en) * | 2018-12-25 | 2019-05-28 | 东软集团股份有限公司 | Text comparative approach, device, storage medium and electronic equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9298722B2 (en) * | 2009-07-16 | 2016-03-29 | Novell, Inc. | Optimal sequential (de)compression of digital data |
-
2019
- 2019-08-22 CN CN201910779924.9A patent/CN110472205B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103678451A (en) * | 2012-09-12 | 2014-03-26 | 国际商业机器公司 | Method and system for spreadsheet schema extraction |
| CN109062889A (en) * | 2018-06-27 | 2018-12-21 | 北京明略软件系统有限公司 | A kind of text marking method and apparatus, computer readable storage medium |
| CN109408790A (en) * | 2018-10-17 | 2019-03-01 | 北京我知科技有限公司 | A kind of method that more people edit document |
| CN109597913A (en) * | 2018-11-05 | 2019-04-09 | 东软集团股份有限公司 | The method for being aligned document picture, device, storage medium and electronic equipment |
| CN109815452A (en) * | 2018-12-25 | 2019-05-28 | 东软集团股份有限公司 | Text comparative approach, device, storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110472205A (en) | 2019-11-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111177243B (en) | Data export method and device, storage medium and electronic device | |
| CN110019647A (en) | A kind of keyword search methodology, device and search engine | |
| RU2605041C2 (en) | Methods and systems for displaying microblog topics | |
| CN110472205B (en) | File differentiation comparison method and device, storage medium and electronic device | |
| CN107770783B (en) | Base station capacity expansion transformation scheme design method and related equipment | |
| CN110457704A (en) | Determination method, apparatus, storage medium and the electronic device of aiming field | |
| CN107229674A (en) | A kind of data migration device, server and method | |
| CN110221960A (en) | Generate method and device, the computer equipment, storage medium of test case | |
| CN110427494B (en) | Knowledge graph display method and device, storage medium and electronic device | |
| CN103593442A (en) | Duplication eliminating method and device for log data | |
| CN108694205B (en) | Method and device for matching target field | |
| CN111159577B (en) | Community dividing method and device, storage medium and electronic device | |
| CN110532273A (en) | The processing method and processing device of tables of data, storage medium, electronic device | |
| CN111598176B (en) | Image matching processing method and device | |
| CN109981697B (en) | File unloading method, system, server and storage medium | |
| CN111367916B (en) | Data storage method and device | |
| CN104079623A (en) | Method and system for controlling multilevel cloud storage synchrony | |
| US10122803B2 (en) | Network data transmission method, device and system | |
| CN115718879A (en) | Data governance method, device and storage medium | |
| CN111881110B (en) | Data migration method and device | |
| CN111353289B (en) | Document comparison method and device, storage medium and electronic equipment | |
| CN110751204A (en) | Data fusion method and device, storage medium and electronic device | |
| CN107026888B (en) | Large-capacity data transmission device and method | |
| CN113986931B (en) | Report paging method and device, storage medium and computing equipment | |
| CN113343018B (en) | Method and device for determining characteristic value of image, storage medium and electronic device |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |