The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Nov. 22, 1994
Filed:
Dec. 13, 1991
Jody E Berk, Rochester, MN (US);
James R Coon, Rochester, MN (US);
Paul R Day, Rochester, MN (US);
Peter J Heyrman, Rochester, MN (US);
David L Johnson, Pine Island, MN (US);
International Business Machines Corporation, Armonk, NY (US);
Abstract
The disclosed data stream optimization process is containing two logical entities, the first being the pre-comparison optimizer component and the second being the comparison component. The pre-comparison optimizer component performs two discrete tasks. First, the input data stream is written into a next state buffer. Second, the elimination of redundancies involves detecting and removing redundant screen attributes, since the terminal's execution time for processing a screen attribute is more than that required for a data character. The comparison component contains three distinct sub-components. First, non-data constructs such as commands and orders are optimized and placed in the outgoing data stream. Second, the screen image that is represented by the data stream is compared to the existing screen image to further reduce the outgoing data stream. This reduced version is further reduced when repeated characters and fields are replaced with repeat orders which take up less space within the outgoing data stream. Lastly, the reduced outgoing data stream is operated on by a post-optimizer sub-component. The post-optimizer sub-component will first determine whether repeated characters existing at the end of the outgoing data stream can be replaced a single repeat order. Then, the sub-component proceeds to remove any unnecessary cursor control orders. Upon completion, the fully optimized data stream is routed to the terminal or conversion facility.