IP Library Granted Patent US 8,630,200
Granted Patent B2
US 8,630,200 · App. 13/117,817 · Granted Jan 14, 2014

Method and apparatus for embedding information in a short URL

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,630,200
App. No.
13/117,817
Granted
Jan 14, 2014
Kind
B2
Abstract

A uniform resource locator (URL) encoding system and method are provided for embedding message information in a compressed URL includes associating a link identifier with a first URL, the first URL identifying a target web page. A message identifier representative of at least one message parameter is generated and the link identifier and the message identifier are combined using a reversible pairing function to generate a first combined identifier, the first combined identifier in a first base number system. The first combined identifier is converted to a second combined identifier in a second base number system which is greater than the first base number system. The second URL is generated using the second combined identifier.

Claims (68)

1. A uniform resource locator (URL) encoding method for embedding message information in a compressed URL, said method comprising:

associating a link identifier with a first URL, said first URL identifying a target web page;

generating a message identifier representative of at least one message parameter;

combining said link identifier and said message identifier using a reversible pairing function to generate a first combined identifier, said first combined identifier in a first base number system;

converting said first combined identifier to a second combined identifier, said second combined identifier in a second base number system which is greater than the first base number system; and

generating the second URL using said second combined identifier.

2. The method of claim 1 , wherein said at least one message parameter is selected from one or both of: (a) a first value representative of a recipient of a message to be sent to the recipient; and (b) a second value representative of a transmission channel of the message to be sent to the recipient.

3. The method of claim 2 , further comprising:

associating a recipient identifier with the recipient of the message to be sent to the recipient;

associating a channel identifier with the transmission channel of the message to be sent to the recipient;

wherein said message identifier is generated by reversibly combining said recipient identifier and said channel identifier.

4. The method of claim 3 , wherein said channel identifier is a single digit and said message identifier is generated by appending said channel identifier to said recipient identifier.

5. The method of claim 1 , wherein said link identifier and said message identifier are base 10 integers.

6. The method of claim 1 , wherein the first base numbering system is base 10 and the second base numbering system is selected from the group consisting of base 26, base 52, and base 62.

7. The method of claim 1 , wherein the second URL is generated by adding URL designations for protocol, domain, and top-level domain to said second combined identifier.

8. The method of claim 7 , wherein the protocol is a hypertext transfer protocol.

9. The method of claim 1 , wherein the first URL is an uncompressed URL.

10. The method of claim 1 , further comprising:

prior to generating said second URL, appending said second combined identifier with a first special character representative of a first decoding algorithm.

11. The method of claim 10 , further comprising:

generating a third URL using said link identifier, recipient identifier, and said channel identifier;

comparing a number of characters in said second URL with a number of characters in said third URL to determine which of the second URL and the third URL has the fewest number of characters; and

inserting the one of the second URL and the third URL that has the fewest number of characters into the message to be sent to the recipient.

12. The method of claim 11 , wherein said third URL is generated by:

converting said link identifier from a third base number system to a compressed link identifier in a fourth base number system which is greater than the third base number system;

converting said recipient identifier from the third base number system to a compressed recipient identifier in the fourth base number system;

converting said channel identifier from the third base number system to a compressed channel identifier in the fourth base number system;

generating a delimited character string combining said compressed link identifier, said compressed recipient identifier, and said compressed channel identifier;

appending said delimited character string with a second special character representative of a second decoding algorithm to generate an appended delimited character string; and

generating the third URL using said appended delimited character string.

13. A computer system configured to embed message information in a compressed URL, said computer system comprising:

a processor;

a memory in electronic communication with the processor; and

instructions stored in said memory, the instructions being executable to:

associate a link identifier with a first URL, said first URL identifying a target web page;

generate a message identifier representative of at least one message parameter;

combine said link identifier and said message identifier using a reversible pairing function to generate a first combined identifier, said first combined identifier in a first base number system;

convert said first combined identifier to a second combined identifier, said second combined identifier in a second base number system which is greater than the first base number system; and

generate the second URL using said second combined identifier.

14. The computer system of claim 13 , wherein said at least one message parameter is selected from one or both of: (a) a first value representative of a recipient of a message to be sent to the recipient; and (b) a second value representative of a transmission channel of the message to be sent to the recipient.

