Browse Prior Art Database

Correlation Processor NAME STACK Format

IP.com Disclosure Number: IPCOM000060570D
Original Publication Date: 1986-Apr-01
Included in the Prior Art Database: 2005-Mar-08

Publishing Venue

IBM

Related People

Authors:
Niblett, PD Normington, G [+details]

Abstract

This article describes a technique used to return full context information on each of a series of correlate hits which occur in a chained list of segments. A graphical picture may be defined as a collection of graphical segments. These segments are linked together to form a picture in two ways: o Chaining. The chained segments are drawn successively, each being completed before its successor is started. o Calling. A special drawing order within a segment can call up another segment in a manner similar to subroutine linkage in a programming language. When the called segment has been dealt with, processing resumes at the following order in the calling segment. A segment can be called more than once. A complex picture may use both forms of linkage, with a chain of 'root segments' and a set of dependents called segments.