The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Matching events in a content-based subscription system
Abstract
Content-based subscription systems are an emerging alternative to traditional publish-subscribe systems, because they permit more flexible subscriptions along multiple dimensions. In these systems, each subscription is a predicate which may test arbitrary attributes within an event. However, the matching problem for content-based systems — determining for each event the subset of all subscriptions whose predicates match the event — is still an open problem. We present an efficient, scalable solution to the matching problem. Our solution has an expected time complexity that is sub-linear in the number of subscriptions, and it has a space complexity that is linear. Specifically, we prove that for predicates reducible to conjunctions of elementary tests, the expected time to match a random event is no greater than O(N 1;) where N is the number of subscriptions, and is a closed-form expression that depends on the number and type of attributes (in some cases, 1=2). We present some optimizations to our algorithms that improve the search time. We also present the results of simulations that validate the theoretical bounds and that show acceptable performance levels for tens of thousands of subscriptions. 1
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The process group approach to reliable distributed computing
Birman, K. P. (1993) · Communications of the ACM · doi:10.1145/163298.163303 · Cited by 729
The Information Bus: an architecture for extensible distributed systems
Oki, B., Pfluegl, M., Siegel, A., & Skeen, D. (1993) · Proceedings of the fourteenth ACM symposium on Operating systems principles - SOSP '93 · doi:10.1145/168619.168624 · Cited by 401
Consul: a communication substrate for fault-tolerant distributed programs
Mishra, S., Peterson, L. L., & Schlichting, R. D. (1993) · Distributed Systems Engineering · doi:10.1088/0967-1846/1/2/004 · Cited by 153
Oki, B. M., Pfluegl, M., Siegel, A., & Skeen, D. (1993) · ACM SIGOPS Operating Systems Review · doi:10.1145/173668.168624 · Cited by 106
Cited by
The many faces of publish/subscribe
Eugster, P. T., Felber, P. A., Guerraoui, R., & Kermarrec, A.-M. (2003) · ACM Computing Surveys · doi:10.1145/857076.857078 · Cited by 3,145
Design and evaluation of a wide-area event notification service
Carzaniga, A., Rosenblum, D. S., & Wolf, A. L. (2001) · ACM Transactions on Computer Systems · doi:10.1145/380749.380767 · Cited by 1,425
Sold!: auction methods for multirobot coordination
Gerkey, B. P., & Mataric, M. J. (2002) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2002.803462 · Cited by 1,012
High-performance complex event processing over streams
Wu, E., Diao, Y., & Rizvi, S. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142520 · Cited by 835
Processing flows of information: From data stream to complex event processing
Cugola, G., & Margara, A. (2012) · ACM Computing Surveys · doi:10.1145/2187671.2187677 · Cited by 833
Metadata
- Authors
- Aguilera, M. K., Strom, R. E., Sturman, D. C., Astley, M., & Chandra, T. D.
- Venue
- Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
- Publisher
- ACM
- Published
- 1999-05
- Pages
- 53-61
- OpenAlex
- W2067580069
- Cited by
- 638
- References
- 4
- FWCI
- 16.12
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.