Browse Prior Art Database

Alias Transport Optimization Methodology

IP.com Disclosure Number: IPCOM000110418D
Original Publication Date: 1992-Nov-01
Included in the Prior Art Database: 2005-Mar-25
Document File: 1 page(s) / 52K

Publishing Venue

IBM

Related People

Bugg, A: AUTHOR [+13]

Abstract

In a Unix*-based distributed environment, alias lists must be maintained in order to support file recovery actions requiring full state information (disaster recovery) preservation for a file object. These alias lists must be stored in a transportable form (for inventory recovery and for internal database management parsing).

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 68% of the total text.

Alias Transport Optimization Methodology

       In a Unix*-based distributed environment, alias lists
must be maintained in order to support file recovery actions
requiring full state information (disaster recovery) preservation for
a file object.  These alias lists must be stored in a transportable
form (for inventory recovery and for internal database management
parsing).

      A double indirection form is defined which provides linked-list
access to a compressed alias group.  This form is parseable and
searchable within the database, and is expandable from its stored
abstract and in memory-operational form.

      An alias list must be generated to reflect current state
information for each managed file in a Unix environment.  This alist
can become quite large and difficult to manage; in an environment in
which many files must be recoverable, the resource overhead
associated with an alias list construct becomes critical.

      Therefore, an alias list which is associated with a managed
file object is stored in a compressed but internally parseable form
in an inventory database.  Because many alists are generated, a
separate object consisting of a FIFO stack of alias pointers is
maintained for each storage group.

      The process of resolving elements of the coded form strings for
an alist entry for compare purposes (find and entry, or compare two
strings) is minimized by optimization of the address pointers, and
maintaining partially compress...