Method and systems for hyperlinking files

• US 20060059212A1
• Filed: 10/02/2003
• Published: 03/16/2006
• Est. Priority Date: 11/28/2002
• Status: Active Grant

• Current Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Original Assignee: International Business Machines Corporation
• Inventors: Carro, Fernando Incertis
• Granted Patent: US 7,330,863 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/955 using information identifiers, e.g. uniform resource locators [URL]
• CPC Class Codes: Y10S 707/99956 File allocation

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.

Claims

1-11. -11. (canceled)

12. 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 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₁, T₂, . . . , T_N having an associated N target file addresses respectively denoted as A₁, A₂, . . . , A_N, said method comprising:

encoding 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₁, A₂, . . . , 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; and

storing the composite filename in said computer readable medium.

13. The method of claim 12, wherein the target file T_i is a source file of the main file such that A_i is a source file address of the source file T_i, and wherein i is selected from the group consisting of 1, 2, . . . , and N.

14. The method of claim 13, wherein the source file address A_i is a Universal Resource Locator (URL) of an Internet web page.

15. The method of claim 12, wherein N is at least 2, wherein A is represented in a form of A₁{A₂{. . . {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.

16. The method of claim 15, 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}.

17. The method of claim 12, said method further comprising specifying predetermined character strings and associated substitute characters;

and for n=1, 2, . . . , N;

identifying in A_n at least one character string of said predetermined character strings; and

replacing in A_n each identified character string with its associated substitute character.

18. The method of claim 17, wherein an identified character string consists of one character.

19. The method of claim 17, wherein an identified character string consists of at least two characters.

20. The method of claim 12, said method further comprising:

decoding the composite filename, by parsing the composite filename, to extract from the composite filename a target file address A_i of the N target file addresses, wherein i is selected from the group consisting of 1, 2, . . . , and N; and

accessing the target file T_i at the target file address A_i.

21. The method of claim 20, said method further comprising:

analyzing the target file address A_i to determine a file type of the target file T_i; and

launching an application that is associated to the file type of the target file T_i.

22. An apparatus comprising a computer system, said computer system comprising a computer readable medium, said computer readable medium comprising software adapted to be executed by the computer system to implement a method for hyperlinking a main file with N target files, said method comprising:

encoding 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₁, A₂, . . . , 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; and

storing the composite filename in said computer readable medium.

23. The apparatus of claim 22, wherein the target file T_i is a source file of the main file such that A_i is a source file address of the source file T_i, and wherein i is selected from the group consisting of 1, 2, . . . , and N.

24. The apparatus of claim 23, wherein the source file address A_i is a Universal Resource Locator (URL) of an Internet web page.

25. The apparatus of claim 22, wherein N is at least 2, wherein A is represented in a form of A₁{A₂{. . . {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.

26. The apparatus of claim 25, 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<sub>i−

1</sub>.

27. The apparatus of claim 22, said method further comprising specifying predetermined character strings and associated substitute characters;

and for n=1, 2, . . . , N;

identifying in A_n at least one character string of said predetermined character strings; and

replacing in A_n each identified character string with its associated substitute character.

28. The apparatus of claim 27, wherein an identified character string consists of one character.

29. The apparatus of claim 27, wherein an identified character string consists of at least two characters.

30. The apparatus of claim 22, said method further comprising:

decoding the composite filename, by parsing the composite filename, to extract from the composite filename a target file address A_i of the N target file addresses, wherein i is selected from the group consisting of 1, 2, . . . , and N; and

accessing the target file T_i at the target file address A_i.

31. The apparatus of claim 30, said method further comprising:

analyzing the target file address A_i to determine a file type of the target file T_i; and

launching an application that is associated to the file type of the target file T_i.

32. 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 method comprising:

encoding 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₁, A₂, . . . , 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; and

storing the composite filename in said computer readable medium.

33. The computer readable medium of claim 32, wherein the target file T_i is a source file of the main file such that A_i is a source file address of the source file T_i, and wherein i is selected from the group consisting of 1, 2, . . . , and N.

34. The computer readable medium of claim 33, wherein the source file address A_i is a Universal Resource Locator (URL) of an Internet web page.

35. The computer readable medium of claim 32, wherein N is at least 2, wherein A is represented in a form of A₁{A₂{. . . {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.

36. The computer readable medium of claim 35, 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}.

37. The computer readable medium of claim 32, said method further comprising specifying predetermined character strings and associated substitute characters;

and for n=1,2, . . . , N;

identifying in A_n at least one character string of said predetermined character strings; and

replacing in A_n each identified character string with its associated substitute character.

38. The computer readable medium of claim 37, wherein an identified character string consists of one character.

39. The computer readable medium of claim 37, wherein an identified character string consists of at least two characters.

40. The computer readable medium of claim 32, said method further comprising:

decoding the composite filename, by parsing the composite filename, to extract from the composite filename a target file address A_i of the N target file addresses, wherein i is selected from the group consisting of 1, 2, . . . , and N; and

accessing the target file T_i at the target file address A_i.

41. The computer readable medium of claim 40, said method further comprising:

analyzing the target file address A_i to determine a file type of the target file T_i; and

launching an application that is associated to the file type of the target file T_i.