Method, client device, server and article of manufacture for compressing universal resource indicators using partitioned left/right string substitution

A method for compressing a universal resource identifier URI using an immediately previous URI, comprising the steps of:

• A) partitioning an immediately previous URI and a current URI into a predetermined number of components and initializing a structure indicator for the current URI;
• B) comparing a first component of the current URI with a first component of the immediately previous URI from left-to-right LR to determine a first number representing how many LR characters of a first group are LR-matched characters;
• C) determining an encoded count of the first number of LR-matched characters of the first group;
• D) comparing the first component of the current URI with the first component of the immediately previous URI from right-to-left RL to determine a second number representing how many characters of the first group are RL-matched characters;
• E) determining an encoded count of the second number of RL-matched characters of the first group;
• F) concatenating compression indicators and updating the structure indicator in accordance with counts of the LR-matched characters, the RL matched characters and uncompressed characters, wherein an escape byte is added to an end of the uncompressed characters when a last uncompressed character has a most significant bit set to one;
• G) repeating steps B-F for each of the predetermined number of components to encode the URI based on each of the numbers of LR-matched characters, the RL-matched characters and the uncompressed characters for the components of the URI;
• H) prepending the structure indicator to the compressed components to complete the compressed URI;
• and
• I) saving the components for further comparisons.

A client device/article of manufacture for compressing a current universal resource identifier URI using an immediately previous URI where the URI has been partitioned into a plurality of components of characters before compression, comprising:

• A) a partitioner, coupled to receive the current URI and the immediately previous URI, for partitioning the immediately previous URI and the current URI into a predetermined number of components;
• B) a comparator-encoder, coupled to the partitioner, for receiving and comparing each component of the current URI with each corresponding component of the immediately previous URI from left-to-right LR and from right-to-left RL and encoding the current URI using compression indicators in accordance with counts of LR- matched characters, RL-matched characters and uncompressed characters for the URI;
• and
• C) a storage unit, coupled to the comparator-encoder and the partitioner, and is used for replicating a current register into a previous register.

A server/article of manufacture having a computer usable medium/memory with computer readable program code thereon for decompressing a universal resource identifier URI using an immediately previous URI, where the URI to be decompressed has been partitioned into a plurality of components of characters, wherein the computer readable program code is implemented by the steps of:

• decoding each component of the compressed URI by copying matched characters from each corresponding component of the immediately previous URI in accordance with a structure indicator and compression indicators for left-to-right LR matched characters and right-to-left RL matched characters;
• and copying intervening uncompressed characters of the corresponding component of the current compressed URI, decoding the compressed URI by copying matched characters from the immediately previous URI in accordance with a structure indicator and compression indicators for left-to-right LR matched characters and right-to-left RL matched characters;
• and
• copying each component of the decompressed URI from a current register into a previous register.

A client device/article of manufacture having a computer usable medium/memory with computer readable program code thereon for compressing a current universal resource identifier URI using an immediately previous URI, wherein the computer readable program code is implemented by the steps of:

• A) partitioning an immediately previous URI and a current URI into a predetermined number of components and initializing a structure indicator for the current URI;
• B) comparing a first component of the current URI with a first component of the immediately previous URI from left-to-right LR to determine a first number representing how many LR characters of a first group are LR-matched characters;
• C) determining an encoded count of the first number of LR-matched characters of the first group;
• D) comparing the first component of the current URI with the first component of the immediately previous URI from right-to-left RL to determine a second number representing how many characters of the first group are RL-matched characters;
• E) determining an encoded count of the second number of RL-matched characters of the first group;
• F) concatenating compression indicators and updating the structure indicator in accordance with counts of the LR-matched characters, the RL matched characters and uncompressed characters, wherein an escape byte is added to an end of the uncompressed characters when a last uncompressed character has a most significant bit set to one;
• G) repeating steps B-F for each of the predetermined number of components to encode the URI based on each of the numbers of LR-matched characters, the RL-matched characters and the uncompressed characters for the components of the URI;
• H) prepending the structure indicator to the compressed components to complete the compressed URI;
• and
• I) saving the components for further comparisons.