Matching engine for comparing data feeds with user profile criteria

• US 8,713,174 B2
• Filed: 09/14/2012
• Issued: 04/29/2014
• Est. Priority Date: 03/21/2006
• Status: Active Grant

• Current Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Original Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Inventors: Sobotka, David C., Austin-Lane, Christopher E., Eranti, Vijay K.
• Primary Examiner(s): Pollack, Melvin H
• Application Number:
  US13/620,557
• Publication Number:
  US 20130073723A1
• Time in Patent Office: 592 Days
• Field of Search: 709/224
• US Class Current: 709/224
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation

Abstract

An event notification matching system, including an event matching table forming a plurality of nodes. Each node is assigned a subscriber request value and contains identifiers for one or more subscribers to be notified at the occurrence of an event relating to the subscriber request value. The event notification matching system may also include a table index. The table index receives input values from an event processing module and selects one or more of the nodes that have subscriber request values corresponding to the received input values. The event processor receives event data from a predetermined source, and formats the input values to simplify the operations performed by the event matching table. The event notification matching system is configured such that the event data need not be compared to non-matching nodes in the event matching table.

Claims

1. A method comprising:

receiving a request from a user to receive a notification if an event occurs;

translating, using at least one processor, the request into a request value;

receiving event data relating to occurrence of events;

formatting the event data into input values;

identifying, using at least one processor, if any of the input values match the request value by comparing the input values to only a subset of request values; and

if the input value matches the request value, sending the notification to the user.

2. The method as recited in claim 1, wherein the request value is a unique value.

3. The method as recited in claim 1, wherein identifying if any of the input values match the request value comprises determining if a single input value matches the request value.

4. The method as recited in claim 3, wherein identifying if any of the input values match the request value excludes comparing the input values to request values that do not match any of the input values.

5. The method as recited in claim 1, further comprising linking an identifier associated with the user to the request value.

6. The method as recited in claim 5, further comprising:

receiving an additional request from an additional user to receive an additional notification if the event occurs;

linking an additional identifier associated with the additional user to the request value; and

sending the notification to each user associated with identifiers linked to the request value upon determining that the input value matches the request value.

7. The method as recited in claim 6, wherein the additional request differs from the request.

8. The method as recited in claim 1, further comprising maintaining an event matching table organizing nodes into a hierarchy, the hierarchy including:

a plurality of parent nodes including a first parent node being associated with the request value and a group of one or more users who have requested to be notified at an occurrence of the event; and

a plurality of sub-nodes, at least one sub-node being linked to a parent node of the plurality of parent nodes, the at least one sub-node being associated with an event that is predicated on the occurrence of an event associated with the parent node.

9. The method as recited in claim 8, wherein if a sub-node can be linked to two or more parent nodes to form a duplicate request value combinations, linking the sub-node to the parent node associated with a request value that is least likely to occur.

10. A system comprising:

at least one processor; and

at least one non-transitory computer readable storage medium storing instructions thereon that, when executed by the at least one processor, cause the system to;

receive a request from a user to receive a notification if an event occurs;

receive event data relating to occurrence of events;

translate the request into a request value;

format the event data into input values;

identify if any of the input values match the request value by comparing the input values to only a subset of request values; and

send the notification to the user if the input value matches the request value.

11. The system as recited in claim 10, wherein identifying if any of the input values match the request value comprises determining if a single input value matches the request value.

12. The system as recited in claim 11, wherein the request value is a unique value.

13. The system as recited in claim 12, wherein identifying if any of the input values match the request value excludes comparing the input value to request values that do not match the input value.

14. The system as recited in claim 13, further comprising instructions that when executed cause the system to link an identifier associated with the user to the request value.

15. The system as recited in claim 14, further comprising instructions that when executed cause system to store an event matching table organizing nodes into a hierarchy, the hierarchy including:

a plurality of parent nodes including a first parent node being associated with the request value and a group of one or more users who have requested to be notified at an occurrence of the event; and

a plurality of sub-nodes, at least one sub-node being linked to a parent node of the plurality of parent nodes, the at least one sub-node being associated with an event that is predicated on the occurrence of an event associated with the parent node.

16. The system as recited in claim 15, wherein if a sub-node can be linked to two or more parent nodes to form a duplicate request value combinations, linking the sub-node to the parent node associated with a request value that is least likely to occur.

17. A method comprising:

receiving requests from users to receive notifications upon occurrence of events;

translating the requests into request values;

receiving event data relating to the occurrence of events;

formatting the event data into input values;

identifying, using at least one processor, matches between the input values and the request values by comparing the input values to a subset of request values;

sending notifications to users associated with request values that match input values.

18. The method as recited in claim 17, further comprising maintaining an event matching table organizing nodes into a hierarchy, the hierarchy including:

a plurality of parent nodes including a first parent node being associated with the request value and a group of one or more users who have requested to be notified at an occurrence of the event; and

a plurality of sub-nodes, at least one sub-node being linked to a parent node of the plurality of parent nodes, the at least one sub-node being associated with an event that is predicated on the occurrence of an event associated with the parent node.

19. The method as recited in claim 18, wherein if a sub-node can be linked to two or more parent nodes to form a duplicate request value combinations, linking the sub-node to the parent node associated with a request value that is least likely to occur.

20. The method as recited in claim 18, further comprising maintaining a plurality of event matching tables, wherein each event matching table is dedicated to a unique topic.