Browse Prior Art Database

Data Reference by Attribute Name

IP.com Disclosure Number: IPCOM000089478D
Original Publication Date: 1977-Nov-01
Included in the Prior Art Database: 2005-Mar-05
Document File: 1 page(s) / 12K

Publishing Venue

IBM

Related People

Foster, RA: AUTHOR

Abstract

In interactive data processing applications, it is often desirable to allow a user to access a data base by his use of common English words and phrases. The user specifies the desired subset of the data base through the use of a list of attribute words. For example, a data base containing payroll information might be queried for "federal tax". Depending on the choice of words for the attribute list, the data requested may consist of very specific items or large blocks of data. The above example is specific. In contrast, the term "deductions" would produce a much larger result.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 75% of the total text.

Page 1 of 1

Data Reference by Attribute Name

In interactive data processing applications, it is often desirable to allow a user to access a data base by his use of common English words and phrases. The user specifies the desired subset of the data base through the use of a list of attribute words. For example, a data base containing payroll information might be queried for "federal tax". Depending on the choice of words for the attribute list, the data requested may consist of very specific items or large blocks of data. The above example is specific. In contrast, the term "deductions" would produce a much larger result.

A typical data base arrangement is a file structure consisting of a collection of data records each with a common format. Each record is subdivided into fields which may contain a collection of different types of data. A dictionary is constructed consisting of a list of all words and phrases which define the attributes of the various fields. Next, a binary cross reference matrix is developed. Let the columns of the matrix be a one-to-one correspondence with the dictionary items, and let the rows correspond to fields in the data record. The matrix is made a truth table for defining correspondence between elements of the dictionary list and data fields in the file record. If the correspondence is true, the matrix bit is one; otherwise, it is zero.

The data reference by attribute name algorithm is defined here using APL notation. Let A - the user-supplied attri...