Patent US5793970A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5793970A Expired / Lapsed US ⏱️ 0.0 years remaining

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

Assignee: Microsoft Technology Licensing LLC
•
Filing: 1996-07-11
•
Granted: 1998-08-11
•
Expires: 2016-07-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

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.

Inventors

  • 👤 Thomas F. Fakes
  • 👤 Dinarte Morais
  • 👤 Max L. Benson

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-05 11:57
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/10

Claims Analysis

Total Claims: 36
Claim 1
Independent Claim 200 words
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.
Claim 2
Dependent Claim 200 words
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.
Claim 3
Dependent Claim 33 words
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.
Claim 4
Dependent Claim 27 words
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.
Claim 5
Dependent Claim 19 words
The method of claim 3, wherein the global identifier is associated with a message store located at the server.
Claim 6
Dependent Claim 27 words
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.
Claim 7
Dependent Claim 26 words
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.
Claim 8
Dependent Claim 35 words
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.
Claim 9
Dependent Claim 16 words
The method of claim 2, wherein at least one of the conversion maps comprise a B-tree.
Claim 10
Dependent Claim 16 words
The method of claim 2, wherein at least one of the conversion maps utilize a cache.
Claim 11
Dependent Claim 41 words
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.
Claim 12
Dependent Claim 30 words
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.
Claim 13
Dependent Claim 27 words
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.
Claim 14
Dependent Claim 22 words
The method of claim 11, wherein the method further comprises starting with an empty local conversion map when messaging software is started.
Claim 15
Dependent Claim 23 words
The method of claim 11, wherein a message at a message store accessible via the data link is stored using the smaller identifier.
Claim 16
Dependent Claim 18 words
The method of claim 11, wherein the method comprises using the conversion map to convert a folder identifier.
Claim 17
Dependent Claim 24 words
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.
Claim 18
Dependent Claim 29 words
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.
Claim 19
Dependent Claim 211 words
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.
Claim 20
Dependent Claim 211 words
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.
Claim 21
Dependent Claim 41 words
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.
Claim 22
Dependent Claim 30 words
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.
Claim 23
Dependent Claim 21 words
The computer program product of claim 20, wherein the global identifier is associated with a message store located at the server.
Claim 24
Dependent Claim 29 words
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.
Claim 25
Dependent Claim 35 words
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.
Claim 26
Dependent Claim 43 words
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.
Claim 27
Dependent Claim 18 words
The computer program product of claim 19, wherein at least one of the conversion maps comprise a B-tree.
Claim 28
Dependent Claim 18 words
The computer program product of claim 19, wherein at least one of the conversion maps utilize a cache.
Claim 29
Dependent Claim 43 words
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.
Claim 30
Dependent Claim 38 words
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.
Claim 31
Dependent Claim 35 words
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.
Claim 32
Dependent Claim 30 words
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.
Claim 33
Dependent Claim 25 words
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.
Claim 34
Dependent Claim 26 words
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.
Claim 35
Dependent Claim 26 words
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.
Claim 36
Dependent Claim 30 words
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.

References Cited (Backward Citations)

US5029074A Cited
US4914577A Cited
US5307494A Cited
US5202983A Cited
US5247676A Cited
US5218699A Cited
US5283856A Cited
US5537543A Cited
US5627996A Cited
US5434914A Cited
US5701462A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-08-10 2002-02-09 2002-08-11 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-08-10 2006-02-09 2006-08-11 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-08-10 2010-02-09 2010-08-11 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag