Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Information Retrieval System

IP.com Disclosure Number: IPCOM000090907D
Original Publication Date: 1969-Aug-01
Included in the Prior Art Database: 2005-Mar-05
Document File: 2 page(s) / 60K

Publishing Venue

IBM

Related People

Lum, VY: AUTHOR

Abstract

In this information retrieval system, it is possible to retrieve records satisfying any input query by a single access to one table which provides the keys, addresses or sequence numbers of the stored records, for all the records satisfying the input query. This is accomplished using a number of tables storing the keys for different combinations of values in which the input query is expressed. The tables are sequential relative to the buckets. The number and arrangement of tables, in terms of the sequence of fields in which the table is arranged, is such that, regardless of the number of values in the input query, a single access to one of the tables is all that is necessary to obtain the keys for all records satisfying the query.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 52% of the total text.

Page 1 of 2

Information Retrieval System

In this information retrieval system, it is possible to retrieve records satisfying any input query by a single access to one table which provides the keys, addresses or sequence numbers of the stored records, for all the records satisfying the input query. This is accomplished using a number of tables storing the keys for different combinations of values in which the input query is expressed. The tables are sequential relative to the buckets. The number and arrangement of tables, in terms of the sequence of fields in which the table is arranged, is such that, regardless of the number of values in the input query, a single access to one of the tables is all that is necessary to obtain the keys for all records satisfying the query. Assuming a system in which there are four fields A(1), A(2), A(3), and A(4), each of which can have one of three values 1, 2 or 3. The values for the particular records in these four fields are represented as a(1j), a(2j), a(3j), a(4j). The numerals appearing first in subscript denote field positions and j denotes the particular value. A record having the value 2 in the first field A(1), 3 in the second field A(2), 1 in the third field A(3), and 2 in the fourth field A(4), is represented as a(12), a(23), a(31), a(42).

The sequence of possible records in the order of fields presented, assuming the low-order position is at the right, then extends from a(11), a(21), a(31), a(41) to a(13), a(23), a(33), a(43) and includes 81 possible combinations. file set up in this sequence can be queried for any combination of 1, 2, 3 or 4 field values as long as query combination includes a defined value in field A(1), or A(1) and A(2), or A(1) A(2) and A(3), or A(1) A(2) A(3) A(4). The keys are read out in sequence. If, e.g., the input query is a(12) a(13), that is all records having a value of 2 in first...