Browse Prior Art Database

Scheme for Nested Processing of a DL/I Hierarchy

IP.com Disclosure Number: IPCOM000046516D
Original Publication Date: 1983-Jul-01
Included in the Prior Art Database: 2005-Feb-07

Publishing Venue

IBM

Related People

Authors:
Wilson, GM [+details]

Abstract

In this article I describe a method for extracting hierarchical data from, for example, DL/I hierarchies. According to the method, a computing apparatus is operated, beginning with the first segment at the top of the hierarchy, to (a) GET a segment from the hierarchy; (b) if the GET is successful, next GET the first subordinate segment at the next (lower) level; (c) if a GET is not successful, next GET the next segment at the previous (higher) level. From this data, rows of extracted data are generated.