Browse Prior Art Database

Host Codeline Data Match

IP.com Disclosure Number: IPCOM000113510D
Original Publication Date: 1994-Aug-01
Included in the Prior Art Database: 2005-Mar-27
Document File: 2 page(s) / 90K

Publishing Venue

IBM

Related People

Schroeder, LE: AUTHOR

Abstract

Host Codeline Data Match (HCDM) is a method for comparing two strings of check codeline data. This compare is designed to allow for detection of missing or free checks, reconciliation of missing and free items, coping of not present data from one string of data to the other, correction of misread data, facilitation of exception/return item processing, and reduction of work required for dropped trays of checks that still need sorting.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Host Codeline Data Match

      Host Codeline Data Match (HCDM) is a method for comparing two
strings of check codeline data.  This compare is designed to allow
for detection of missing or free checks, reconciliation of missing
and free items, coping of not present data from one string of data to
the other, correction of misread data, facilitation of
exception/return item processing, and reduction of work required for
dropped trays of checks that still need sorting.

      HCDM is a program that facilitates the matching and repairing
of check data in a check processing environment.  HCDM is a host
based program that is intended to provide a means of finding and
matching up data from an item/check just read on a check reader
sorter with previous information/data from that item.  The advantages
of doing this at the host machine after processing on a reader sorter
is time and resources.  A reader sorter has a limit to the amount of
time it can spend trying to match a current read item to items in its
buffers from a previous read (string/entry).  In addition, there is a
limit to the amount of items it can compare against.  This leads to a
limited search in a short time frame.   This can cause a large number
of items to fail to match under conditions where the matching buffer
and the read item is out of synchronization.

      HCDM being a host based matching routine is not limited by time
like a check reader sorter's codeline data match process is and has
more memory to work with.  This allows the HCDM to scan further up
and down the previous read data buffer for a current read item.  This
helps to limit the number of match failures.  It also can sort the
data to facilitate matching when the work is very much out of order
(like in the case of a dropped tray).

      The following is a description of how HCDM does its primary and
secondary matching between previous read data and the current read
data.

      The first match attempt is done in a two file compare.  A two
file compare is where a record from one file is matched against data
in a second file.  Usually there is a limit to how far up or down the
compare will be done.  The items from the previous file are matched
to the current file on a one-by-one basis with a flexible (user
defined) look ahead or back sub-function.  This allows for items that
are only a few records (ten, twenty, thirty, etc.) out of position to
be matched.  The user controls...