Method and computer program product for converting message identification codes using a conversion map accesible via a data link

• US 5,793,970 A
• Filed: 07/11/1996
• Issued: 08/11/1998
• Est. Priority Date: 07/11/1996
• Status: Expired due to Term

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Morais, Dinarte, Fakes, Thomas F., Benson, Max L.
• Primary Examiner(s): Kim, Kenneth S.
• Application Number:
  US08/680,214
• Time in Patent Office: 761 Days
• Field of Search: 711/202, 395/200.76, 395/616, 395/200.46, 395/200.49, 379/93.24, 707/1
• US Class Current: 709/216
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

In an electronic mail system comprising a local computer that can be connected to a message server over a data link, mechanisms are provided to convert large identification codes used by the message server to store and access messages and folders into shorter identification codes used by the local computer to access locally stored copies of the messages or folders. The large server identification codes, including a 46-byte folder codes and 70-byte message codes, are converted using a conversion technique that operates in one of two modes, depending on whether the data link to a master conversion map on the message server is available and operative. In the first mode, to convert the codes to 8-byte codes, the technique uses a local cache that retains mapping information produced in conversions using the master conversion map. In the second mode, three types of local maps are implemented as B-trees are used to convert the codes first to the 8-byte codes and then to 4-byte codes. In a reverse conversion using one of the B-tree maps, a 4-byte code is converted back to a 46 or 70-byte code.

Claims

1. In an electronic mail system comprising a local computer that can be connected to a message server over a data link either to access messages that are collected into folders on the message server, or to copy messages and folders to the local computer for access offline, and wherein each message and each folder has an identifier that is globally unique throughout the electronic mail system but where each message and each folder is stored on the local computer and server with identifiers shorter in length than the globally unique identifiers, a method of converting a globally unique identifier comprising a first part and a second part to a smaller identifier that is used to access a message or folder, the method comprising the steps of:

determining whether to access a local conversion man or a master conversion map accessible via the data link; and

depending on the outcome of the determination, selecting said local map or said master conversion map to serve as a conversion map;

using said conversion map to produce an index from the first part, the index being smaller than the first part; and

combining the index with the second part to produce the smaller identifier.

2. The method of claim 1, wherein the method further comprises using a second conversion map to produce a third identifier that can be used to access folders or messages from the smaller identifier.

3. The method of claim 2, wherein the third identifier is used to access a message or folder stored in a message store located at the local computer.

4. The method of claim 3, wherein the global identifier is associated with a message store located at the server.

5. The method of claim 2, wherein the third message identifier is used to access a message or folder stored in a message store located at the server.

6. The method of claim 2, wherein the method comprises using said conversion map to convert a folder identifier that can be used to access a folder.

7. The method of claim 2, wherein the method further comprises storing the smaller identifier so that the global identifier can subsequently be derived from the smaller identifier in a reverse conversion using the conversion map.

8. The method of claim 2, wherein at least one of the conversion maps comprise a B-tree.

9. The method of claim 2, wherein at least one of the conversion maps utilize a cache.

10. The method of claim 1, wherein

the local conversion map comprises a subset of the contents of the master conversion map;

and

the master conversion map comprises a full set of mapping information for producing the index from the first part.

11. The method of claim 10, wherein the method further comprises accumulating the subset by retaining mapping information obtained during a previous instance of a conversion using the master conversion map.

12. The method of claim 11, wherein the method further comprises using the master conversion map if the index cannot be produced initially using the local conversion map.

13. The method of claim 11, wherein the method further comprises starting with an empty local conversion map when messaging software is started.

14. The method of claim 11, wherein a message at a message store accessible via the data link is stored using the smaller identifier.

15. The method of claim 11, wherein the method comprises using the conversion map to convert a folder identifier.

16. The method of claim 1, wherein the conversion produces an identifier used to access a folder or message stored in an off-line message store.

17. The method of claim 1, wherein the conversion produces an identifier used to access a folder or a message stored in a message store accessible via the data link.

18. In an electronic mail system comprising a local computer that can be connected to a message server over a data link either to access messages that are collected into folders on the message server, or to copy messages and folders to the local computer for access offline, and wherein each message and each folder has an identifier that is globally unique throughout the mail system but where each message and folder are stored on the local computer and server with identifiers shorter in length than the globally unique identifiers, as an article of manufacture, a computer program product for converting a globally unique identifier to a second smaller identifier that is used to access a message or folder, said computer program product comprising:

computer-readable storage medium having computer executable instructions encoded thereon comprising;

means for determining whether to access a local conversion map or a master conversion map, accessible via the data link;

means for selecting said local map or said master conversion map to server as a conversion map depending on the outcome;

means for using said conversion map to produce an index from the first part, the index being smaller than the first part; and

means for combining the index with the second part to produce the smaller identifier.

19. The computer program product of claim 18, wherein the instructions further comprise means for causing the system to use a second conversion map to produce a third identifier that can be used to access folders or messages from the smaller identifier.

20. The computer program product of claim 19, wherein the third message identifier is used to access a message or folder stored in a message store located at the local computer.

21. The computer program product of claim 20, wherein the global identifier is associated with a message store located at the server.

22. The computer program product of claim 19, wherein the third message identifier is used to access a message or folder stored in a message store located at the server.

23. The computer program product of claim 19, wherein the instructions further comprise means for causing the system to use the conversion map to convert a folder identifier that can be used to access a folder.

24. The computer program product of claim 19, wherein the instructions further comprise means for causing the system to store the smaller identifier so that the global identifier can subsequently be derived from the smaller identifier in a reverse conversion using the conversion map.

25. The computer program product of claim 19, wherein at least one of the conversion maps comprise a B-tree.

26. The computer program product of claim 19, wherein at least one of the conversion maps utilize a cache.

27. The computer program product of claim 18, wherein

the local conversion map comprises a subset of the contents of the master conversion map;

and

the master conversion map comprises a full set of mapping information for producing the index from the first part.

28. The computer program product or claim 27, wherein the instructions further comprise means for causing the system to accumulate the subset by retaining mapping information obtained during a previous instance of a conversion using the master conversion map.

29. The computer program product of claim 28, wherein the instructions further comprise means for causing the system to use the master conversion map if the index cannot be produced initially using the local conversion map.

30. The computer program product of claim 28, wherein the instructions further comprise means for causing the system to start with an empty local conversion map when messaging software is started.

31. The computer program product of claim 28, wherein a message at a message store accessible via the data link is stored using the smaller identifier.

32. The computer program product of claim 28, wherein the instructions comprise means for causing the system to use the conversion map to convert a folder identifier.

33. The computer program product of claim 18, wherein the conversion produces an identifier used to access a folder or message stored in an off-line message store.

34. The computer program product of claim 18, wherein the conversion produces an identifier used to access a folder or message stored in a message store accessible via the data link.