On the Benefits of Non-Canonical Filtering in Publish/Subscribe Systems

Current matching approaches in pub/sub systems only allow conjunctive subscriptions. Arbitrary subscriptions have to be transformed into canonical expressions, e.g., DNFs, and need to be treated as several conjunctive subscriptions. This technique is known from database systems and allows us to apply more efficient filtering algorithms. Since pub/sub systems are the contrary to traditional database systems, it is questionable if filtering several canonical subscriptions is the most efficient and scalable way of dealing with arbitrary subscriptions. In this paper we show that our filtering approach supporting arbitrary Boolean subscriptions is more scalable and efficient than current matching algorithms requiring transformations of subscriptions into DNFs

Special Libraries, December 1964

Volume 55, Issue 10https://scholarworks.sjsu.edu/sla_sl_1964/1009/thumbnail.jp

Special Libraries, December 1964

Volume 55, Issue 10https://scholarworks.sjsu.edu/sla_sl_1964/1009/thumbnail.jp

Special Libraries, December 1961

Volume 52, Issue 10https://scholarworks.sjsu.edu/sla_sl_1961/1009/thumbnail.jp

Special Libraries, February 1964

Volume 55, Issue 2https://scholarworks.sjsu.edu/sla_sl_1964/1001/thumbnail.jp

Special Libraries, February 1962

Volume 53, Issue 2https://scholarworks.sjsu.edu/sla_sl_1962/1001/thumbnail.jp

Special Libraries, May-June 1957

Volume 48, Issue 5https://scholarworks.sjsu.edu/sla_sl_1957/1004/thumbnail.jp

Special Libraries, January 1956

Volume 47, Issue 1https://scholarworks.sjsu.edu/sla_sl_1956/1000/thumbnail.jp