METHOD AND SYSTEMS FOR HYPERLINKING FILES
First Claim
1. 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 1, said method comprising:
- hyperlinking a primary filename of the main file with N target file addresses to form a composite filename, wherein the primary filename has a form of F.E, wherein the composite filename has a form of F(A).E, wherein F represents a name component of the primary filename, wherein E represents an extension component of the primary filename, wherein the N target files are denoted as T1, T2, . . . , TN having the associated N target file addresses respectively denoted as A1, A2, . . . , AN, wherein A represents A1, A2, . . . , AN, wherein symbol (between said F and said A denotes a first control character that separates said F and said A, wherein symbol between said A and said E denotes a second control character that separates said A and said E, wherein the second control character differs from the first control character, and wherein a target file of the N target files consists of metadata, a computer program, a text document, graphics, a picture, audio, video, or a combination thereof; and
storing the composite filename in said computer readable medium.
2 Assignments
0 Petitions
Accused Products
Abstract
According to the method of the invention, a set of target files is linked to a main file by encoding the target addresses or URLs of these target files into the primary filename of the main file. Separator characters are used to distinguish the primary filename of the main file and the encoded address of each linked target file. Linked target files may be of any kind including, source files of the main file, metadata, multimedia information and services. Since most file systems do not accept certain characters on valid filenames, addresses of linked target files are encoded so that any forbidden character is replaced by an associated authorized character. A lexicography table stores all pairs of forbidden and corresponding authorized characters. Likewise, since filenames length is generally limited to 256 characters, the encoding process may be optimized to reduce the length of the encoded addresses or URLs.
58 Citations
21 Claims
-
1. 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 1, said method comprising:
-
hyperlinking a primary filename of the main file with N target file addresses to form a composite filename, wherein the primary filename has a form of F.E, wherein the composite filename has a form of F(A).E, wherein F represents a name component of the primary filename, wherein E represents an extension component of the primary filename, wherein the N target files are denoted as T1, T2, . . . , TN having the associated N target file addresses respectively denoted as A1, A2, . . . , AN, wherein A represents A1, A2, . . . , AN, wherein symbol (between said F and said A denotes a first control character that separates said F and said A, wherein symbol between said A and said E denotes a second control character that separates said A and said E, wherein the second control character differs from the first control character, and wherein a target file of the N target files consists of metadata, a computer program, a text document, graphics, a picture, audio, video, or a combination thereof; and
storing the composite filename in said computer readable medium.
-
-
2. The method of claim 1, wherein the target file Ti is a source file of the main file such that Ai is a source file address of the source file Ti, and wherein i is selected from the group consisting of 1, 2, . . . , and N.
-
3. The method of claim 1, wherein N is at least 2, wherein A is represented in a form of A1{A2{ . . . {AN, and wherein said symbol { denotes a third control character that separates An−
- 1 and An for n=2, . . . , N, and wherein the third control character differs from both the first control character and the second control character.
-
4. The method of claim 3, said method further comprising determining whether corresponding path portions of two consecutive target file addresses Ai and Ai 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 Ai, 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 Ai 1.
- 1, and if said determining determines that said corresponding path portions is a common path then;
-
5. The method of claim 1, said method further comprising specifying predetermined character strings and associated substitute characters;
- and for n=1, 2, . . . , N;
identifying in An at least one character string of said predetermined character strings; and
replacing in An each identified character string with its associated substitute character.
- and for n=1, 2, . . . , N;
-
6. The method of claim 1, said method further comprising:
-
decoding the composite filename, by parsing the composite filename, to extract from the composite filename a target file address Ai of the N target file addresses, wherein i is selected from the group consisting of 1, 2, . . . , and N; and
accessing the target file Ti at the target file address Ai.
-
-
7. The method of claim 6, said method further comprising:
-
analyzing the target file address Ai to determine a file type of the target file Ti; and
launching an application that is associated to the file type of the target file Ti.
-
-
8. An apparatus comprising a computer system, said computer system comprising a computer readable medium, said computer readable medium comprising software configured to be executed by the computer system to implement a method for hyperlinking a main file with N target files, said main file and said N target files being stored in the computer system, said N at least 1, said method comprising:
-
hyperlinking a primary filename of the main file with N target file addresses to form a composite filename, wherein the primary filename has a form of F.E, wherein the composite filename has a form of F(A).E, wherein F represents a name component of the primary filename, wherein E represents an extension component of the primary filename, wherein the N target files are denoted as T1, T2, . . . , TN having the associated N target file addresses respectively denoted as A1, A2, . . . , AN, wherein A represents A1, A2, . . . , AN, wherein symbol (between said F and said A denotes a first control character that separates said F and said A, wherein symbol between said A and said E denotes a second control character that separates said A and said E, wherein the second control character differs from the first control character, and wherein a target file of the N target files consists of metadata, a computer program, a text document, graphics, a picture, audio, video, or a combination thereof; and
storing the composite filename in said computer readable medium.
-
-
9. The apparatus of claim 8, wherein the target file Ti is a source file of the main file such that Ai is a source file address of the source file Ti, and wherein i is selected from the group consisting of 1, 2, . . . , and N.
-
10. The apparatus of claim 8, wherein N is at least 2, wherein A is represented in a form of A1{A2{ . . . {AN, and wherein said symbol { denotes a third control character that separates An−
- 1 and An for n=2, . . . , N, and wherein the third control character differs from both the first control character and the second control character.
-
11. The apparatus of claim 10, said method further comprising determining whether corresponding path portions of two consecutive target file addresses Ai and Ai 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 Ai, 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 Ai 1.
- 1, and if said determining determines that said corresponding path portions is a common path then;
-
12. The apparatus of claim 8, said method further comprising specifying predetermined character strings and associated substitute characters;
- and for n=1, 2, . . . , N;
identifying in An at least one character string of said predetermined character strings; and
replacing in An each identified character string with its associated substitute character.
- and for n=1, 2, . . . , N;
-
13. The apparatus of claim 8, said method further comprising:
-
decoding the composite filename, by parsing the composite filename, to extract from the composite filename a target file address Ai of the N target file addresses, wherein i is selected from the group consisting of 1, 2, . . . , and N; and
accessing the target file Ti at the target file address Ai.
-
-
14. The apparatus of claim 13, said method further comprising:
-
analyzing the target file address Ai to determine a file type of the target file Ti; and
launching an application that is associated to the file type of the target file Ti.
-
-
15. A computer readable medium comprising software adapted to be executed by a computer system to implement a method for hyperlinking a main file with N target files, said main file and said N target files being stored in the computer system, said N at least 1, said method comprising:
-
hyperlinking a primary filename of the main file with N target file addresses to form a composite filename, wherein the primary filename has a form of F.E, wherein the composite filename has a form of F(A).E, wherein F represents a name component of the primary filename, wherein E represents an extension component of the primary filename, wherein the N target files are denoted as T1, T2, . . . , TN having the associated N target file addresses respectively denoted as A1, A2, . . . , AN, wherein A represents A1, A2, . . . , AN, wherein symbol (between said F and said A denotes a first control character that separates said F and said A, wherein symbol) between said A and said E denotes a second control character that separates said A and said E, wherein the second control character differs from the first control character, and wherein a target file of the N target files consists of metadata, a computer program, a text document, graphics, a picture, audio, video, or a combination thereof; and
storing the composite filename in said computer readable medium.
-
-
16. The computer readable medium of claim 15, wherein the target file Ti is a source file of the main file such that Ai is a source file address of the source file Ti, and wherein i is selected from the group consisting of 1, 2, . . . , and N.
-
17. The computer readable medium of claim 15, wherein N is at least 2, wherein A is represented in a form of A1{A2{ . . . {AN, and wherein said symbol { denotes a third control character that separates An−
- 1 and An for n=2, . . . , N, and wherein the third control character differs from both the first control character and the second control character.
-
18. The computer readable medium of claim 17, said method further comprising determining whether corresponding path portions of two consecutive target file addresses Ai and Ai 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 Ai, 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 Ai 1.
- 1, and if said determining determines that said corresponding path portions is a common path then;
-
19. The computer readable medium of claim 15, said method further comprising specifying predetermined character strings and associated substitute characters;
- and for n=1, 2, . . . , N;
identifying in An at least one character string of said predetermined character strings; and
replacing in An each identified character string with its associated substitute character.
- and for n=1, 2, . . . , N;
-
20. The computer readable medium of claim 15, said method further comprising:
-
decoding the composite filename, by parsing the composite filename, to extract from the composite filename a target file address Ai of the N target file addresses, wherein i is selected from the group consisting of 1, 2, . . . , and N; and
accessing the target file Ti at the target file address Ai.
-
-
21. The computer readable medium of claim 20, said method further comprising:
-
analyzing the target file address Ai to determine a file type of the target file Ti; and
launching an application that is associated to the file type of the target file Ti.
-
Specification