Browse Prior Art Database

Maintenance of an Unordered Set of Equal Size Entries

IP.com Disclosure Number: IPCOM000077909D
Original Publication Date: 1972-Oct-01
Included in the Prior Art Database: 2005-Feb-25
Document File: 1 page(s) / 11K

Publishing Venue

IBM

Related People

Beitel, BJ: AUTHOR [+2]

Abstract

This programming technique provides for the management of any unordered set of equal size entries. This is accomplished by maintaining only a count of the number of entries in the set. Addition of entries is performed by incrementing the entry count and placing the new entry adjacent to the last previous entry. Deletion is done by replacing the entry to be deleted by the last entry in the set and decrementing the entry count. The advantages for this type of organization are: 1) entries are always packed together with no imbedded free space or need for complex reorganization. 2) no pointers are necessary to locate space for the next entry.

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

Page 1 of 1

Maintenance of an Unordered Set of Equal Size Entries

This programming technique provides for the management of any unordered set of equal size entries. This is accomplished by maintaining only a count of the number of entries in the set. Addition of entries is performed by incrementing the entry count and placing the new entry adjacent to the last previous entry. Deletion is done by replacing the entry to be deleted by the last entry in the set and decrementing the entry count.

The advantages for this type of organization are:
1) entries are always packed together with no imbedded free

space or need for complex reorganization.
2) no pointers are necessary to locate space for the next entry.

The technique has application to tables, directories, indexes or any data file with these characteristics.

1