US20060136514A1 - Software patch generator - Google Patents

Software patch generator Download PDF

Info

Publication number
US20060136514A1
US20060136514A1 US11/209,095 US20909505A US2006136514A1 US 20060136514 A1 US20060136514 A1 US 20060136514A1 US 20909505 A US20909505 A US 20909505A US 2006136514 A1 US2006136514 A1 US 2006136514A1
Authority
US
United States
Prior art keywords
data
list
patch
sorted
file
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.)
Abandoned
Application number
US11/209,095
Inventor
Sergey Kryloff
Yuri Basin
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
PKWare Inc
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US09/144,666 external-priority patent/US6289509B1/en
Application filed by Individual filed Critical Individual
Priority to US11/209,095 priority Critical patent/US20060136514A1/en
Publication of US20060136514A1 publication Critical patent/US20060136514A1/en
Assigned to MARANON CAPITAL, L.P., AS AGENT reassignment MARANON CAPITAL, L.P., AS AGENT SECURITY AGREEMENT Assignors: PKWARE, INC.
Assigned to MARANON CAPITAL, L.P., AS AGENT reassignment MARANON CAPITAL, L.P., AS AGENT SECURITY AGREEMENT Assignors: PKWARE, INC.
Assigned to PKWARE, INC. reassignment PKWARE, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: BASIN, YURI, KRYLOFF, SERGEY A.
Assigned to MARANON CAPITAL, L.P., AS AGENT reassignment MARANON CAPITAL, L.P., AS AGENT SECURITY AGREEMENT Assignors: PKWARE, INC.
Assigned to MARANON CAPITAL, L.P., AS AGENT reassignment MARANON CAPITAL, L.P., AS AGENT SECURITY AGREEMENT Assignors: PKWARE, INC.
Assigned to PKWARE, INC. reassignment PKWARE, INC. RELEASE BY SECURED PARTY (SEE DOCUMENT FOR DETAILS). Assignors: MARANON CAPITAL, L.P., AS AGENT
Assigned to PKWARE, INC. reassignment PKWARE, INC. RELEASE BY SECURED PARTY (SEE DOCUMENT FOR DETAILS). Assignors: MARANON CAPITAL, L.P., AS AGENT
Abandoned legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/60Software deployment
    • G06F8/65Updates
    • G06F8/658Incremental updates; Differential updates
    • YGENERAL 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
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99951File or database maintenance
    • Y10S707/99952Coherency, e.g. same view to multiple users
    • Y10S707/99953Recoverability
    • YGENERAL 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
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99951File or database maintenance
    • Y10S707/99952Coherency, e.g. same view to multiple users
    • Y10S707/99954Version management

Definitions

  • the present invention relates to a method and system for creating revisions of data files, and more particularly, to a system and method for creating patch files and aggregating them into secure, portable compressed archives for distribution. These archives are in a form that is applied to an original copy of the file to revise it (or patch it) to a newer version.
  • the method of the invention includes the ability for combining, compressing, encrypting, authenticating and signing patch files.
  • the present invention covers any type of data or file that may require revisions.
  • a .ZIP file is a file which contains one or more computer files that have been compressed with PKZIP®, a data compression program from PKWare, Inc., or another compatible compression program.
  • PKZIP is a utility program that performs data compression and archiving.
  • the file that PKZIP creates is called a “.ZIP” file.
  • PKZIP can be used to exchange data files between different platforms or machines.
  • PKSFX® is another data compression program from PKWare, Inc.
  • the function of PKSFX® is to turn a .ZIP file into a self-extracting file with a .EXE file extension.
  • a PKSFX file is an executable file that automatically extracts the files it contains when executed.
  • a computer file is compressed through the use of one or more compression algorithms.
  • a compression algorithm is essentially a mathematical formula that scans the data in the file for compressible information.
  • compressible information may be any repeating pattern or string that can be represented in a shorter length than the original compressible information.
  • the compression algorithm will then store only the repeated patterns, along with a pointer system, in a file or folder to save space.
  • most of the compression algorithms work in basically this way. Some are more efficient or faster than others.
  • a compressed file cannot be accessed unless the archive is uncompressed.
  • a user In order to uncompress a file, a user needs to either use the same program used to compress the file, or use another program that is compatible with the particular compression format. That means that users are required to use standalone programs to compress and uncompress their files.
  • the same problem occurs when trying to work with and manipulate compressed archived files. For example, a user wanting to open an existing compressed file, modify the file, or extract data from the file and transfer it to another file would have to command a standalone program to uncompress the original file and command the standalone program to compress the modified file. This process is often burdensome and inconvenient to the user. Therefore, it would be beneficial to create a product that would eliminate the need for separate standalone compression programs, and eliminate the need to separately command a file to be uncompressed or compressed each time the file is opened, modified, or saved.
  • the archive is preferably in the format of a self-extracting .ZIP file.
  • the archive prefferably includes a rules-based form of intelligence to detect the presence of the appropriate files to be patched and to determine how the patching process should proceed.
  • a system for generating a patch file from an old version of electronic data which consists of a series of elements
  • a new version of electronic data which also consists of a series of elements.
  • Both the old and new versions of electronic data are stored in a memory of a computer, such as a server, in the system.
  • the old and new versions of electronic data are accessible by a data processor of the computer.
  • the alphabet for processing the old and new versions of electronic data is first programmed into the computer.
  • the alphabet consists of words of a desired size.
  • all sequences of three elements in each of the old and new versions of electronic data may be treated as a single word.
  • the old version of electronic data is sorted with the data processor alphabetically according to the established alphabet to create a first sorted list of data.
  • a pointer is maintained in the first sorted list of data in order to indicate each element's original location in the old version of electronic data.
  • the new version of electronic data is also sorted alphabetically to create a second sorted list of data with a pointer of each element to indicate the element's original location in the new version of electronic data.
  • the process of creating a patch file from the processed coincidences list includes the steps of (a) finding a largest block of coinciding elements of the processed coincidences list that matches the second sorted list of data and recording the location of the largest found segment in memory; (b) in the area before the previously found segment, finding the next largest block of coinciding elements of the processed coincidences list that matches the second sorted list of data and recording the location of the next largest segment in memory; (c) repeating step (b) until (1) the first member of the processed list of coincidences is reached, or (2) there are no matches between the second sorted list of data and the processed coincidences list; (d) writing a “write from the old version of electronic data” command and offset and length information to the patch file if the first member of the processed list of coincidences is reached; and (e) writing a “write from patch file” command and length and patch information to the patch file if there are no matches between the second sorted list of data and the processed list of coincidences.
  • the present invention also includes a process for combining, compressing, and signing the patch files for decreasing the storage and transfer requirements of the patch data.
  • the invention provides the ability for compressing patch files into a self-extracting .ZIP file with digital signatures, encryption, and authentication.
  • the present invention covers any type of data or file that may require revisions.
  • the compressed digitally signed patch files are incorporated into self-extracting executable files that are automatically extracted and decompressed upon execution.
  • multiple patch files are combined into a portable archive used to transfer a collection of patches more efficiently using compression, authentication and encryption.
  • the portable archive includes features to detect the presence of the files to be patched on a target system and then applies the sequence of patches automatically.
  • the invention provides a self-extracting .ZIP file with intelligence to determine if a patch is necessary and how the patch should be implemented.
  • the resulting deliverable of a portable compressed patch archive holds one or more patch files in a compressed form to decrease the storage and transfer requirements of the patch data.
  • the one or more patch files created will be aggregated into a secure, portable, compressed archive for distribution.
  • the self-extracting .ZIP file includes a rules-based form of intelligence to detect the presence of the appropriate files to be patched and to determine how the patching process should proceed. Additional functions include digital certificate based file authentication and encryption of the patch files.
  • the patch archive will include encryption and authentication using digital signatures to secure the contents from unauthorized access and to validate the identity of the creator of the archive.
  • the invention provides the ability to digitally sign archives using standard digital certificates from VeriSign, Tawes, Digital IDs or other digital certificate companies.
  • the invention also includes an authentication and encryption function, which allows a user to digitally sign and encrypt individual patch files archived in a .ZIP file and subsequently authenticate and decrypt those files upon extraction.
  • an authentication and encryption function which allows a user to digitally sign and encrypt individual patch files archived in a .ZIP file and subsequently authenticate and decrypt those files upon extraction.
  • Upon receiving a digitally signed .ZIP file one can detect whether the integrity of the ZIP file has been compromised. Encrypting a file denies access by unauthorized users to the file's contents.
  • FIG. 1 is a schematic diagram of a prior art server or host computer connected to a client or remote computer via a communications network.
  • FIG. 2 is a schematic diagram illustrating a prior art process of creating a patch file.
  • FIG. 3 is a more detailed schematic diagram of the server shown in FIG. 1 .
  • FIG. 4 is a schematic diagram of two exemplary files, an old version of electronic data, and a new version of electronic data.
  • FIG. 5 is a diagram showing the old and new versions of the electronic data organized into a list of alphabetical words (each word consisting of three symbols).
  • FIG. 6 is a diagram showing the old and new versions of electronic data sorted alphabetically in a list of three-symbol words.
  • FIG. 7 is a diagram illustrating the methodology for finding coincidences in the two sorted lists of electronic data shown in FIG. 6 .
  • FIG. 8 is a diagram of the list of coinciding words in the two sorted lists of data.
  • FIG. 9 is a list of coincidences where duplicative information has been removed.
  • FIG. 10 is a list of sorted non-duplicative coincidences.
  • FIG. 11 is a list of end block values.
  • FIG. 12 is a more detailed schematic diagram of the client shown in FIG. 1 .
  • FIG. 13 is a schematic diagram illustrating a process of creating a .ZIP patch file.
  • FIG. 14 is a schematic diagram illustrating a process of creating a self-extracting .ZIP patch file.
  • a conventional client-server computer system 15 is shown schematically in FIG. 1 .
  • the system 15 includes a server (or main computer) 17 .
  • the server 17 is coupled to a remote or client computer 19 .
  • the server 17 and client 19 are coupled to each other via a communications network 21 , which can be any available network, from a LAN (local area network) to the Internet, it being understood that the present invention is intended to be implemented using presently existing and well-known computer hardware and communications technology.
  • LAN local area network
  • FIG. 2 The general process of creating a patch file, in the broadest sense, is well known, and is shown in FIG. 2 .
  • An old version 23 of a computer program ( FIG. 2 ) and a new version 25 of a computer program are fed to a patch generator 27 .
  • the patch generator 27 creates a patch file 29 .
  • the patch file 29 may be transmitted over a communications network such as the communications network 21 to a client such as the client 19 ( FIG. 1 ).
  • the client on which a copy of the old version 23 of a computer program and a patch installer have been loaded, receives the patch file 29 .
  • the client uses the patch file 29 , patch installer, and the copy of the old version 23 of a computer program, the client creates a copy of the new version 25 of a computer program.
  • the server 17 has a processing unit 32 , input and output devices 34 , a memory 36 storing an old version 38 of electronic data, a new version 39 of electronic data, and a patch generator 40 which is used to create a patch file (discussed below).
  • the old version 38 of electronic data may be illustrated as a series of elements or symbols S (which, for the example shown, are English alphabetic symbols, but in actual files the elements would be bits of information, i.e., “1s and 0s”).
  • Each symbol S has a position P in the electronic data 38 and 39 indicated by the numbers 1-19.
  • each position P is an offset (in bytes) based on a single byte (the very left byte in a file is the first position).
  • an alphabet is developed where a series of symbols makes up a single word W. For purposes of explanation, three sequential symbols are considered to be a single word, although the number of symbols in a word can be changed.
  • the choice of word size affects the time it takes to generate a patch file as well as the size of the patch file. Using large words, patch files may be generated very quickly, but the resulting size of such files is relatively large. Using small words, patch files are generated relatively slowly, but are small in size.
  • FIG. 4 also illustrates a series of symbols that represent the new version of electronic data.
  • the old and new versions 38 and 39 of electronic data are the same length, but usually this is not the case, and it makes no difference whether it is or is not the case.
  • the patch generator 40 To create a patch file (discussed below), the patch generator 40 first processes the old and new versions 38 and 39 of electronic data into lists of three-symbol words as shown in FIG. 5 ; a first list 50 of words and a second list 52 of words. Next, the first list 50 of words (old version 38 of electronic data) is sorted alphabetically.
  • the first list 50 is sorted using the server 17 according to the established alphabet to create a first sorted list 55 of data with a pointer or offset P 1st ( FIG. 5 ) indicating the original location of each sorted word W in the old version 38 of electronic data.
  • the second list 52 of words (new version 29 of electronic data) is similarly sorted to create a second sorted list 57 of data with a pointer or offset P 2nd .
  • the patch generator 40 searches through each of the sorted lists recursively, comparing the first and second sorted lists of data one word at a time for a match of data. In particular, if the first word in the first sorted list 55 is less than (alphabetically) the first word in the second sorted list 57 , then the next word in the first sorted list is compared to the first word in the second sorted list. However, if the selected word in the first sorted list 55 is greater than the selected word in the second sorted list 57 , then the next word in the second sorted list is compared to the selected word in the first sorted list.
  • the coincidence is stored in a list of coincidences 60 ( FIG. 8 ).
  • the patch generator 40 searches the first and second sorted lists of data to find the largest sequence of coinciding symbols S preceding and succeeding the initial coincidence and this block of coinciding symbols is recorded in the list of coincidences 60 .
  • the list of coincidences 60 is then processed to remove duplicative coincidences or, more generally, duplicative information, indicated in the list by asterisks. The removal of duplicative information results in the creation of a refined list of coincidences 65 ( FIG. 9 ).
  • the coincidence is considered to contain duplicative information, and thus not included in the refined list of coincidences 65 .
  • the patch generator 40 can now generate a patch file 80 ( FIG. 3 ).
  • the patch file 80 is generated recursively based on the contents of the new version 39 of electronic data.
  • the patch generating algorithm is described below.
  • the patch generating algorithm may be incorporated into a procedure, which for purposes hereof may be called “BuildPatch.”
  • the BuildPatch procedure writes the contents of the (m, n) segment or block of symbols directly into the patch file 80 and subsequently terminates. If such a block is found, the BuildPatch procedure proceeds as follows:
  • the first step in the process is to call BuildPatch (1, 19).
  • BuildPatch searches for the block of symbols of maximum length by scanning the sorted list of coincidences 70 , which for the exemplary files given herein is the block containing the word BCA with offsets in both the old and new versions 38 and 39 of data from the 2nd to the 7th position P.
  • BuildPatch then calls itself: BuildPatch (1, 1).
  • BuildPatch (1, 1) takes the 1 st block and calculates its intersection with the parameters m and n. The length of this intersection is zero (2>1). Of course, there is also a zero length intersection when the (1, 1) block is intersected with the remaining blocks of symbols: (11>1, 13>1).
  • BuildPatch (1, 1) writes a “write from the patch file” (“WFPF”) command along with the (1, 1) block of the new version 39 of electronic data into the patch file 80 , since there are no common blocks with the old version 38 of electronic data within the range (1, 1) of the new version. BuildPatch (1, 1) then terminates.
  • WFPF write from the patch file
  • the BuildPatch (1, 1) call has terminated, the BuildPatch (1, 19) call has not and continues the operation according to the basic process set out above. Since the (2, 7) block of symbols in the new version 39 of electronic data coincides with the (2, 7) block of symbols from the old version 38 of electronic data, the call results in a WFOF command with the offsets for the (2, 7) block of the old version being written into the patch file 80 . Subsequently, BuildPatch (8, 19) is called.
  • BuildPatch (8, 19) projects the sorted list of coincidences 70 onto the block (8, 19) of the new version 39 of electronic data. This projection yields the following: Max Coincidence 3(BCD) 4(DCBA) Block Length Old File Offset 17 13 New File Offset 11 13
  • the (13, 16) block (which includes the symbols DCB) is the largest block, having a four-symbol length in the (8, 19) block.
  • the BuildPatch procedure calls BuildPatch (8, 12).
  • BuildPatch (8, 12) projects the sorted list of coincidences 70 onto the block (8, 12) of the new version 39 of electronic data, which yields the following: Max Coincidence 2 (not 3!) Block Length Old File Offset 17 New File Offset 11
  • BuildPatch calls BuildPatch (8, 10).
  • BuildPatch (8, 10) writes the block of symbols (8, 10) into the patch file 80 and returns control of the program to the up-calling procedure, BuildPatch (8, 12).
  • the BuildPatch (8, 12) call results in a WFOF command with the offsets for the (17, 18) block of the old version 38 of electronic data being written into the patch file 80 .
  • the symbols in the (17, 18) block will be written into the (11, 12) block of the new copy of the new version 85 of electronic data generated in the client 19 (see FIG. 12 ).
  • BuildPatch (8, 12) calls BuildPatch (13, 12).
  • BuildPatch (13, 12) does nothing and immediately terminates.
  • BuildPatch (8, 19) then writes a WFOF command into the patch file 80 with directions to write the symbols in the (13, 16) block of the old version 38 of electronic data into the (13, 16) block of the new copy of the new version 85 of electronic data.
  • WFPF “D” WFOF block (2, 7); WFPF “DDB”; WFOF block (17, 18); WFOF block (13, 16); WFPF “DCD”; end-of-patch command].
  • the patch file 80 is combined with a copy of the old version 84 of the electronic data on the client 19 ( FIG. 12 ) to create a new copy 85 of the new version 25 of the subject computer program using a patch installer 90 . Since the patch file 80 is, in fact, the same as the new version 25 of the computer program, but with all the coincidences replaced with corresponding references to the old version of a computer program, the patch installer 90 is a rather simple program and writing such a program would be within the ability of those skilled in the present art. For purposes of brevity, it is not discussed herein.
  • the present invention provides an improved method and system for creating a patch file.
  • the resulting patch file 92 may be compressed using a compression program 94 into a .ZIP patch file 96 using PKZIP or a self-extracting ZIP patch file 98 using PKSFX to yield a deliverable of a portable compressed patch file that allows for combining multiple patch files into a portable archive used to transfer the collection of patches more efficiently using compression, authentication and encryption.
  • the one or more patch files created will be aggregated into a secure, portable, compressed archive for distribution to files to be patched 100 .
  • This portable archive of files 96 , 98 also includes features to detect the presence of files to be patched on the target system and then applies the sequence of patches automatically using rules based intelligence 102 .
  • This archive may be in the format of a .ZIP file or a self-extracting .ZIP file, depending upon the compression algorithm used. The archive will hold the patch files in a compressed form to decrease the storage and transfer requirements of the patch data.
  • the .ZIP and self-extracting .ZIP patch files archive may also include functionality for encryption and authentication 104 of the files and/or archive using digital signatures to secure the contents from unauthorized access and to validate the identity of the creator of the archive.
  • the .ZIP patch file 96 and the self-extracting .ZIP patch file 98 may include a rules-based form of intelligence 102 to detect the presence of the appropriate files to be patched and to determine how the patching process should proceed.
  • the present invention provides the capability of compressing 94 the patch files 92 into .ZIP patch files 96 or self-extracting .ZIP patch files 98 including encryption and authentication 104 using digital signatures for combining, compressing, signing, and transporting the patch data.
  • the present invention also allows a user to digitally sign and encrypt individual patch files archived in a .ZIP file or a self-extracting .ZIP file, and subsequently to authenticate and decrypt those files upon extraction.
  • Signing a .ZIP patch file allows a user to detect whether a .ZIP patch file's integrity has been compromised. Encrypting a file denies access to the file's contents by unauthorized users. Before a user can sign or encrypt files, the user must first have a digital certificate with which to sign or encrypt. A digital certificate may be obtained from VeriSign, Thawte or another certificate authority.