15. The computer system of claim 14 , wherein the instructions are further executable to:

associate a recipient identifier with the recipient of the message to be sent to the recipient;

associate a channel identifier with the transmission channel of the message to be sent to the recipient;

wherein said message identifier is generated by reversibly combining said recipient identifier and said channel identifier.

16. The computer system of claim 15 , wherein said channel identifier is a single digit and said message identifier is generated by appending said channel identifier to said recipient identifier.

17. The computer system of claim 13 , wherein said link identifier and said message identifier are base 10 integers.

18. The computer system of claim 13 , wherein the first base numbering system is base 10 and the second base numbering system is selected from the group consisting of base 26, base 52, and base 62.

19. The computer system of claim 13 , wherein the instructions are further executable to generate the second URL by adding URL designations for protocol, domain, and top-level domain to said second combined identifier.

20. The computer system of claim 19 , wherein the protocol is a hypertext transfer protocol.

21. The computer system of claim 13 , wherein the first URL is an uncompressed URL.

22. The computer system of claim 13 , wherein the instructions are further executable to append said second combined identifier with a first special character representative of a first decoding algorithm prior to generating said second URL.

23. The computer system of claim 22 , wherein the instructions are further executable to:

generate a third URL using said link identifier, recipient identifier, and said channel identifier;

compare a number of characters in said second URL with a number of characters in said third URL to determine which of the second URL and the third URL has the fewest number of characters; and

insert the one of the second URL and the third URL that has the fewest number of characters into the message to be sent to the recipient.

24. The computer system of claim 23 , wherein the instructions are further executable to generate said third URL by:

converting said link identifier from a third base number system to a compressed link identifier in a fourth base number system which is greater than the third base number system;

converting said recipient identifier from the third base number system to a compressed recipient identifier in the fourth base number system;

converting said channel identifier from the third base number system to a compressed channel identifier in the fourth base number system;

generating a delimited character string combining said compressed link identifier, said compressed recipient identifier, and said compressed channel identifier;

appending said delimited character string with a second special character representative of a second decoding algorithm to generate an appended delimited character string; and

generating the third URL using said appended delimited character string.

25. A computer system configured to embed message information in a compressed URL, said computer system comprising:

means for associating a link identifier with a first URL, said first URL identifying a target web page;

means for generating a message identifier representative of at least one message parameter;

means for combining said link identifier and said message identifier using a reversible pairing function to generate a first combined identifier, said first combined identifier in a first base number system;

means for converting said first combined identifier to a second combined identifier, said second combined identifier in a second base number system which is greater than the first base number system; and

means for generating the second URL using said second combined identifier.

Assignments (7)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 13, 2024
From: MELTWATER NEWS INTERNATIONAL HOLDINGS GMBH
To: MELTWATER NEWS US, INC
Reel/Frame 066753/0871 →
INTELLECTUAL PROPERTY SECURITY AGREEMENT SUPPLEMENT Recorded Jan 3, 2024
From: MELTWATER NEWS US INC.
To: DNB BANK ASA, AS SECURITY AGENT
Reel/Frame 066159/0082 →
TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS Recorded Dec 3, 2020
From: VCP CAPITAL MARKETS, LLC
To: MELTWATER NEWS INTERNATIONAL HOLDINGS GMBH
Reel/Frame 054585/0273 →
RELEASE OF SECURITY INTEREST Recorded Mar 6, 2019
From: SILICON VALLEY BANK
To: MELTWATER NEWS INTERNATIONAL HOLDINGS GMBH
Reel/Frame 048517/0251 →
SECURITY INTEREST Recorded Mar 1, 2019
From: MELTWATER NEWS INTERNATIONAL HOLDINGS GMBH
To: VCP CAPITAL MARKETS, LLC
Reel/Frame 048483/0425 →
SECURITY INTEREST Recorded Dec 19, 2016
From: MELTWATER NEWS INTERNATIONAL HOLDINGS GMBH
To: SILICON VALLEY BANK
Reel/Frame 040673/0305 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 15, 2011
From: ST. JEAN, JAMES D.; BRUNETTE, DAVID
To: MELTWATER NEWS INTERNATIONAL HOLDINGS, GMBH
Reel/Frame 026913/0049 →