7. The computer program product of claim 6 wherein said data stream is organized as a series of database records.
6. A computer program product for use with a computer-implemented system for compressing input data arranged in a data stream of one or more records consisting of sequences of source symbols selected from a source alphabet to form output data consisting of sequences of code symbols selected from a code alphabet according to a static dictionary stored in a memory, said dictionary representing a static parse-tree having nodes representing said code symbols, said nodes being linked into paths representing said source symbol sequences, said computer program product comprising: means, recorded on said recording medium, for directing said computer-implemented system to initialize a parse-tree with a plurality of said paths representing a set of said source symbol strings, each said path having at least one node with a unity use count value; means, recorded on said recording medium, for directing said computer-implemented system to set a current input pointer at the beginning of said data stream; means, recorded on said recording medium, for directing said computer-implemented system to, until said data stream is exhausted, repeatedly perform the steps of determining the longest said source symbol sequence S, represented by a path P in said parse-tree, that matches a current said source symbol sequence in said data stream beginning at said current input pointer, incrementing said use count value for all nodes in said path P, if said sequence S is not the final sequence in a record, adding a new node N having a unity use count value to said path P to form a new path P' representing a new source symbol sequence S' consisting of said sequence S extended by at least one immediately subsequent said source symbol in said data stream, linking said new node N to the end of a LRU chain, advancing said current input pointer to the end of said sequence S' in said data stream, and initializing a use count value threshold to a fourth predetermined value and discarding from said LRU chain one said node whose use count value does not exceed said use count value threshold; means, recorded on said recording medium, for directing said computer-implemented system to assemble said nodes with the associated said paths to form said static dictionary; and means, recorded on said recording medium, for directing said computer-implemented system to store said static dictionary in said memory.