DBScholar

Back to papers

MuSE Graphs for Flexible Distribution of Event Stream Processing in Networks

Summary: MuSE graphs enable multi-sink, arbitrary-projection CEP distribution, surpassing single-sink constraints. They prove correctness, provide a cost model and a pruning-enabled algorithm; evaluation shows up to three orders of magnitude reduction in network transmissions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6270
Venue
SIGMOD
Year
2021
Pagerank
5.2528121e-05
Overall Rank
9,564 | 34.39%
DOI
10.1145/3448016.3457318

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{akili_sigmod21,
        title = {{MuSE Graphs for Flexible Distribution of Event Stream Processing in Networks}},
        author = {Akili, Samira and Weidlich, Matthias},
        series = {{SIGMOD} '21},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3448016.3457318},
        url = {https://dl.acm.org/doi/10.1145/3448016.3457318},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers