Method and apparatus for detecting duplicate messages

{
  "publication_number": "US2014304238A1",
  "country": "US",
  "kind": "A1",
  "title": "Method and apparatus for detecting duplicate messages",
  "abstract": "An approach is provided for detect duplicate messages with multiple probabilistic data structures. A de-duplication platform causes, at least in part, a representing of one or more messages in two or more probabilistic data structures. The de-duplication platform further causes, at least in part, an alternating clearing of the two or more probabilistic data structures as respective probabilistic data structures are filled with the one or more messages to respective thresholds, with the two or more probabilistic data structures facilitating determination of one or more duplicates among the one or more messages.",
  "claims": [
    "1. A method comprising facilitating a processing of and/or processing (1) data and/or (2) information and/or (3) at least one signal, the (1) data and/or (2) information and/or (3) at least one signal based, at least in part, on the following: a representing of one or more messages in two or more probabilistic data structures; and an alternating clearing of the two or more probabilistic data structures as respective data structures are filled with the one or more messages to respective thresholds, wherein the two or more probabilistic data structures facilitate determination of one or more duplicates among the one or more messages. 2. A method of claim 1, wherein the alternating clearing is alternating clearing between at least one of the two or more probabilistic data structures as at least another of the two or more probabilistic data structures is filled to the respective threshold. 3. A method of claim 2, wherein the respective threshold is based on a number of the one or more messages that are represented in the at least another of the two or more probabilistic data structures. 4. A method of claim 2, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following: a populating of the at least one of the two or more probabilistic data structures after the clearing. 5. A method of claim 1, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following: a respective counting of the one or more messages represented in the two or more probabilistic data structures. 6. A method of claim 1, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following: one or more identifiers associated with the one or more messages; and a processing of the one or more identifiers with respect to one or more hash functions of the two or more probabilistic data structures to cause, at least in part, the representing of the one or more messages. 7. A method of claim 6, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following: at least one identifier associated with at least another message; and a processing of the at least one identifier with respect to the one or more hash functions associated with the two or more probabilistic data structures to determine whether the at least another message is a duplicate of the one or more messages. 8. A method of claim 1, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following: a deleting of the one or more duplicates upon determination of the one or more duplicates. 9. A method of claim 1, wherein the two or more probabilistic data structures are Bloom filters. 10. A method of claim 1, wherein the one or more notifications are associated with one or more emails, one or more short message service messages, one or more multimedia messaging service messages, or a combination thereof. 11. An apparatus comprising: at least one processor; and at least one memory including computer program code for one or more programs, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following, cause, at least in part, a representing of one or more messages in two or more probabilistic data structures; and cause, at least in part, an alternating clearing of the two or more probabilistic data structures as respective probabilistic data structures are filled with the one or more messages to respective thresholds, wherein the two or more probabilistic data structures facilitate determination of one or more duplicates among the one or more messages. 12. An apparatus of claim 11, wherein the alternating clearing is alternating clearing between at least one of the two or more probabilistic data structures as at least another of the two or more probabilistic data structures is filled to the respective threshold. 13. An apparatus of claim 12, wherein the respective threshold is based on a number of the one or more messages that are represented in the at least another of the two or more probabilistic data structures. 14. An apparatus of claim 12, wherein the apparatus is further caused to: cause, at least in part, a populating of the at least one of the two or more probabilistic data structures after the clearing. 15. An apparatus of claim 11, wherein the apparatus is further caused to: cause, at least in part, a respective counting of the one or more messages represented in the two or more probabilistic data structures. 16. An apparatus of claim 11, wherein the apparatus is further caused to: determine one or more identifiers associated with the one or more messages; and process and/or facilitate a processing of the one or more identifiers with respect to one or more hash functions of the two or more probabilistic data structures to cause, at least in part, the representing of the one or more messages. 17. An apparatus of claim 16, wherein the apparatus is further caused to: determine at least one identifier associated with at least another message; and process and/or facilitate a processing of the at least one identifier with respect to the one or more hash functions associated with the two or more probabilistic data structures to determine whether the at least another message is a duplicate of the one or more messages. 18. An apparatus of claim 11, wherein the apparatus is further caused to: cause, at least in part, a deleting of the one or more duplicates upon determination of the one or more duplicates. 19. An apparatus of claim 11, wherein the two or more probabilistic data structures are Bloom filters. 20. An apparatus of claim 11, wherein the one or more notifications are associated with one or more emails, one or more short message service messages, one or more multimedia messaging service messages, or a combination thereof. 21.- 48. (canceled)"
  ],
  "cpc": [
    "H04L 51/212",
    "G06F 17/30156"
  ],
  "assignees": [
    "NOKIA CORP"
  ],
  "filing_date": "2013-04-05",
  "publication_date": "2014-10-09",
  "priority_date": "2013-04-05",
  "application_number": "US-201313857769-A",
  "family_id": "51655218",
  "citations": [
    "US2005149734A1",
    "US2006294311A1",
    "US2007248084A1",
    "US2008154852A1",
    "US2009182726A1",
    "US2010306812A1",
    "US2011219205A1",
    "US2011276744A1",
    "US2011289102A1",
    "US2013145104A1",
    "US2013226972A1",
    "US8055633B2"
  ]
}