Abstract

A system for generating a patch file from an old version of data which consists of a series of elements and a new version of data which also consists of a series of elements. The old version of data is sorted with a data processor alphabetically according to an established alphabet to create a first sorted list of data. A pointer is maintained in order to indicate each element's original location in the old version. Similarly, the new version of data is sorted alphabetically to create a second sorted list of data with a pointer of each element to indicate the element's original location in the new version. Once the two sorted lists are created, they are recursively compared one word (a group of elements) at a time to search for a match of data. Upon finding a match of data, the first and second sorted lists are searched to find the largest sequence of coinciding elements preceding and succeeding the match of data. Each sequence of coinciding words is then stored in a coincidences list. The coincidences list is processed to remove duplicative information and a patch file is created. Several patch files may then be aggregated into a secure, portable compressed archive to decrease the storage and transfer requirements of the patch file. The compressed archive uses an encryption process and may include an authentication process using digital signatures to secure the contents of the patch file from unauthorized access and to validate the identity of the creator of the archive. The archive is preferably in the format of a self-extracting .ZIP file, which file may include a rules-based form of intelligence to detect the presence of the appropriate files to be patched and to determine how the patching process should proceed.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS
  • This application is a continuation-in-part of U.S. application Ser. No. 09/144,666, filed Sep. 1, 1998.
  • BACKGROUND OF THE INVENTION
  • The present invention relates to a method and system for creating revisions of data files, and more particularly, to a system and method for creating patch files and aggregating them into secure, portable compressed archives for distribution. These archives are in a form that is applied to an original copy of the file to revise it (or patch it) to a newer version. The method of the invention includes the ability for combining, compressing, encrypting, authenticating and signing patch files. The present invention covers any type of data or file that may require revisions.
  • Software vendors are continually fixing, modifying, and enhancing the computer programs supplied to their customers. Typically, such changes are in response to bugs found in the programs, to the need for improved or more features, or a combination of both. In the past and still today, the predominant method of updating software and providing fixes is to supply customers a disc (e.g., floppy or CD-ROM) containing a complete new version of the program. Upon receipt of the upgrade disc, the customer installs the new version of the software on his or her computer. The installation process generally results in the old version of the program being overwritten with the new version. The same problems arise with fixing or modifying the contents of files or folders.
  • There are several problems with this method of supplying upgrades. First, it generally takes a relatively large amount of time to produce sufficient quantities of discs for distribution to customers. Accordingly, such discs are released only once or twice a year. This reduces the speed at which customers can be supplied with fixes to their programs and may force them to operate the software with errors or other bugs for several months. Second, physical discs are expensive to create and deliver.
  • Thus, there have been some attempts to deliver upgrades via communication networks such as the Internet or by direct connection using modems. However, even with ever improving transmission capacity and reliability, transmission of large upgrade files can be difficult and time consuming to complete. In response to the difficulties of transmitting large complete files, patch technology has been developed that permits the transmission of smaller, partial programs. In many instances, only certain parts or files need to be repaired or updated in order to update a computer program. Therefore, only a partial or “patch” file needs to be transmitted to the end user. Generally, small files may be transmitted faster and more reliably than larger files. However, existing patch technology is unacceptable when anything more than minor changes need to be delivered to a customer. Accordingly, there is a need for an improved method and system of upgrading electronic data, files or folders using patches. More specifically, there is a need for an improved system and method of generating a patch file.
  • In addition, most types of computer data or files are to some degree redundant, in that they contain patterns of characters that occur over and over again throughout the file. File compression programs take advantage of this fact. Instead of listing a piece of information over and over again, a file compression program lists that information once, then refers back to it wherever it appears in the original file, thus creating a representation of the original file that is smaller than the original, i.e. the compressed file. An expansion program expands a compressed file back into the original file. The present invention allows one to compress patch files into a .ZIP file and to extract patch files from a .ZIP file. The .ZIP file provides a folder, or archive, of compressed patch files and contains instructions and information needed to direct the patch files to be applied to the specific files to be patched. The files to be patched may, or may not, be contained in the same .ZIP file. The common format of this file is a self-extracting executable .ZIP file.
  • Compression of computer files has been around for years. Compressing files can save significant amounts of disk space or memory, and transfer time when downloading files from the Internet or transferring files through email. Most files downloaded from the Internet are compressed in some way. Many compression formats have been developed over the years. The zip format, created by the assignee of the present invention, is the most common compressed file format, but there are others in use today. Files with a “.ZIP” extension are compressed files in the zip format. Zip files are indicated by a “.ZIP” filename extension. Zipping a file means compressing the file into the zip format so that the resulting .ZIP file occupies less disk space. Unzipping a file means uncompressing a compressed file in the zip format back into its original form. A .ZIP file is a file which contains one or more computer files that have been compressed with PKZIP®, a data compression program from PKWare, Inc., or another compatible compression program.
  • PKZIP is a utility program that performs data compression and archiving. The file that PKZIP creates is called a “.ZIP” file. PKZIP can be used to exchange data files between different platforms or machines. PKSFX® is another data compression program from PKWare, Inc. The function of PKSFX® is to turn a .ZIP file into a self-extracting file with a .EXE file extension. A PKSFX file is an executable file that automatically extracts the files it contains when executed.
  • A computer file is compressed through the use of one or more compression algorithms. A compression algorithm is essentially a mathematical formula that scans the data in the file for compressible information. For example, compressible information may be any repeating pattern or string that can be represented in a shorter length than the original compressible information. The compression algorithm will then store only the repeated patterns, along with a pointer system, in a file or folder to save space. For standard compression, most of the compression algorithms work in basically this way. Some are more efficient or faster than others.
  • Generally, the contents of a compressed file cannot be accessed unless the archive is uncompressed. In order to uncompress a file, a user needs to either use the same program used to compress the file, or use another program that is compatible with the particular compression format. That means that users are required to use standalone programs to compress and uncompress their files. The same problem occurs when trying to work with and manipulate compressed archived files. For example, a user wanting to open an existing compressed file, modify the file, or extract data from the file and transfer it to another file would have to command a standalone program to uncompress the original file and command the standalone program to compress the modified file. This process is often burdensome and inconvenient to the user. Therefore, it would be beneficial to create a product that would eliminate the need for separate standalone compression programs, and eliminate the need to separately command a file to be uncompressed or compressed each time the file is opened, modified, or saved.
  • However, all of the above products are implemented differently from the present invention, and do not include many of the features of the present invention. Many of the above programs have increased performance overhead in processing (compressing/uncompressing) files continuously in and out, and it is often difficult for a user to determine if he or she is working with files contained inside or outside a .ZIP file.
  • Accordingly, there is a need for a system and method for easy management and manipulation of archive files, especially patch archive files.
  • SUMMARY OF THE INVENTION
  • Therefore, it is an object of the present invention to provide an improved method and system of revising electronic data files.
  • It is another object of the present invention to provide a file patch generator that efficiently produces patches of relatively small size.
  • It is yet another object of the present invention to aggregate one or more patch files into a secure, portable compressed archive (a .ZIP file) to decrease the storage and transfer requirements of the patch files. The archive is preferably in the format of a self-extracting .ZIP file.
  • It is a further object of the present invention to encrypt and authenticate the compressed patch files using digital signatures to secure the contents of the patch file from unauthorized access and to validate the identity of the creator of the .ZIP file.
  • It is yet a further object of the present invention for the archive to include a rules-based form of intelligence to detect the presence of the appropriate files to be patched and to determine how the patching process should proceed.
  • These and other objects are achieved in a system for generating a patch file from an old version of electronic data, which consists of a series of elements, and a new version of electronic data, which also consists of a series of elements. Both the old and new versions of electronic data are stored in a memory of a computer, such as a server, in the system. The old and new versions of electronic data are accessible by a data processor of the computer.
  • An alphabet for processing the old and new versions of electronic data is first programmed into the computer. The alphabet consists of words of a desired size. Thus, for example, all sequences of three elements in each of the old and new versions of electronic data may be treated as a single word.
  • Once the alphabet is established, the old version of electronic data is sorted with the data processor alphabetically according to the established alphabet to create a first sorted list of data. A pointer is maintained in the first sorted list of data in order to indicate each element's original location in the old version of electronic data. Similarly, the new version of electronic data is also sorted alphabetically to create a second sorted list of data with a pointer of each element to indicate the element's original location in the new version of electronic data. Once the two sorted lists are created, they are recursively compared one word at a time to search for a match of data. Upon finding a match of data, the first and second sorted lists of data are searched to find the largest sequence of coinciding elements preceding and succeeding the match of data. Each sequence of coinciding words is then stored in a coincidences list. The coincidences list is then processed to remove duplicative information. Finally, a patch file is created from the processed coincidences list.
  • The process of creating a patch file from the processed coincidences list includes the steps of (a) finding a largest block of coinciding elements of the processed coincidences list that matches the second sorted list of data and recording the location of the largest found segment in memory; (b) in the area before the previously found segment, finding the next largest block of coinciding elements of the processed coincidences list that matches the second sorted list of data and recording the location of the next largest segment in memory; (c) repeating step (b) until (1) the first member of the processed list of coincidences is reached, or (2) there are no matches between the second sorted list of data and the processed coincidences list; (d) writing a “write from the old version of electronic data” command and offset and length information to the patch file if the first member of the processed list of coincidences is reached; and (e) writing a “write from patch file” command and length and patch information to the patch file if there are no matches between the second sorted list of data and the processed list of coincidences.
  • The present invention also includes a process for combining, compressing, and signing the patch files for decreasing the storage and transfer requirements of the patch data. The invention provides the ability for compressing patch files into a self-extracting .ZIP file with digital signatures, encryption, and authentication. The present invention covers any type of data or file that may require revisions. The compressed digitally signed patch files are incorporated into self-extracting executable files that are automatically extracted and decompressed upon execution.
  • In another aspect of the invention, multiple patch files are combined into a portable archive used to transfer a collection of patches more efficiently using compression, authentication and encryption. The portable archive includes features to detect the presence of the files to be patched on a target system and then applies the sequence of patches automatically. In other words, the invention provides a self-extracting .ZIP file with intelligence to determine if a patch is necessary and how the patch should be implemented.
  • The resulting deliverable of a portable compressed patch archive holds one or more patch files in a compressed form to decrease the storage and transfer requirements of the patch data. The one or more patch files created will be aggregated into a secure, portable, compressed archive for distribution. The self-extracting .ZIP file includes a rules-based form of intelligence to detect the presence of the appropriate files to be patched and to determine how the patching process should proceed. Additional functions include digital certificate based file authentication and encryption of the patch files. The patch archive will include encryption and authentication using digital signatures to secure the contents from unauthorized access and to validate the identity of the creator of the archive.
  • The invention provides the ability to digitally sign archives using standard digital certificates from VeriSign, Tawes, Digital IDs or other digital certificate companies. The invention also includes an authentication and encryption function, which allows a user to digitally sign and encrypt individual patch files archived in a .ZIP file and subsequently authenticate and decrypt those files upon extraction. Upon receiving a digitally signed .ZIP file, one can detect whether the integrity of the ZIP file has been compromised. Encrypting a file denies access by unauthorized users to the file's contents.
  • Various other features, objects, and advantages of the invention will be made apparent to those skilled in the art from the following detailed description of the invention taken in combination with the accompanying drawings.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a schematic diagram of a prior art server or host computer connected to a client or remote computer via a communications network.
  • FIG. 2 is a schematic diagram illustrating a prior art process of creating a patch file.
  • FIG. 3 is a more detailed schematic diagram of the server shown in FIG. 1.
  • FIG. 4 is a schematic diagram of two exemplary files, an old version of electronic data, and a new version of electronic data.
  • FIG. 5 is a diagram showing the old and new versions of the electronic data organized into a list of alphabetical words (each word consisting of three symbols).
  • FIG. 6 is a diagram showing the old and new versions of electronic data sorted alphabetically in a list of three-symbol words.
  • FIG. 7 is a diagram illustrating the methodology for finding coincidences in the two sorted lists of electronic data shown in FIG. 6.
  • FIG. 8 is a diagram of the list of coinciding words in the two sorted lists of data.
  • FIG. 9 is a list of coincidences where duplicative information has been removed.
  • FIG. 10 is a list of sorted non-duplicative coincidences.
  • FIG. 11 is a list of end block values.
  • FIG. 12 is a more detailed schematic diagram of the client shown in FIG. 1.
  • FIG. 13 is a schematic diagram illustrating a process of creating a .ZIP patch file.
  • FIG. 14 is a schematic diagram illustrating a process of creating a self-extracting .ZIP patch file.
  • DESCRIPTION OF THE PREFERRED EMBODIMENTS
  • A conventional client-server computer system 15 is shown schematically in FIG. 1. The system 15 includes a server (or main computer) 17. The server 17 is coupled to a remote or client computer 19. The server 17 and client 19 are coupled to each other via a communications network 21, which can be any available network, from a LAN (local area network) to the Internet, it being understood that the present invention is intended to be implemented using presently existing and well-known computer hardware and communications technology. Of course, the inventor(s) envision(s) that the invention may also be implemented with equipment and technology not yet commercially available.
  • The general process of creating a patch file, in the broadest sense, is well known, and is shown in FIG. 2. An old version 23 of a computer program (FIG. 2) and a new version 25 of a computer program are fed to a patch generator 27. The patch generator 27 creates a patch file 29. The patch file 29 may be transmitted over a communications network such as the communications network 21 to a client such as the client 19 (FIG. 1). The client, on which a copy of the old version 23 of a computer program and a patch installer have been loaded, receives the patch file 29. Using the patch file 29, patch installer, and the copy of the old version 23 of a computer program, the client creates a copy of the new version 25 of a computer program.
  • As more readily seen by reference to FIG. 3, in the present invention the server 17 has a processing unit 32, input and output devices 34, a memory 36 storing an old version 38 of electronic data, a new version 39 of electronic data, and a patch generator 40 which is used to create a patch file (discussed below).
  • As best seen by reference to FIG. 4, the old version 38 of electronic data may be illustrated as a series of elements or symbols S (which, for the example shown, are English alphabetic symbols, but in actual files the elements would be bits of information, i.e., “1s and 0s”). Each symbol S has a position P in the electronic data 38 and 39 indicated by the numbers 1-19. In actual files, each position P is an offset (in bytes) based on a single byte (the very left byte in a file is the first position). Using the symbols S, an alphabet is developed where a series of symbols makes up a single word W. For purposes of explanation, three sequential symbols are considered to be a single word, although the number of symbols in a word can be changed. As will be better understood after further explanation below, the choice of word size affects the time it takes to generate a patch file as well as the size of the patch file. Using large words, patch files may be generated very quickly, but the resulting size of such files is relatively large. Using small words, patch files are generated relatively slowly, but are small in size.
  • It is presently thought that all sequences of 12 bytes following each other in a file should be treated as a single word in order to optimize time and size considerations. However, for purposes of discussion, the invention will be described with three-symbol words. By way of example, with three consecutive elements or symbols as a word, an initial sequence of “ABCDEF” yields four words W, namely: “ABC,” “BCD” (not “DEF”), “CDE,” and “DEF.” The words W are determined using a sliding window of length 3, moving it to the right, one symbol at a time, through the sequence of symbols.
  • FIG. 4 also illustrates a series of symbols that represent the new version of electronic data. (For the sake of simplicity, the old and new versions 38 and 39 of electronic data are the same length, but usually this is not the case, and it makes no difference whether it is or is not the case.) To create a patch file (discussed below), the patch generator 40 first processes the old and new versions 38 and 39 of electronic data into lists of three-symbol words as shown in FIG. 5; a first list 50 of words and a second list 52 of words. Next, the first list 50 of words (old version 38 of electronic data) is sorted alphabetically. Specifically, the first list 50 is sorted using the server 17 according to the established alphabet to create a first sorted list 55 of data with a pointer or offset P1st (FIG. 5) indicating the original location of each sorted word W in the old version 38 of electronic data. The second list 52 of words (new version 29 of electronic data) is similarly sorted to create a second sorted list 57 of data with a pointer or offset P2nd.
  • As best seen by reference to FIG. 7, once the first and second sorted lists 55 and 57 of data are generated, the patch generator 40 searches through each of the sorted lists recursively, comparing the first and second sorted lists of data one word at a time for a match of data. In particular, if the first word in the first sorted list 55 is less than (alphabetically) the first word in the second sorted list 57, then the next word in the first sorted list is compared to the first word in the second sorted list. However, if the selected word in the first sorted list 55 is greater than the selected word in the second sorted list 57, then the next word in the second sorted list is compared to the selected word in the first sorted list.
  • If a match or coincidence in the first and second sorted lists 55 and 57 of data is found, the coincidence is stored in a list of coincidences 60 (FIG. 8). Upon finding a coincidence, the patch generator 40 also searches the first and second sorted lists of data to find the largest sequence of coinciding symbols S preceding and succeeding the initial coincidence and this block of coinciding symbols is recorded in the list of coincidences 60. The list of coincidences 60 is then processed to remove duplicative coincidences or, more generally, duplicative information, indicated in the list by asterisks. The removal of duplicative information results in the creation of a refined list of coincidences 65 (FIG. 9). In short, if two equivalent words W are found (i.e., a coincidence) and the symbols preceding the coincidence in the first and second sorted lists of data 55 and 57 are the same, the coincidence is considered to contain duplicative information, and thus not included in the refined list of coincidences 65.
  • Once the refined list of coincidences 65 is generated, additional information is obtained by sorting the refined list of coincidences 65 by the offset or position in the new version of electronic data of each non-duplicative coincidence, resulting in a sorted list of coincidences 70 (FIG. 10). By adding the position or offset of each coincidence in the new version 39 of electronic data to the maximum coincidence length (measured in the number of elements or symbols S) an end block list 75 (FIG. 11) is obtained which provides a means of calculating the intersections between the elements or symbols of the new version of electronic data 39 and the refined list of coincidences 65.
  • Having generated the sorted list of coincidences 70 and end block list 75, the patch generator 40 can now generate a patch file 80 (FIG. 3). In the present invention the patch file 80 is generated recursively based on the contents of the new version 39 of electronic data. The patch generating algorithm is described below.
  • The patch generating algorithm may be incorporated into a procedure, which for purposes hereof may be called “BuildPatch.” The procedure call BuildPatch (m, n) is made where m and n are parameters representing the starting and the ending offsets in the new version 39 of electronic data, respectively. If m>n, then the BuildPatch procedure terminates. If m<=n, then the procedure searches for the largest coincidence or block of symbols of the maximum length within the segment range (m, n) using the sorted list of coincidences 70. More specifically, the BuildPatch procedure searches for a block of symbols in the new version of electronic data 39 having a starting position i and an ending position j such that m<=i<=j<=n. If such a block of symbols does not exist in the sorted list of coincidences 70, the BuildPatch procedure writes the contents of the (m, n) segment or block of symbols directly into the patch file 80 and subsequently terminates. If such a block is found, the BuildPatch procedure proceeds as follows:
  • (1) call BuildPatch (m, i−1);
  • (2) replace the (i, j) block with a corresponding reference to the old version 38 of electronic data. More specifically, the procedure writes a “write from the old file” (“WFOF”) command in the patch file 80 which indicates the data from the old version 38 of electronic data to be used, by means of its offset or location and length within the old version. Then,
  • (3) call BuildPatch (j+1, n).
  • Considering the specific example in FIGS. 4-11, the first step in the process is to call BuildPatch (1, 19). BuildPatch then searches for the block of symbols of maximum length by scanning the sorted list of coincidences 70, which for the exemplary files given herein is the block containing the word BCA with offsets in both the old and new versions 38 and 39 of data from the 2nd to the 7th position P. BuildPatch then calls itself: BuildPatch (1, 1). BuildPatch (1, 1) takes the 1 st block and calculates its intersection with the parameters m and n. The length of this intersection is zero (2>1). Of course, there is also a zero length intersection when the (1, 1) block is intersected with the remaining blocks of symbols: (11>1, 13>1). Finally, BuildPatch (1, 1) writes a “write from the patch file” (“WFPF”) command along with the (1, 1) block of the new version 39 of electronic data into the patch file 80, since there are no common blocks with the old version 38 of electronic data within the range (1, 1) of the new version. BuildPatch (1, 1) then terminates.
  • Although the BuildPatch (1, 1) call has terminated, the BuildPatch (1, 19) call has not and continues the operation according to the basic process set out above. Since the (2, 7) block of symbols in the new version 39 of electronic data coincides with the (2, 7) block of symbols from the old version 38 of electronic data, the call results in a WFOF command with the offsets for the (2, 7) block of the old version being written into the patch file 80. Subsequently, BuildPatch (8, 19) is called.
  • BuildPatch (8, 19) projects the sorted list of coincidences 70 onto the block (8, 19) of the new version 39 of electronic data. This projection yields the following:
    Max Coincidence 3(BCD) 4(DCBA)
    Block Length
    Old File Offset 17 13
    New File Offset 11 13
  • The (13, 16) block (which includes the symbols DCB) is the largest block, having a four-symbol length in the (8, 19) block. Following the process noted, the BuildPatch procedure then calls BuildPatch (8, 12). BuildPatch (8, 12) projects the sorted list of coincidences 70 onto the block (8, 12) of the new version 39 of electronic data, which yields the following:
    Max Coincidence 2 (not 3!)
    Block Length
    Old File Offset 17
    New File Offset 11
  • Bear in mind the projection is limited to the (8, 12) block of the new version 39 and, thus, it is not possible to find the 3 symbol coincidence BBD which exists in the block (8, 13).
  • Since the last coincidence was found, BuildPatch calls BuildPatch (8, 10). BuildPatch (8, 10) writes the block of symbols (8, 10) into the patch file 80 and returns control of the program to the up-calling procedure, BuildPatch (8, 12).
  • The BuildPatch (8, 12) call results in a WFOF command with the offsets for the (17, 18) block of the old version 38 of electronic data being written into the patch file 80. The symbols in the (17, 18) block will be written into the (11, 12) block of the new copy of the new version 85 of electronic data generated in the client 19 (see FIG. 12). Then, BuildPatch (8, 12) calls BuildPatch (13, 12). BuildPatch (13, 12) does nothing and immediately terminates. BuildPatch (8, 19) then writes a WFOF command into the patch file 80 with directions to write the symbols in the (13, 16) block of the old version 38 of electronic data into the (13, 16) block of the new copy of the new version 85 of electronic data. BuildPatch (8, 19) then calls BuildPatch (17, 19). BuildPatch (17, 19) writes the (17, 19) block of data symbols in the patch file 80 and terminates. Then BuildPatch (8, 19) terminates. Finally, BuildPatch (1, 19) terminates too. Following through the above process, the file structure of the patch file 80 is as follows:
  • [WFPF “D”; WFOF block (2, 7); WFPF “DDB”; WFOF block (17, 18); WFOF block (13, 16); WFPF “DCD”; end-of-patch command].
  • The patch file 80 is combined with a copy of the old version 84 of the electronic data on the client 19 (FIG. 12) to create a new copy 85 of the new version 25 of the subject computer program using a patch installer 90. Since the patch file 80 is, in fact, the same as the new version 25 of the computer program, but with all the coincidences replaced with corresponding references to the old version of a computer program, the patch installer 90 is a rather simple program and writing such a program would be within the ability of those skilled in the present art. For purposes of brevity, it is not discussed herein.
  • As shown in FIGS. 13 and 14, the present invention provides an improved method and system for creating a patch file. The resulting patch file 92 may be compressed using a compression program 94 into a .ZIP patch file 96 using PKZIP or a self-extracting ZIP patch file 98 using PKSFX to yield a deliverable of a portable compressed patch file that allows for combining multiple patch files into a portable archive used to transfer the collection of patches more efficiently using compression, authentication and encryption. The one or more patch files created will be aggregated into a secure, portable, compressed archive for distribution to files to be patched 100. This portable archive of files 96, 98 also includes features to detect the presence of files to be patched on the target system and then applies the sequence of patches automatically using rules based intelligence 102. This archive may be in the format of a .ZIP file or a self-extracting .ZIP file, depending upon the compression algorithm used. The archive will hold the patch files in a compressed form to decrease the storage and transfer requirements of the patch data. The .ZIP and self-extracting .ZIP patch files archive may also include functionality for encryption and authentication 104 of the files and/or archive using digital signatures to secure the contents from unauthorized access and to validate the identity of the creator of the archive.
  • As mentioned above, the .ZIP patch file 96 and the self-extracting .ZIP patch file 98 may include a rules-based form of intelligence 102 to detect the presence of the appropriate files to be patched and to determine how the patching process should proceed.
  • Also as mentioned above, the present invention provides the capability of compressing 94 the patch files 92 into .ZIP patch files 96 or self-extracting .ZIP patch files 98 including encryption and authentication 104 using digital signatures for combining, compressing, signing, and transporting the patch data. The present invention also allows a user to digitally sign and encrypt individual patch files archived in a .ZIP file or a self-extracting .ZIP file, and subsequently to authenticate and decrypt those files upon extraction. Signing a .ZIP patch file allows a user to detect whether a .ZIP patch file's integrity has been compromised. Encrypting a file denies access to the file's contents by unauthorized users. Before a user can sign or encrypt files, the user must first have a digital certificate with which to sign or encrypt. A digital certificate may be obtained from VeriSign, Thawte or another certificate authority.
  • While the invention has been described with reference to preferred embodiments, it is to be understood that the invention is not confined to those embodiments or the particular examples and arrangement of the components herein illustrated and described, but embraces such modified forms thereof as come within the scope of the appended claims. In other words, those skilled in the art will appreciate that certain substitutions, alterations and omissions may be made without departing from the spirit of the invention. Accordingly, the foregoing description is meant to be exemplary only, and should not limit the scope of the invention set forth in the following claims.

