2008 · 68 citations · 24 references
ComputingComputer ScienceDatabasesDigital CommunicationInformation RetrievalContent Management SystemsRoutingRouting AlgorithmsRouting ProtocolsBloom FiltersData DisseminationPublish-subscribe CommunicationPublish-subscribe Systems
Achieving expressive and efficient content-based routing in publish/subscribe systems is a difficult problem. Traditional approaches prove to be either inefficient or severely limited in their expressiveness and flexibility. We present a novel routing method, based on Bloom filters, which shows high efficiency while simultaneously preserving the flexibility of content-based schemes. The resulting implementation is a fast, flexible and fully decoupled content-based publish/subscribe system.
24
Space/time trade-offs in hash coding with allowable errors
Burton H. Bloom · Communications of the ACM · 1970 · 7.5K citations · Full text
Forwarding in a content-based network
Antonio Carzaniga, Alexander L. Wolf · 2003 · 326 citations · Full text