Browse Prior Art Database

Attribute Value Entity Index Algorithm

IP.com Disclosure Number: IPCOM000080688D
Original Publication Date: 1974-Jan-01
Included in the Prior Art Database: 2005-Feb-27
Document File: 2 page(s) / 68K

Publishing Venue

IBM

Related People

Howard, PH: AUTHOR [+2]

Abstract

An attribute-value-entity index algorithm requires an index to match on attribute, value and entity codes simultaneously, or to match attribute-value codes and compare high or low on entity codes.

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 53% of the total text.

Page 1 of 2

Attribute Value Entity Index Algorithm

An attribute-value-entity index algorithm requires an index to match on attribute, value and entity codes simultaneously, or to match attribute-value codes and compare high or low on entity codes.

The Attribute-Value-Entity (AVE) index algorithm is applied at the point in the search algorithm that requires a decision, as whether the entity being searched for is before the current index entry, after the current index entry, or at the current index entry. The AVF algorithm is not dependent on the search algorithm. Particular search algorithms are not discussed here. The search argument (S), Fig. 1, combines an attribute (SA), a value (SV) and an entity (SE). Because the entries in the index are ordered by entity, within value, within attribute, the search algorithm is made to yield a unique entry even when there are multiple instances of the given attribute-value pair. Since S contains an entity code, the AVF algorithm partitions a set of multiple instances of the given attribute-value pair into three subsets: 1) AVE triples which are before S; 2) AVE triples which are after S; 3) AVE triples which are equal to S.

This results in an efficiency for the search algorithm by the elimination of two of the three subsets from further search.

The AVE algorithm is different from a more conventional algorithm starting logically after point P in the logic diagram, Fig. 2. When attribute and value code are found equal to the attribute code (SA) and the val...