Claims (20)

1. A method of generating a patch file from an old version of data consisting of a series of elements and a new version of data consisting of a series of elements where both the old and new versions of data are stored in a memory and accessible by a data processor, the method comprising the steps of:
establishing an alphabet comprising a plurality of letters for processing the old and new versions of data wherein a word consists of a series of elements represented by one or more letters of the alphabet;
sorting the old version of data with the data processor alphabetically according to the established alphabet to create a first sorted list of words and maintaining a pointer for each element of the first sorted list of words indicating the element's original location in the old version of data;
sorting the new version of data with the data processor alphabetically according to the established alphabet to create a second sorted list of words and maintaining a pointer for each element of the second sorted list of words indicating the element's original location in the new version of data;
recursively comparing the first and second sorted lists of words one word at a time for a match of the words;
upon finding a match of the words, searching the first and second sorted lists of words again to find the largest sequence of coinciding elements preceding and succeeding the match of words;
storing the largest sequence of coinciding elements in a coincidences list;
processing the coincidences list to remove duplicative coincidences, creating a refined list of coincidences;
sorting the refined list of coincidences by pointer in the new version data, creating a sorted list of coincidences;
adding the pointer of each coincidence in the new version data to the largest sequence of coinciding elements, creating an end block list;
creating a patch file from the sorted coincidences list and the end block list; and
compressing the patch file into a secure, portable compressed archive for distribution.
2. The method of claim 1 wherein the patch file includes a series of write commands.
3. The method of claim 2 wherein creating a patch file from the sorted coincidences list and end block list includes the steps of:
(a) finding a largest block of coinciding elements of the sorted coincidences list that matches the second sorted list of words and recording the location of the largest found block;
(b) in the area before the previously found block, finding the next largest block of coinciding elements of the sorted coincidences list that matches the second sorted list of words and recording the location of the next largest found block;
(c) repeating step (b) until
(i) the first member in the sorted list of coincidences is reached; or
(ii) there are no matches between the second sorted list of words and the sorted coincidences list;
(d) writing a write from the old version of data command and pointer and length information to the patch file if the first member of the sorted list of coincidences is reached; and
(e) writing a write from patch file command and length and patch information to the patch file when there is no match between the second sorted list of data and the sorted coincidences list.
4. The method of claim 1 wherein one or more patch files are compressed into the .ZIP file format to decrease the storage and transfer requirements of the patch files.
5. The method of claim 1 wherein the .ZIP file further includes encryption and authentication using digital signatures to secure the contents of the patch files from unauthorized access and to validate the identity of the creator of the archive.
6. The method of claim 1 wherein the .ZIP file is in the format of a self-extracting .ZIP file.
7. The method of claim 6 wherein the self-extracting .ZIP file includes a rules-based form of intelligence to detect the presence of the appropriate files to be patched and to determine how the patching process should proceed.
8. A system for generating a patch file from an old version of data consisting of a series of elements and a new version of data consisting of a series of elements, the system comprising:
a data processor;
a memory storing the old and new versions of data;
means for sorting the old version of data with the data processor alphabetically according to an established alphabet to create a first sorted list of data and for maintaining a pointer for each element of the first sorted list of data indicating the element's original location in the old version of data;
means for sorting the new version of data with the data processor alphabetically according to an established alphabet to create a second sorted list of data and for maintaining a pointer for each element of the second sorted list of data indicating the element's original location in the new version of data;
means for searching the first and second sorted lists of data to find a match of data;
means for storing the match of data as a sequence of coinciding elements in a coincidences list;
upon finding a match of data, means for searching the first and second sorted lists of data again to find the largest sequence of coinciding elements preceding and succeeding the match of data;
means for storing the largest sequence of coinciding elements in the coincidences list;
means for processing the coincidences list to remove duplicative coincidences, creating a refined list of coincidences;
means for sorting the refined list of coincidences by pointer in the new version of data, creating a sorted list of coincidences;
means for adding the pointer of each coincidence in the new version of data to the largest sequence of coinciding elements, creating an end block list;
means for creating a patch file from the sorted coincidences list and end block list; and
means for compressing the patch file into a secure, portable compressed archive for distribution.
9. The system of claim 8 wherein the means for creating a patch file includes:
means for finding the largest block of coinciding elements of the sorted coincidences list that matches the second sorted list of data and recording the location of the largest found block of coinciding elements in a memory;
means for finding the next largest block of coinciding elements of the sorted coincidences list that matches the second sorted list of data and recording the location of the next largest block of coinciding elements in the memory;
means for writing a write form the old version of data command and pointer and length information to the patch file; and
means for writing a write from patch file command and length and patch information to the patch file.
10. The system of claim 8 wherein one or more patch files are compressed into the .ZIP file format to decrease the storage and transfer requirements of the patch files.
11. The system of claim 8 wherein the .ZIP file further includes encryption and authentication using digital signatures to secure the contents of the patch files from unauthorized access and to validate the identity of the creator of the archive.
12. The system of claim 8 wherein the .ZIP file is in the format of a self-extracting .ZIP file.
13. The system of claim 12 wherein the self-extracting .ZIP file includes a rules-based form of intelligence to detect the presence of the appropriate files to be patched and to determine how the patching process should proceed.
14. A method of creating one or more patch files and aggregating the patch files into a secure, portable compressed archive for distribution.
15. The method of claim 14 wherein the archive includes one or more patch files in a compressed form to decrease the storage and transfer requirements of the patch files.
16. The method of claim 14 wherein the archive further includes encryption and authentication using digital signatures to secure the contents of the patch files from unauthorized access and to validate the identity of the creator of the archive.
17. The method of claim 14 wherein the archive is in the format of a self-extracting .ZIP file.
18. The method of claim 17 wherein the self-extracting ZIP file includes a rules-based form of intelligence to detect the presence of the appropriate files to be patched and to determine how the patching process should proceed.
19. A system for managing and manipulating patch files comprising:
a program for compressing, extracting, encrypting and decrypting patch files into a secure, portable compressed archive.
20. The system of claim 19 wherein the program provides the ability to digitally sign the patch files as they are compressed.
US11/209,095 1998-09-01 2005-08-22 Software patch generator Abandoned US20060136514A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US11/209,095 US20060136514A1 (en) 1998-09-01 2005-08-22 Software patch generator

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US09/144,666 US6289509B1 (en) 1998-09-01 1998-09-01 Software patch generator
US09/940,771 US6952823B2 (en) 1998-09-01 2001-08-27 Software patch generator using compression techniques
US11/209,095 US20060136514A1 (en) 1998-09-01 2005-08-22 Software patch generator

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US09/940,771 Continuation US6952823B2 (en) 1998-09-01 2001-08-27 Software patch generator using compression techniques

