Surety is performing system maintenance this weekend. Electronic date stamps on new Prior Art Database disclosures may be delayed.
Browse Prior Art Database

SQUADRONS: Dynamic creation of fully qualified path name

IP.com Disclosure Number: IPCOM000012068D
Original Publication Date: 2003-Apr-04
Included in the Prior Art Database: 2003-Apr-04
Document File: 2 page(s) / 42K

Publishing Venue



A method is disclosed for dynamically migrating groups of files that are related by some characteristic from one location to another on a computer system without requiring the software to be modified. The method requires the software to create fully qualified pathnames (or "absolute pathnames") for the files it accesses according to the algorithm disclosed below.

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

Page 1 of 2

SQUADRONS: Dynamic creation of fully qualified path name

On computer systems it is often required to migrate groups of files that are related by some characteristic from one location to another. If the applications or programs that operate on this data use "fully qualified" or "absolute" filenames, they will all have to be modified with the new location. One commonly used method for accomplishing this is to use "symbolic links" in the system itself allowing the administrator to redirect these links to the new location. For example:

Suppose that an application needs access to a group of files located in a folder named "A". And that folder currently exists at location "B" in the computer filesystem. The application could hard code the fully qualified filename as "/B/A/{filename}. However, if, for example, the location of the files changed from "B" to "C" the applications would all have to be updated to now access "/C/A/{filename}".

The existing solution of using symbolic links would make this migration easier. For example, the symbolic link "Z" could be set by the system administrator to initially point to location "B". The applications would be programmed to access "/Z/A/{filename}". If at a later time the system administrator wanted to migrate these files from "B" to "C", only the symbolic link "Z" would have to be updated to now point to location "C". The applications would not have to be modified.

One drawback to this solution would be in a simulation or testing environment where you may have multiple instances of these applications running. Each group of applications would need access to their own set of data files. Since symbolic links are on a system-wide basis, this would not be possible.

Another solution is needed.

The method disclosed solves this general problem and allows multiple sets of applications to have their data files located separately from one another. Instead of using symbolic links, the location of folder "A" (in this example, initially located at "B") would be specified in a database (or other lookup mechanism). The application would first look up the value for the initial part of the pathname (originally "B") and then append "A" to it. This would give the...