Method for searching content particularly for extracts common to two computer files
AssigneeFrancois Lebrat & TDF
InventorFrançois Lebrat
Life of this patent
Estimating the term…
Loading patent…
AssigneeFrancois Lebrat & TDF
InventorFrançois Lebrat
Estimating the term…
The present invention relates to searching content, particularly for at least one extract common to a first data file and a second data file. The method comprises a preliminary step of preparing at least the first file by (a) dividing the first file into a series of data packets having a predetermined size, and identifying packet addresses in said file, (b) combining each packet address with a digital signature that defines one of three fuzzy logic states, namely true, false and indeterminate, and is the result of a combinatorial computation on data from said file; whereafter said method comprises performing an actual search for a common extract by (c) comparing the fuzzy logic states combined with each packet address of the first file with fuzzy logic states determined on the basis of data from the second file, and (d) removing from said common extract search the respective address pairs from the first and second files that have the respective logic states true and false or false and true, and retaining the other address pairs that identify data packets that may comprise said common extract.
A method implemented by computer means of searching content, for at least one extract common to a first file and to a second file, in the form of binary data, being searched for, wherein the method comprises:
A computer program product, stored in a memory of a central unit of a computer or on a removable medium to cooperate with a reader of said central unit, the program comprising instructions for conducting steps for searching at least one extract common to a first file and to a second file, in the form of binary data, said steps comprising:
A data structure stored on a computer-readable storage medium used for a search of at least one extract common to a first and a second file, the data structure being representative of the first file, the data structure being obtained by the implementation of the following steps:
Dependencies are inferred from the claim text.