Mo Lin
Abstract
The content-based publish/subscribe model emerging in recent years has been used widely.A key problem for the implementation of this model is how to match the published messages and the subscriptions efficiently.The paper detailedly discusses this problem by analyzing two typical message-matching algorithms.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The content-based publish/subscribe model emerging in recent years has been used widely.A key problem for the implementation of this model is how to match the published messages and the subscriptions efficiently.The paper detailedly discusses this problem by analyzing two typical message-matching algorithms.
Key concepts: Computer science, Publication, Key (lock), Matching (statistics), Content (measure theory), Distributed computing, Computer network, World Wide Web