Publications (1)

Publication Number Publication Date
US20060136514A1 true US20060136514A1 (en) 2006-06-22

Family

ID=25475393

Family Applications (2)

Application Number Title Priority Date Filing Date
US09/940,771 Expired - Lifetime US6952823B2 (en) 1998-09-01 2001-08-27 Software patch generator using compression techniques
US11/209,095 Abandoned US20060136514A1 (en) 1998-09-01 2005-08-22 Software patch generator

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US09/940,771 Expired - Lifetime US6952823B2 (en) 1998-09-01 2001-08-27 Software patch generator using compression techniques

Country Status (6)

Country Link
US (2) US6952823B2 (en)
EP (1) EP1333375B1 (en)
AT (1) ATE430959T1 (en)
AU (1) AU2002300771B2 (en)
CA (1) CA2399891C (en)
DE (1) DE60232221D1 (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050223292A1 (en) * 2004-02-17 2005-10-06 Lee Chee S Single instruction type based hardware patch controller
WO2008065341A2 (en) 2006-12-01 2008-06-05 David Irvine Distributed network system
US20090183145A1 (en) * 2008-01-10 2009-07-16 Wei-Ming Hu Techniques for reducing down time in updating applications with metadata
US20100058054A1 (en) * 2006-12-01 2010-03-04 David Irvine Mssan
US20110035360A1 (en) * 2000-10-26 2011-02-10 Reynolds Mark L Tools and techniques for original digital files
US20110138374A1 (en) * 2009-12-09 2011-06-09 Suprio Pal Downtime reduction for enterprise manager patching
US10241813B2 (en) * 2012-09-12 2019-03-26 International Business Machines Corporation Method and apparatus for patching

Families Citing this family (76)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050015608A1 (en) 2003-07-16 2005-01-20 Pkware, Inc. Method for strongly encrypting .ZIP files
US6879988B2 (en) * 2000-03-09 2005-04-12 Pkware System and method for manipulating and managing computer archive files
US8959582B2 (en) 2000-03-09 2015-02-17 Pkware, Inc. System and method for manipulating and managing computer archive files
US7409685B2 (en) 2002-04-12 2008-08-05 Hewlett-Packard Development Company, L.P. Initialization and update of software and/or firmware in electronic devices
US8479189B2 (en) 2000-11-17 2013-07-02 Hewlett-Packard Development Company, L.P. Pattern detection preprocessor in an electronic device update generation system
US20020157010A1 (en) * 2001-04-24 2002-10-24 International Business Machines Corporation Secure system and method for updating a protected partition of a hard drive
EP2597811B1 (en) * 2001-08-15 2019-10-09 Bentley Systems, Incorporated Method and system for storing large data files
JP2003256228A (en) * 2002-02-28 2003-09-10 Denso Corp Program rewriting device
US7984435B2 (en) * 2002-11-13 2011-07-19 Hewlett-Packard Development Company, L.P. Update system employing reference software to reduce number of update packages
US7440571B2 (en) * 2002-12-03 2008-10-21 Nagravision S.A. Method for securing software updates
US7174535B2 (en) * 2003-03-05 2007-02-06 Siemens Communications, Inc. Build and install for software applications
US7484096B1 (en) 2003-05-28 2009-01-27 Microsoft Corporation Data validation using signatures and sampling
US7457791B1 (en) 2003-05-30 2008-11-25 Microsoft Corporation Using invariants to validate applications states
US7676506B2 (en) * 2003-06-20 2010-03-09 Innopath Software, Inc. Differential file compression of software image versions
US7890464B2 (en) * 2003-06-20 2011-02-15 Innopath Software, Inc. Processing software images and generating difference files
US7886093B1 (en) * 2003-07-31 2011-02-08 Hewlett-Packard Development Company, L.P. Electronic device network supporting compression and decompression in electronic devices
US8555273B1 (en) 2003-09-17 2013-10-08 Palm. Inc. Network for updating electronic devices
US7509635B2 (en) * 2003-09-26 2009-03-24 Red Hat, Inc. Software and data file updating process
JP2007515092A (en) * 2003-12-18 2007-06-07 松下電器産業株式会社 Program data file storage method and authentication program execution method
US7555531B2 (en) * 2004-04-15 2009-06-30 Microsoft Corporation Efficient algorithm and protocol for remote differential compression
US20060047855A1 (en) * 2004-05-13 2006-03-02 Microsoft Corporation Efficient chunking algorithm
US7904895B1 (en) 2004-04-21 2011-03-08 Hewlett-Packard Develpment Company, L.P. Firmware update in electronic devices employing update agent in a flash memory card
US7890946B2 (en) * 2004-05-11 2011-02-15 Microsoft Corporation Efficient patching
US7559058B2 (en) 2004-05-11 2009-07-07 Microsoft Corporation Efficient patching
US8539469B2 (en) * 2004-05-11 2013-09-17 Microsoft Corporation Efficient patching
CN1696910B (en) * 2004-05-11 2013-09-18 微软公司 Efficient software patching method and system
US20050256974A1 (en) * 2004-05-13 2005-11-17 Microsoft Corporation Efficient algorithm and protocol for remote differential compression on a remote device
US20050262167A1 (en) * 2004-05-13 2005-11-24 Microsoft Corporation Efficient algorithm and protocol for remote differential compression on a local device
US20060218196A1 (en) * 2004-06-14 2006-09-28 Taro Kurita Information management device and information management method
US7082447B2 (en) * 2004-06-16 2006-07-25 Hitachi, Ltd. Method and apparatus for archive data validation in an archive system
US7206790B2 (en) * 2004-07-13 2007-04-17 Hitachi, Ltd. Data management system
US20060020594A1 (en) * 2004-07-21 2006-01-26 Microsoft Corporation Hierarchical drift detection of data sets
US8526940B1 (en) 2004-08-17 2013-09-03 Palm, Inc. Centralized rules repository for smart phone customer care
EP1632848A1 (en) * 2004-09-06 2006-03-08 Irdeto Access B.V. Method of providing patches for software
US7613787B2 (en) * 2004-09-24 2009-11-03 Microsoft Corporation Efficient algorithm for finding candidate objects for remote differential compression
WO2006058220A2 (en) * 2004-11-24 2006-06-01 Interdigital Technology Corporation Protecting content objects with rights management information
US20060172762A1 (en) * 2004-11-24 2006-08-03 Interdigital Technology Corporation Network assisted repudiation and auditing for content created using wireless devices
US20060122967A1 (en) * 2004-11-24 2006-06-08 Interdigital Technology Corporation Intelligent information dissemination using a dynamic user profile
US20070094348A1 (en) * 2005-01-07 2007-04-26 Microsoft Corporation BITS/RDC integration and BITS enhancements
US7849462B2 (en) * 2005-01-07 2010-12-07 Microsoft Corporation Image server
US8073926B2 (en) * 2005-01-07 2011-12-06 Microsoft Corporation Virtual machine image server
EP1808764B1 (en) * 2005-12-20 2010-12-15 TELEFONAKTIEBOLAGET LM ERICSSON (publ) Generating incremental program updates
WO2007117514A1 (en) * 2006-03-31 2007-10-18 Hewlett-Packard Company Mobile device capable of multiple updates
US8578363B2 (en) * 2006-05-03 2013-11-05 Microsoft Corporation Differentiated installable packages
EP2025095A2 (en) 2006-06-08 2009-02-18 Hewlett-Packard Development Company, L.P. Device management in a network
JP2009536395A (en) * 2006-06-19 2009-10-08 サムスン エレクトロニクス カンパニー リミテッド Information upgrade system and method of OTA-capable terminal {INFORMATIONUPGRADESYSTEMSYSTEMMETHODFORMATA-CAPABLEDEVICE}
US7636728B2 (en) * 2006-06-22 2009-12-22 Microsoft Corporation Media difference files for compressed catalog files
KR101426710B1 (en) * 2006-07-14 2014-09-23 삼성전자주식회사 Device and method for upgrading version information of terminal
US8752044B2 (en) 2006-07-27 2014-06-10 Qualcomm Incorporated User experience and dependency management in a mobile device
US8171469B2 (en) 2006-08-15 2012-05-01 Hewlett-Packard Development Company, L.P. Package compatibility
US8533820B2 (en) * 2006-12-12 2013-09-10 International Business Machines Corporation Reserved write positions on install media
EP1956482B1 (en) * 2007-02-09 2011-08-17 Telefonaktiebolaget LM Ericsson Generating delta updates for a processing device
US8438558B1 (en) 2009-03-27 2013-05-07 Google Inc. System and method of updating programs and data
CN102023870B (en) * 2010-12-31 2013-07-24 深圳市普联技术有限公司 Detection method and device for software modification as well as electronic equipment
US9244673B2 (en) * 2012-06-08 2016-01-26 Apple Inc. System and method for updating application archive files
US20130346379A1 (en) * 2012-06-22 2013-12-26 W. Andrew Loe Streaming dynamically-generated zip archive files
CN103942200B (en) * 2013-01-18 2017-08-18 佳能株式会社 Ordered list matching process and equipment, document character matching process and equipment
US20140359605A1 (en) * 2013-05-30 2014-12-04 Microsoft Corporation Bundle package signing
US9323514B2 (en) 2013-05-30 2016-04-26 Microsoft Technology Licensing, Llc Resource package indexing
CN103605546B (en) * 2013-11-22 2017-02-01 中国广核集团有限公司 Software version detecting method and device
CN105205118A (en) * 2015-09-10 2015-12-30 邯郸职业技术学院 Image file synchronization method based on file partition
JP6609199B2 (en) * 2016-03-01 2019-11-20 ルネサスエレクトロニクス株式会社 Embedded equipment
US20170277517A1 (en) * 2016-03-22 2017-09-28 M2Communication Inc. Method Of Updating Program Code And Electronic Device Using The Same
DE102016115792A1 (en) * 2016-08-25 2018-03-01 Visteon Global Technologies, Inc. Method for transmitting a difference file
US10552140B2 (en) * 2018-01-31 2020-02-04 Oracle International Corporation Automated identification of deployment data for distributing discrete software deliverables
CN111046389A (en) * 2018-10-11 2020-04-21 东硕资讯股份有限公司 Method for securely updating firmware components and portable computer station for implementation
US10956661B2 (en) * 2019-05-24 2021-03-23 International Business Machines Corporation Consistency enforcement in multi-author documents
US11544050B1 (en) 2019-07-18 2023-01-03 Amazon Technologies, Inc. Software patch automation
US11449325B2 (en) 2019-07-30 2022-09-20 Sony Interactive Entertainment LLC Data change detection using variable-sized data chunks
US11262927B2 (en) 2019-07-30 2022-03-01 Sony Interactive Entertainment LLC Update optimization using feedback on probability of change for regions of data
US11307841B2 (en) * 2019-07-30 2022-04-19 Sony Interactive Entertainment LLC Application patching using variable-sized units
KR102088164B1 (en) * 2019-08-27 2020-03-12 루나 주식회사 Method and apparatus for generating difference between old and new version of data for updating software
CN110851169B (en) * 2020-01-16 2020-04-21 武汉斗鱼鱼乐网络科技有限公司 Method, system, medium and electronic device for updating patch information
US11507355B2 (en) * 2020-07-20 2022-11-22 International Business Machines Corporation Enforcement of signatures for software deployment configuration
CN113721967A (en) * 2021-08-30 2021-11-30 苏州磐联集成电路科技股份有限公司 Differential packet generation method, differential packet generation device, and upgrade method
US20230176837A1 (en) * 2021-12-07 2023-06-08 Dell Products L.P. Automated generation of additional versions of microservices

Citations (98)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US502258A (en) * 1893-07-25 Die for rolling screw-threads
US4041284A (en) * 1976-09-07 1977-08-09 The United States Of America As Represented By The Secretary Of The Navy Signal processing devices using residue class arithmetic
US4156922A (en) * 1977-02-01 1979-05-29 Instytut Maszyn Matematyeznych Digital system for computation of the values of composite arithmetic expressions
US4377846A (en) * 1979-10-08 1983-03-22 Hitachi, Ltd. Arithmetic unit for generating constants in an electronic computer of the microprogram-controlled type
US4521866A (en) * 1980-08-27 1985-06-04 Petit Jean P Distributed arithmetic oversampling recursive digital filter
US4862167A (en) * 1987-02-24 1989-08-29 Hayes Microcomputer Products, Inc. Adaptive data compression method and apparatus
US4891643A (en) * 1986-09-15 1990-01-02 International Business Machines Corporation Arithmetic coding data compression/de-compression by selectively employed, diverse arithmetic coding encoders and decoders
US4905297A (en) * 1986-09-15 1990-02-27 International Business Machines Corporation Arithmetic coding encoder and decoder system
US4933883A (en) * 1985-12-04 1990-06-12 International Business Machines Corporation Probability adaptation for arithmetic coders
US4935882A (en) * 1986-09-15 1990-06-19 International Business Machines Corporation Probability adaptation for arithmetic coders
US4939639A (en) * 1987-06-11 1990-07-03 Northern Telecom Limited Method of facilitating computer sorting
US4989000A (en) * 1988-07-05 1991-01-29 Chevion Dan S Data string compression using arithmetic encoding with simplified probability subinterval estimation
US5003307A (en) * 1989-01-13 1991-03-26 Stac, Inc. Data compression apparatus with shift register search means
US5016009A (en) * 1989-01-13 1991-05-14 Stac, Inc. Data compression apparatus and method
US5091955A (en) * 1989-06-29 1992-02-25 Fujitsu Limited Voice coding/decoding system having selected coders and entropy coders
US5099440A (en) * 1985-12-04 1992-03-24 International Business Machines Corporation Probability adaptation for arithmetic coders
US5126739A (en) * 1989-01-13 1992-06-30 Stac Electronics Data compression apparatus and method
US5142283A (en) * 1989-07-28 1992-08-25 International Business Machines Corporation Arithmetic compression coding using interpolation for ambiguous symbols
US5179555A (en) * 1990-09-11 1993-01-12 Microcom Systems, Inc. High speed data compression and transmission for wide area network connections in LAN/bridging applications
US5218700A (en) * 1990-01-30 1993-06-08 Allen Beechick Apparatus and method for sorting a list of items
US5298896A (en) * 1993-03-15 1994-03-29 Bell Communications Research, Inc. Method and system for high order conditional entropy coding
US5404315A (en) * 1991-04-30 1995-04-04 Sharp Kabushiki Kaisha Automatic sound gain control device and a sound recording/reproducing device including arithmetic processor conducting a non-linear conversion
US5414425A (en) * 1989-01-13 1995-05-09 Stac Data compression apparatus and method
US5440504A (en) * 1993-02-19 1995-08-08 Matsushita Electric Industrial Co., Ltd. Arithmetic apparatus for digital signal processor
US5481713A (en) * 1993-05-06 1996-01-02 Apple Computer, Inc. Method and apparatus for patching code residing on a read only memory device
US5485411A (en) * 1993-11-30 1996-01-16 Texas Instruments Incorporated Three input arithmetic logic unit forming the sum of a first input anded with a first boolean combination of a second input and a third input plus a second boolean combination of the second and third inputs
US5493524A (en) * 1993-11-30 1996-02-20 Texas Instruments Incorporated Three input arithmetic logic unit employing carry propagate logic
US5517439A (en) * 1994-02-14 1996-05-14 Matsushita Electric Industrial Co., Ltd. Arithmetic unit for executing division
US5532694A (en) * 1989-01-13 1996-07-02 Stac Electronics, Inc. Data compression apparatus and method using matching string searching and Huffman encoding
US5535300A (en) * 1988-12-30 1996-07-09 At&T Corp. Perceptual coding of audio signals using entropy coding and/or multiple power spectra
US5546080A (en) * 1994-01-03 1996-08-13 International Business Machines Corporation Order-preserving, fast-decoding arithmetic coding arithmetic coding and compression method and apparatus
US5592162A (en) * 1993-03-29 1997-01-07 Digital Equipment International, Ltd. Interval width update process in the arithmetic coding method
US5594674A (en) * 1993-03-29 1997-01-14 Digital Equipment Corporation Code point update device in the arithmetic coding method
US5596763A (en) * 1993-11-30 1997-01-21 Texas Instruments Incorporated Three input arithmetic logic unit forming mixed arithmetic and boolean combinations
US5600847A (en) * 1993-11-30 1997-02-04 Texas Instruments Incorporated Three input arithmetic logic unit with mask generator
US5627995A (en) * 1990-12-14 1997-05-06 Alfred P. Gnadinger Data compression and decompression using memory spaces of more than one size
US5634065A (en) * 1993-11-30 1997-05-27 Texas Instruments Incorporated Three input arithmetic logic unit with controllable shifter and mask generator
US5640578A (en) * 1993-11-30 1997-06-17 Texas Instruments Incorporated Arithmetic logic unit having plural independent sections and register storing resultant indicator bit from every section
US5654702A (en) * 1994-12-16 1997-08-05 National Semiconductor Corp. Syntax-based arithmetic coding for low bit rate videophone
US5715470A (en) * 1992-09-29 1998-02-03 Matsushita Electric Industrial Co., Ltd. Arithmetic apparatus for carrying out viterbi decoding at a high speed
US5734880A (en) * 1993-11-30 1998-03-31 Texas Instruments Incorporated Hardware branching employing loop control registers loaded according to status of sections of an arithmetic logic unit divided into a plurality of sections
US5734119A (en) * 1996-12-19 1998-03-31 Invision Interactive, Inc. Method for streaming transmission of compressed music
US5737345A (en) * 1994-08-19 1998-04-07 Robert Bosch Gmbh Method for arithmetic decoding
US5745756A (en) * 1996-06-24 1998-04-28 International Business Machines Corporation Method and system for managing movement of large multi-media data files from an archival storage to an active storage within a multi-media server computer system
US5771355A (en) * 1995-12-21 1998-06-23 Intel Corporation Transmitting electronic mail by either reference or value at file-replication points to minimize costs
US5774081A (en) * 1995-12-11 1998-06-30 International Business Machines Corporation Approximated multi-symbol arithmetic coding method and apparatus
US5778374A (en) * 1995-08-03 1998-07-07 International Business Machines Corporation Compressed common file directory for mass storage systems
US5781901A (en) * 1995-12-21 1998-07-14 Intel Corporation Transmitting electronic mail attachment over a network using a e-mail page
US5857035A (en) * 1997-05-19 1999-01-05 Hewlett-Packard Company Arithmetic coding compressor for encoding multiple bit values
US5867600A (en) * 1995-11-08 1999-02-02 Nec Corporation Image coding method and system for providing reduced bit rate arithmetic codes
US5903723A (en) * 1995-12-21 1999-05-11 Intel Corporation Method and apparatus for transmitting electronic mail attachments with attachment references
US5907703A (en) * 1996-05-08 1999-05-25 Mijenix Corporation Device driver for accessing computer files
US5912636A (en) * 1996-09-26 1999-06-15 Ricoh Company, Ltd. Apparatus and method for performing m-ary finite state machine entropy coding
US5918002A (en) * 1997-03-14 1999-06-29 Microsoft Corporation Selective retransmission for efficient and reliable streaming of multimedia packets in a computer network
US5926208A (en) * 1992-02-19 1999-07-20 Noonen; Michael Video compression and decompression arrangement having reconfigurable camera and low-bandwidth transmission capability
US5933503A (en) * 1996-03-15 1999-08-03 Novell, Inc Controlled modular cryptography apparatus and method
US5937188A (en) * 1994-05-16 1999-08-10 British Telecommunications Public Limited Company Instruction creation device
US5940507A (en) * 1997-02-11 1999-08-17 Connected Corporation Secure file archive through encryption key management
US6018747A (en) * 1997-11-26 2000-01-25 International Business Machines Corporation Method for generating and reconstructing in-place delta files
US6028541A (en) * 1998-03-12 2000-02-22 Liquid Audio Inc. Lossless data compression with low complexity
US6032200A (en) * 1996-09-30 2000-02-29 Apple Computer, Inc. Process scheduling for streaming data through scheduling of disk jobs and network jobs and the relationship of the scheduling between these types of jobs
US6041147A (en) * 1996-10-15 2000-03-21 Hughes Electronics Corporation Content-based indexing of images by coding levels defined as a function of reduced entropy
US6043763A (en) * 1998-03-12 2000-03-28 Liquid Audio, Inc. Lossless data compression with low complexity
US6049671A (en) * 1996-04-18 2000-04-11 Microsoft Corporation Method for identifying and obtaining computer software from a network computer
US6049630A (en) * 1996-03-19 2000-04-11 America Online, Inc. Data compression using adaptive bit allocation and hybrid lossless entropy encoding
US6052531A (en) * 1998-03-25 2000-04-18 Symantec Corporation Multi-tiered incremental software updating
US6061732A (en) * 1997-05-26 2000-05-09 U. S. Philips Corporation Data streaming system utilizing an asynchronous technique for retrieving data from a stream server
US6078921A (en) * 1998-03-03 2000-06-20 Trellix Corporation Method and apparatus for providing a self-service file
US6083279A (en) * 1996-10-10 2000-07-04 International Business Machines Corporation Platform independent technique for transferring software programs over a network
US6088717A (en) * 1996-02-29 2000-07-11 Onename Corporation Computer-based communication system and method using metadata defining a control-structure
US6091777A (en) * 1997-09-18 2000-07-18 Cubic Video Technologies, Inc. Continuously adaptive digital video compression system and method for a web streamer
US6094453A (en) * 1996-10-11 2000-07-25 Digital Accelerator Corporation Digital data compression with quad-tree coding of header file
US6098163A (en) * 1993-11-30 2000-08-01 Texas Instruments Incorporated Three input arithmetic logic unit with shifter
US6112211A (en) * 1997-11-25 2000-08-29 International Business Machines Corporation Reconfiguration an aggregate file including delete-file space for optimal compression
US6173317B1 (en) * 1997-03-14 2001-01-09 Microsoft Corporation Streaming and displaying a video stream with synchronized annotations over a computer network
US6173394B1 (en) * 1993-11-30 2001-01-09 Texas Instruments Incorporated Instruction having bit field designating status bits protected from modification corresponding to arithmetic logic unit result
US6185681B1 (en) * 1998-05-07 2001-02-06 Stephen Zizzi Method of transparent encryption and decryption for an electronic document management system
US6188334B1 (en) * 1997-07-31 2001-02-13 At&T Corp. Z-coder: fast adaptive binary arithmetic coder
US6195026B1 (en) * 1998-09-14 2001-02-27 Intel Corporation MMX optimized data packing methodology for zero run length and variable length entropy encoding
US6198412B1 (en) * 1999-01-20 2001-03-06 Lucent Technologies Inc. Method and apparatus for reduced complexity entropy coding
US6217234B1 (en) * 1994-07-29 2001-04-17 Discovision Associates Apparatus and method for processing data with an arithmetic unit
US6225925B1 (en) * 1998-03-13 2001-05-01 At&T Corp. Z-coder: a fast adaptive binary arithmetic coder
US6229463B1 (en) * 1998-03-16 2001-05-08 U.S. Philips Corporation Arithmetic encoding/decoding of a multi-channel information signal
US6233017B1 (en) * 1996-09-16 2001-05-15 Microsoft Corporation Multimedia compression system with adaptive block sizes
US6236341B1 (en) * 2000-03-16 2001-05-22 Lucent Technologies Inc. Method and apparatus for data compression of network packets employing per-packet hash tables
US6275848B1 (en) * 1997-05-21 2001-08-14 International Business Machines Corp. Method and apparatus for automated referencing of electronic information
US6345288B1 (en) * 1989-08-31 2002-02-05 Onename Corporation Computer-based communication system and method using metadata defining a control-structure
US6356937B1 (en) * 1999-07-06 2002-03-12 David Montville Interoperable full-featured web-based and client-side e-mail system
US6381742B2 (en) * 1998-06-19 2002-04-30 Microsoft Corporation Software package management
US6415435B1 (en) * 1999-03-18 2002-07-02 International Business Machines Corporation Method and apparatus for determining compatibility of parent classes in an object oriented environment using versioning
US6427149B1 (en) * 1999-09-09 2002-07-30 Herman Rodriguez Remote access of archived compressed data files
US6522268B2 (en) * 2000-01-05 2003-02-18 Realnetworks, Inc. Systems and methods for multiple-file data compression
US6526574B1 (en) * 1997-07-15 2003-02-25 Pocket Soft, Inc. System for finding differences between two computer files and updating the computer files
US6546417B1 (en) * 1998-12-10 2003-04-08 Intellinet, Inc. Enhanced electronic mail system including methods and apparatus for identifying mime types and for displaying different icons
US6594822B1 (en) * 1999-02-19 2003-07-15 Nortel Networks Limited Method and apparatus for creating a software patch by comparing object files
US6879988B2 (en) * 2000-03-09 2005-04-12 Pkware System and method for manipulating and managing computer archive files
US20050097077A1 (en) * 2001-03-21 2005-05-05 Microsoft Corporation On-disk file format for a serverless distributed file system
US6892382B1 (en) * 1999-05-06 2005-05-10 Sun Microsystems, Inc. Method and apparatus for implementing deployment descriptors in an enterprise environment

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4542453A (en) 1982-02-19 1985-09-17 Texas Instruments Incorporated Program patching in microcomputer
US5155847A (en) 1988-08-03 1992-10-13 Minicom Data Corporation Method and apparatus for updating software at remote locations
US5270712A (en) 1992-04-02 1993-12-14 International Business Machines Corporation Sort order preserving method for data storage compression
JPH0721033A (en) 1993-07-07 1995-01-24 Nec Corp Device and method for processing language
US5581697A (en) 1994-01-28 1996-12-03 Sun Microsystems, Inc. Method and apparatus for run-time error checking using dynamic patching
US5699275A (en) 1995-04-12 1997-12-16 Highwaymaster Communications, Inc. System and method for remote patching of operating code located in a mobile unit
US5802549A (en) 1995-12-14 1998-09-01 International Business Machines Corporation Method and apparatus for patching pages of ROM
US5832520A (en) 1996-07-03 1998-11-03 Miller, Call, Plauck And Miller Automatic file differencing and updating system
US6289509B1 (en) 1998-09-01 2001-09-11 Pkware, Inc. Software patch generator
US6466999B1 (en) * 1999-03-31 2002-10-15 Microsoft Corporation Preprocessing a reference data stream for patch generation and compression
US6477703B1 (en) * 1999-06-29 2002-11-05 Hewlett-Packard Company Software patch selection tool

Patent Citations (99)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US502258A (en) * 1893-07-25 Die for rolling screw-threads
US4041284A (en) * 1976-09-07 1977-08-09 The United States Of America As Represented By The Secretary Of The Navy Signal processing devices using residue class arithmetic
US4156922A (en) * 1977-02-01 1979-05-29 Instytut Maszyn Matematyeznych Digital system for computation of the values of composite arithmetic expressions
US4377846A (en) * 1979-10-08 1983-03-22 Hitachi, Ltd. Arithmetic unit for generating constants in an electronic computer of the microprogram-controlled type
US4521866A (en) * 1980-08-27 1985-06-04 Petit Jean P Distributed arithmetic oversampling recursive digital filter
US4933883A (en) * 1985-12-04 1990-06-12 International Business Machines Corporation Probability adaptation for arithmetic coders
US5099440A (en) * 1985-12-04 1992-03-24 International Business Machines Corporation Probability adaptation for arithmetic coders
US4891643A (en) * 1986-09-15 1990-01-02 International Business Machines Corporation Arithmetic coding data compression/de-compression by selectively employed, diverse arithmetic coding encoders and decoders
US4905297A (en) * 1986-09-15 1990-02-27 International Business Machines Corporation Arithmetic coding encoder and decoder system
US4935882A (en) * 1986-09-15 1990-06-19 International Business Machines Corporation Probability adaptation for arithmetic coders
US4862167A (en) * 1987-02-24 1989-08-29 Hayes Microcomputer Products, Inc. Adaptive data compression method and apparatus
US4939639A (en) * 1987-06-11 1990-07-03 Northern Telecom Limited Method of facilitating computer sorting
US4989000A (en) * 1988-07-05 1991-01-29 Chevion Dan S Data string compression using arithmetic encoding with simplified probability subinterval estimation
US5535300A (en) * 1988-12-30 1996-07-09 At&T Corp. Perceptual coding of audio signals using entropy coding and/or multiple power spectra
US5126739A (en) * 1989-01-13 1992-06-30 Stac Electronics Data compression apparatus and method
US5016009A (en) * 1989-01-13 1991-05-14 Stac, Inc. Data compression apparatus and method
US5003307A (en) * 1989-01-13 1991-03-26 Stac, Inc. Data compression apparatus with shift register search means
US5532694A (en) * 1989-01-13 1996-07-02 Stac Electronics, Inc. Data compression apparatus and method using matching string searching and Huffman encoding
US5506580A (en) * 1989-01-13 1996-04-09 Stac Electronics, Inc. Data compression apparatus and method
US5414425A (en) * 1989-01-13 1995-05-09 Stac Data compression apparatus and method
US5091955A (en) * 1989-06-29 1992-02-25 Fujitsu Limited Voice coding/decoding system having selected coders and entropy coders
US5142283A (en) * 1989-07-28 1992-08-25 International Business Machines Corporation Arithmetic compression coding using interpolation for ambiguous symbols
US6345288B1 (en) * 1989-08-31 2002-02-05 Onename Corporation Computer-based communication system and method using metadata defining a control-structure
US5218700A (en) * 1990-01-30 1993-06-08 Allen Beechick Apparatus and method for sorting a list of items
US5179555A (en) * 1990-09-11 1993-01-12 Microcom Systems, Inc. High speed data compression and transmission for wide area network connections in LAN/bridging applications
US5627995A (en) * 1990-12-14 1997-05-06 Alfred P. Gnadinger Data compression and decompression using memory spaces of more than one size
US5404315A (en) * 1991-04-30 1995-04-04 Sharp Kabushiki Kaisha Automatic sound gain control device and a sound recording/reproducing device including arithmetic processor conducting a non-linear conversion
US5926208A (en) * 1992-02-19 1999-07-20 Noonen; Michael Video compression and decompression arrangement having reconfigurable camera and low-bandwidth transmission capability
US5715470A (en) * 1992-09-29 1998-02-03 Matsushita Electric Industrial Co., Ltd. Arithmetic apparatus for carrying out viterbi decoding at a high speed
US5440504A (en) * 1993-02-19 1995-08-08 Matsushita Electric Industrial Co., Ltd. Arithmetic apparatus for digital signal processor
US5298896A (en) * 1993-03-15 1994-03-29 Bell Communications Research, Inc. Method and system for high order conditional entropy coding
US5592162A (en) * 1993-03-29 1997-01-07 Digital Equipment International, Ltd. Interval width update process in the arithmetic coding method
US5594674A (en) * 1993-03-29 1997-01-14 Digital Equipment Corporation Code point update device in the arithmetic coding method
US5481713A (en) * 1993-05-06 1996-01-02 Apple Computer, Inc. Method and apparatus for patching code residing on a read only memory device
US5485411A (en) * 1993-11-30 1996-01-16 Texas Instruments Incorporated Three input arithmetic logic unit forming the sum of a first input anded with a first boolean combination of a second input and a third input plus a second boolean combination of the second and third inputs
US5734880A (en) * 1993-11-30 1998-03-31 Texas Instruments Incorporated Hardware branching employing loop control registers loaded according to status of sections of an arithmetic logic unit divided into a plurality of sections
US5596763A (en) * 1993-11-30 1997-01-21 Texas Instruments Incorporated Three input arithmetic logic unit forming mixed arithmetic and boolean combinations
US5634065A (en) * 1993-11-30 1997-05-27 Texas Instruments Incorporated Three input arithmetic logic unit with controllable shifter and mask generator
US5640578A (en) * 1993-11-30 1997-06-17 Texas Instruments Incorporated Arithmetic logic unit having plural independent sections and register storing resultant indicator bit from every section
US5600847A (en) * 1993-11-30 1997-02-04 Texas Instruments Incorporated Three input arithmetic logic unit with mask generator
US6098163A (en) * 1993-11-30 2000-08-01 Texas Instruments Incorporated Three input arithmetic logic unit with shifter
US5493524A (en) * 1993-11-30 1996-02-20 Texas Instruments Incorporated Three input arithmetic logic unit employing carry propagate logic
US6173394B1 (en) * 1993-11-30 2001-01-09 Texas Instruments Incorporated Instruction having bit field designating status bits protected from modification corresponding to arithmetic logic unit result
US5546080A (en) * 1994-01-03 1996-08-13 International Business Machines Corporation Order-preserving, fast-decoding arithmetic coding arithmetic coding and compression method and apparatus
US5517439A (en) * 1994-02-14 1996-05-14 Matsushita Electric Industrial Co., Ltd. Arithmetic unit for executing division
US5937188A (en) * 1994-05-16 1999-08-10 British Telecommunications Public Limited Company Instruction creation device
US6217234B1 (en) * 1994-07-29 2001-04-17 Discovision Associates Apparatus and method for processing data with an arithmetic unit
US5737345A (en) * 1994-08-19 1998-04-07 Robert Bosch Gmbh Method for arithmetic decoding
US5654702A (en) * 1994-12-16 1997-08-05 National Semiconductor Corp. Syntax-based arithmetic coding for low bit rate videophone
US5778374A (en) * 1995-08-03 1998-07-07 International Business Machines Corporation Compressed common file directory for mass storage systems
US5867600A (en) * 1995-11-08 1999-02-02 Nec Corporation Image coding method and system for providing reduced bit rate arithmetic codes
US5774081A (en) * 1995-12-11 1998-06-30 International Business Machines Corporation Approximated multi-symbol arithmetic coding method and apparatus
US5781901A (en) * 1995-12-21 1998-07-14 Intel Corporation Transmitting electronic mail attachment over a network using a e-mail page
US5903723A (en) * 1995-12-21 1999-05-11 Intel Corporation Method and apparatus for transmitting electronic mail attachments with attachment references
US5771355A (en) * 1995-12-21 1998-06-23 Intel Corporation Transmitting electronic mail by either reference or value at file-replication points to minimize costs
US6088717A (en) * 1996-02-29 2000-07-11 Onename Corporation Computer-based communication system and method using metadata defining a control-structure
US5933503A (en) * 1996-03-15 1999-08-03 Novell, Inc Controlled modular cryptography apparatus and method
US6049630A (en) * 1996-03-19 2000-04-11 America Online, Inc. Data compression using adaptive bit allocation and hybrid lossless entropy encoding
US6049671A (en) * 1996-04-18 2000-04-11 Microsoft Corporation Method for identifying and obtaining computer software from a network computer
US5907703A (en) * 1996-05-08 1999-05-25 Mijenix Corporation Device driver for accessing computer files
US5745756A (en) * 1996-06-24 1998-04-28 International Business Machines Corporation Method and system for managing movement of large multi-media data files from an archival storage to an active storage within a multi-media server computer system
US6233017B1 (en) * 1996-09-16 2001-05-15 Microsoft Corporation Multimedia compression system with adaptive block sizes
US5912636A (en) * 1996-09-26 1999-06-15 Ricoh Company, Ltd. Apparatus and method for performing m-ary finite state machine entropy coding
US6032200A (en) * 1996-09-30 2000-02-29 Apple Computer, Inc. Process scheduling for streaming data through scheduling of disk jobs and network jobs and the relationship of the scheduling between these types of jobs
US6083279A (en) * 1996-10-10 2000-07-04 International Business Machines Corporation Platform independent technique for transferring software programs over a network
US6094453A (en) * 1996-10-11 2000-07-25 Digital Accelerator Corporation Digital data compression with quad-tree coding of header file
US6041147A (en) * 1996-10-15 2000-03-21 Hughes Electronics Corporation Content-based indexing of images by coding levels defined as a function of reduced entropy
US5734119A (en) * 1996-12-19 1998-03-31 Invision Interactive, Inc. Method for streaming transmission of compressed music
US5940507A (en) * 1997-02-11 1999-08-17 Connected Corporation Secure file archive through encryption key management
US6173317B1 (en) * 1997-03-14 2001-01-09 Microsoft Corporation Streaming and displaying a video stream with synchronized annotations over a computer network
US5918002A (en) * 1997-03-14 1999-06-29 Microsoft Corporation Selective retransmission for efficient and reliable streaming of multimedia packets in a computer network
US5857035A (en) * 1997-05-19 1999-01-05 Hewlett-Packard Company Arithmetic coding compressor for encoding multiple bit values
US6275848B1 (en) * 1997-05-21 2001-08-14 International Business Machines Corp. Method and apparatus for automated referencing of electronic information
US6061732A (en) * 1997-05-26 2000-05-09 U. S. Philips Corporation Data streaming system utilizing an asynchronous technique for retrieving data from a stream server
US6526574B1 (en) * 1997-07-15 2003-02-25 Pocket Soft, Inc. System for finding differences between two computer files and updating the computer files
US6188334B1 (en) * 1997-07-31 2001-02-13 At&T Corp. Z-coder: fast adaptive binary arithmetic coder
US6091777A (en) * 1997-09-18 2000-07-18 Cubic Video Technologies, Inc. Continuously adaptive digital video compression system and method for a web streamer
US6112211A (en) * 1997-11-25 2000-08-29 International Business Machines Corporation Reconfiguration an aggregate file including delete-file space for optimal compression
US6018747A (en) * 1997-11-26 2000-01-25 International Business Machines Corporation Method for generating and reconstructing in-place delta files
US6078921A (en) * 1998-03-03 2000-06-20 Trellix Corporation Method and apparatus for providing a self-service file
US6043763A (en) * 1998-03-12 2000-03-28 Liquid Audio, Inc. Lossless data compression with low complexity
US6028541A (en) * 1998-03-12 2000-02-22 Liquid Audio Inc. Lossless data compression with low complexity
US6225925B1 (en) * 1998-03-13 2001-05-01 At&T Corp. Z-coder: a fast adaptive binary arithmetic coder
US6229463B1 (en) * 1998-03-16 2001-05-08 U.S. Philips Corporation Arithmetic encoding/decoding of a multi-channel information signal
US6052531A (en) * 1998-03-25 2000-04-18 Symantec Corporation Multi-tiered incremental software updating
US6185681B1 (en) * 1998-05-07 2001-02-06 Stephen Zizzi Method of transparent encryption and decryption for an electronic document management system
US6381742B2 (en) * 1998-06-19 2002-04-30 Microsoft Corporation Software package management
US6195026B1 (en) * 1998-09-14 2001-02-27 Intel Corporation MMX optimized data packing methodology for zero run length and variable length entropy encoding
US6546417B1 (en) * 1998-12-10 2003-04-08 Intellinet, Inc. Enhanced electronic mail system including methods and apparatus for identifying mime types and for displaying different icons
US6198412B1 (en) * 1999-01-20 2001-03-06 Lucent Technologies Inc. Method and apparatus for reduced complexity entropy coding
US6594822B1 (en) * 1999-02-19 2003-07-15 Nortel Networks Limited Method and apparatus for creating a software patch by comparing object files
US6415435B1 (en) * 1999-03-18 2002-07-02 International Business Machines Corporation Method and apparatus for determining compatibility of parent classes in an object oriented environment using versioning
US6892382B1 (en) * 1999-05-06 2005-05-10 Sun Microsystems, Inc. Method and apparatus for implementing deployment descriptors in an enterprise environment
US6356937B1 (en) * 1999-07-06 2002-03-12 David Montville Interoperable full-featured web-based and client-side e-mail system
US6427149B1 (en) * 1999-09-09 2002-07-30 Herman Rodriguez Remote access of archived compressed data files
US6522268B2 (en) * 2000-01-05 2003-02-18 Realnetworks, Inc. Systems and methods for multiple-file data compression
US6879988B2 (en) * 2000-03-09 2005-04-12 Pkware System and method for manipulating and managing computer archive files
US6236341B1 (en) * 2000-03-16 2001-05-22 Lucent Technologies Inc. Method and apparatus for data compression of network packets employing per-packet hash tables
US20050097077A1 (en) * 2001-03-21 2005-05-05 Microsoft Corporation On-disk file format for a serverless distributed file system

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110035360A1 (en) * 2000-10-26 2011-02-10 Reynolds Mark L Tools and techniques for original digital files
US8145688B2 (en) * 2000-10-26 2012-03-27 Reynolds Mark L Tools and techniques for original digital files
US20050223292A1 (en) * 2004-02-17 2005-10-06 Lee Chee S Single instruction type based hardware patch controller
WO2008065341A2 (en) 2006-12-01 2008-06-05 David Irvine Distributed network system
US20100058054A1 (en) * 2006-12-01 2010-03-04 David Irvine Mssan
US20100064354A1 (en) * 2006-12-01 2010-03-11 David Irvine Maidsafe.net
EP2472430A1 (en) 2006-12-01 2012-07-04 David Irvine Self encryption
US20090183145A1 (en) * 2008-01-10 2009-07-16 Wei-Ming Hu Techniques for reducing down time in updating applications with metadata
US8589909B2 (en) 2008-01-10 2013-11-19 Oracle International Corporation Techniques for reducing down time in updating applications with metadata
US20110138374A1 (en) * 2009-12-09 2011-06-09 Suprio Pal Downtime reduction for enterprise manager patching
US10241813B2 (en) * 2012-09-12 2019-03-26 International Business Machines Corporation Method and apparatus for patching

Also Published As

Publication number Publication date
EP1333375A3 (en) 2004-11-17
CA2399891C (en) 2011-01-04
US20030028867A1 (en) 2003-02-06
US6952823B2 (en) 2005-10-04
EP1333375A2 (en) 2003-08-06
AU2002300771B2 (en) 2008-01-17
CA2399891A1 (en) 2003-02-27
DE60232221D1 (en) 2009-06-18
ATE430959T1 (en) 2009-05-15
EP1333375B1 (en) 2009-05-06

Similar Documents

Publication Publication Date Title
US6952823B2 (en) Software patch generator using compression techniques
US6289509B1 (en) Software patch generator
US7600225B2 (en) System and method for intra-package delta compression of data
US5765173A (en) High performance backup via selective file saving which can perform incremental backups and exclude files and uses a changed block signature list
US7472254B2 (en) Systems and methods for modifying a set of data objects
US20030005306A1 (en) Message digest based data synchronization
US6216175B1 (en) Method for upgrading copies of an original file with same update data after normalizing differences between copies created during respective original installations
EP1769343B1 (en) Method and system for in-place updating content stored in a storage device
US7448033B1 (en) System and method for identifying changes made to a computer system due to software installation
US7159110B2 (en) Identifying and coalescing identical objects encrypted with different keys
US7506010B2 (en) Storing and retrieving computer data files using an encrypted network drive file system
US6374250B2 (en) System and method for differential compression of data from a plurality of binary sources
US7599970B2 (en) Method and apparatus for updating a stored version of content stored in a storage device
US7231440B1 (en) System and method for distributing portable computer virus definition records with binary file conversion
CA2161360A1 (en) Efficient and secure update of software and data
US7509635B2 (en) Software and data file updating process
US7379940B1 (en) Focal point compression method and apparatus
JP4877193B2 (en) Version management system and version management method
US8244677B2 (en) Focal point compression method and apparatus
US20240020201A1 (en) Generating diffs between archives using a generic grammar
WO2024015172A1 (en) Generating diffs between archives using a generic grammar

Legal Events

Date Code Title Description
AS Assignment

Owner name: MARANON CAPITAL, L.P., AS AGENT, ILLINOIS

Free format text: SECURITY AGREEMENT;ASSIGNOR:PKWARE, INC.;REEL/FRAME:023107/0510

Effective date: 20090817

Owner name: MARANON CAPITAL, L.P., AS AGENT,ILLINOIS

Free format text: SECURITY AGREEMENT;ASSIGNOR:PKWARE, INC.;REEL/FRAME:023107/0510

Effective date: 20090817

AS Assignment

Owner name: MARANON CAPITAL, L.P., AS AGENT, ILLINOIS

Free format text: SECURITY AGREEMENT;ASSIGNOR:PKWARE, INC.;REEL/FRAME:023107/0952

Effective date: 20090817

Owner name: MARANON CAPITAL, L.P., AS AGENT,ILLINOIS

Free format text: SECURITY AGREEMENT;ASSIGNOR:PKWARE, INC.;REEL/FRAME:023107/0952

Effective date: 20090817

AS Assignment

Owner name: PKWARE, INC., WISCONSIN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KRYLOFF, SERGEY A.;BASIN, YURI;REEL/FRAME:023165/0448;SIGNING DATES FROM 19971002 TO 20011113

AS Assignment

Owner name: MARANON CAPITAL, L.P., AS AGENT, ILLINOIS

Free format text: SECURITY AGREEMENT;ASSIGNOR:PKWARE, INC.;REEL/FRAME:023193/0321

Effective date: 20090902

AS Assignment

Owner name: MARANON CAPITAL, L.P., AS AGENT, ILLINOIS

Free format text: SECURITY AGREEMENT;ASSIGNOR:PKWARE, INC.;REEL/FRAME:023209/0093

Effective date: 20090902

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION

AS Assignment

Owner name: PKWARE, INC., WISCONSIN

Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:MARANON CAPITAL, L.P., AS AGENT;REEL/FRAME:025525/0223

Effective date: 20101217

Owner name: PKWARE, INC., WISCONSIN

Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:MARANON CAPITAL, L.P., AS AGENT;REEL/FRAME:025525/0230

Effective date: 20101217