A secure data interchange system enables information about bilateral and multilateral interactions between multiple persistent parties to be exchanged and leveraged within an environment that uses a combination of techniques to control access to information, release of information, and matching of information back to parties. Access to data records can be controlled using an associated price rule. A data owner can specify a price for different types and amounts of information access.

Secure data interchange

An apparatus and method are disclosed for converting an input data character stream into a variable length encoded data stream in a data compression system. The data compression system includes a history array. The history array has a plurality of entries and each entry of the history array is for storing a portion of the input data stream. The method for converting the input data character stream includes the following steps. Performing a search in a history array for the longest data string which matches the input data string. If the matching data string is found within the history buffer, the next step includes encoding the longest matching data string found by appending to the encoded data stream a tag indicating the longest matching data string was found and a string substitution code. If the matching data string is not found within the history array, the next step includes encoding the first character of the input data string by appending to the encoded data stream a raw data tag indicating that no matching data string was found and the first character of the input data string.

Data compression apparatus and method

Systems and methods for improved electronic data storage management that allow the file system to physically adapt and optimize to a variety of add-on hardware components (such as hard disks, removable drives, CD ROM drives, etc.) while virtually maintaining a stable system configuration from an application software point of view. The Redirector presents a virtual view of the file system by providing a virtual view of logical volumes. Through the use of a Redirector component, all application program file API's to the operating system are filtered; if the file, or directory is redirected, then the call is sent in a modified form to the operating system to its redirected physical location. The physical movement of files is accomplished through the use of a Migrator component. The Migrator makes a copy of the file, verifies the correctness of the copy, updates the redirector table, and then removes the physical file from its original location.

Systems and methods for electronic data storage management

A text completion system that automatically displays a list of completion suggestions for a partial data entry in response to a pause in receipt of the data entry. To avoid annoying the user by displaying an excessive number of wrong suggestions, the text completion system applies search criteria to the partial data entry. If the partial data entry satisfies the search criteria, the text completion system obtains a prioritized list of word predictions for the partial data entry from a word prediction system. To further avoid annoying the user by displaying very short completion suggestions, the text completion system applies display criteria to the word predictions to obtain a prioritized list of completion suggestions that satisfy the display criteria. This prioritized list of completion suggestions is then displayed in a pop-up list box, typically immediately under and to the right of the partial data entry. The completion suggestions are positioned in the list based on a computed indication of likelihood of being correct. The user may accept a completion suggestion from the list by touching a stylus to the display screen over the position of the desired completion suggestion, or by using traditional selection and acceptance keystrokes, such as the "arrow" keys to select a completion suggestion and the "enter" key to accept the selected completion suggestion. Thus, the text completion system allows the user to complete the partial data entry without having to type the remaining letters of the complete data entry.

Text completion system for a miniature computer

A word completion system that can automatically predict unrestricted word completions for data entries in an unstructured portion of a data file. The word completion system applies prediction criteria to avoid annoying the user by displaying an excessive number of wrong suggestions. Suggested word completions, which may change as the user types a partial data entry, are displayed in a non-disruptive manner and selected using traditional acceptance keystrokes, such as the “tab” key or the “enter” key. The word completion system may be deployed on an individual application program basis or on a application-independent basis. Because different word suggestion lists may be appropriate for different application programs, and for different data files created with the same application program, the word completion system allows the user to select one or more suggestion lists for use with each data file. A user interface allows the user to customize each suggestion list on an on-going basis. Each suggestion list may contain dynamic word completions that are tied to dynamic parameters maintained by the computer system, such as the time, date, registered user, and so forth. Each suggestion list may also be tied to contextual information, such as structured data fields or context labels assigned manually or by a document-creation aid known as a “wizard.”

Automatic word completion system for partially entered data

A data compressor compresses an input stream of data character signals by storing in a string table strings of data character signals encountered in the input stream. The compressor searches the input stream to determine the longest match to a stored string. Each stored string comprises a prefix string and an extension character where the extension character is the last character in the string and the prefix string comprises all but the extension character. Each string has a code signal associated therewith and a string is stored in the string table by, at least implicitly, storing the code signal for the string, the code signal for the string prefix and the extension character. When the longest match between the input data character stream and the stored strings is determined, the code signal for the longest match is transmitted as the compressed code signal for the encountered string of characters and an extension string is stored in the string table. The prefix of the extended string is the longest match and the extension character of the extended string is the next input data character signal following the longest match. Searching through the string table and entering extended strings therein is effected by a limited search hashing procedure. Decompression is effected by a decompressor that receives the compressed code signals and generates a string table similar to that constructed by the compressor to effect lookup of received code signals so as to recover the data character signals comprising a stored string. The decompressor string table is updated by storing a string having a prefix in accordance with a prior received code signal and an extension character in accordance with the first character of the currently recovered string.

High speed data compression and decompression apparatus and method

High speed data compressing and recovering device

PROBLEM TO BE SOLVED: To efficiently compress and encode a signal string with a satisfactory compression rate by using a code assigned to each newly encountered character signal string B of an input character signal flow A to store it in a RAM and comparing the signal flow A with the stored signal string B to search SOLUTION: A controller 13 controls the whole of a compression device, and character, code number, and RAM address registers 17, 19, and 28 process the input character signal flow A together with a hashing function circuit 23 In this processing, a prefix code or the like assigned to each newly encountered character signal string B of the signal flow A is used to store it in a storage part of a RAM 29 A comparator 32 compares the signal flow A with the signal string B called from the RAM 29 t search it, and the longest matching is determined, and a RAM address is accessed in accordance with the number of character signals in the longest matching The longest matching is determined by this result, and the subsequent extended signal flow is processed to output a compressed encoded signal from the register 19 Thus, the signal flow A is efficiently compressed with a satisfactory compression rate

Compression equipment and compression method

PURPOSE: To enable the data compression and decompression high in performance by using code signals allocated as a character string composed of one extension character and a prefix string for each new character string in digital data input. CONSTITUTION: Compression code signals on a bus 50 are received and the corresponding string of decompressed data character signals is supplied onto the bus 51 by this decompression device. The compression code signals are obtained from an external device, and when added to the bus 50, data usable signals are supplied to a line 52 at all times. The signals are added to a controller 53 and the controller 53 supplies control signals through a lead 53 to all the blocks of the decompression device. Also, input data strobe signals for requesting additional input code signals are supplied through the line 55 to the external device. When one output character is usable on the bus 51, the controller 53 supplies output data strobe signals to the external device on the lead 56.

Welch Terry A

Papers

High speed data compression and decompression apparatus and method

High speed data compressing and recovering device

Compression equipment and compression method

Method and apparatus for restoration of compressed code