6. In 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, a method for creating said static dictionary comprising the steps of: (a) initializing 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; (b) setting a current input pointer at the beginning of said data stream; (c) until said data stream is exhausted, repeatedly performing the steps of: (c.1) 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, (c.2) incrementing said use count value for all nodes in said path P, (c.3) 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, (c.4) linking said new node N to the end of a LRU chain, (c.5) advancing said current input pointer to the end of said sequence S' in said data stream, and (c.6) performing the steps of (e.6.1) initializing a use count value threshold to a fourth predetermined value, and (e.6.2) discarding from said LRU chain one said node whose use count value does not exceed said use count value threshold; (d) assembling said nodes with the associated said paths to form said static dictionary; and (e) storing said static dictionary in said memory.
6. In 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, a method for creating said static dictionary comprising the steps of: (a) initializing 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; (b) setting a current input pointer at the beginning of said data stream; (c) until said data stream is exhausted, repeatedly performing the steps of: (c.1) 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, (c.2) incrementing said use count value for all nodes in said path P, (c.3) 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, (c.4) linking said new node N to the end of a LRU chain, (c.5) advancing said current input pointer to the end of said sequence S' in said data stream, and (c.6) performing the steps of (e.6.1) initializing a use count value threshold to a fourth predetermined value, and (e.6.2) discarding from said LRU chain one said node whose use count value does not exceed said use count value threshold; (d) assembling said nodes with the associated said paths to form said static dictionary; and (e) storing said static dictionary in said memory. 7. The method in claim 6 wherein said data stream is organized as a series of database records.