Patent ID: 7330863

Claim:
A method for hyperlinking a main file with N target files, said main file and said N target files being stored in a computer readable medium of a computer system, said N at least 2, said main file having a primary filename of a form F.E, said F representing a name component of the primary filename, said E representing an extension component of the primary filename, said N target files denoted as T 1 , T 2 , . . . , T N having an associated N target file addresses respectively denoted as A 1 , A 2 , . . . , A N , said method comprising: hyperlinking the primary filename with the N target file addresses to form a composite filename having a form of F(A).E, said A representing A 1 , A 2 , . . . , A N , said symbol (between said F and said A denoting a first control character that separates said F and said A, said symbol) between said A and said E denoting a second control character that separates said A and said E, said second control character differing from the first control character, wherein A is represented in a form of A 1 {A 2 {. . . {A N , and wherein said symbol { denotes a third control character that separates A n−1 and A n for n=2, . . . , N, and wherein the third control character differs from both the first control character and the second control character; and storing the composite filename in said computer readable medium, said method further comprising determining whether corresponding path portions of two consecutive target file addresses A i and A i+1 is a common path, wherein i is selected from the group consisting of 1, 2, . . . , and N−1, and if said determining determines that said corresponding path portions is a common path then: inserting a fourth control character denoted by a symbol} at the end of the common path of A i , wherein the fourth control character differs from the first control character, the second control character, and the third control character; and removing the common path from A i+1 .