skip to main content
10.1145/1266894.1266940acmconferencesArticle/Chapter ViewAbstractPublication PagesdebsConference Proceedingsconference-collections
Article

Scalable event matching for overlapping subscriptions in pub/sub systems

Published:20 June 2007Publication History

ABSTRACT

Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of operators, such as comparison on primitive data types (string, integer, etc). In this paper, we consider a publish/subscribe system that supports more flexible events/subscriptions with the use of advanced, yet potentially expensive, matching operators. Examples of such operators are pattern recognizers on multimedia data and spatial operators on location data. We study a critical problem in these publish/subscribe systems, namely how to optimize the matching process for a large number of subscriptions. This is achieved by exploiting the overlap in the subscriptions and sharing the operator evaluation results whenever possible. We formulate the optimal subscription evaluation problem and show that it is NP-Hard. We propose an efficient d-approximation algorithm, where d is the maximum number of operators in one subscription, as well as a heuristic algorithm that can further improve the system performance in practice. Our experiment results show that the proposed algorithms can reduce the matching cost by up to 80%, as compared to a naive strategy that evaluates the subscriptions independently.

References

  1. M. K. Aguilera, R. E. Strom, D. C. Sturman, M. Astley, and T. D. Chandra. Matching events in a content-based subscription system. In PODC '99: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pages 53--61, Atlanta, Georgia, USA, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Altinel and M. J. Franklin. Efficient filtering of XML documents for selective dissemination of information. In VLDB '00: Proceedings of the 26th International Conference on Very Large Data Bases, pages 53--64, Cairo, Egypt, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Arora and M. Sudan. Improved low-degree testing and its applications. In STOC '97: Proceedings of the 29th ACM Symposium on Theory of Computing, pages 485--495, El Paso, Texas, USA, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Beckett. RDF/XML syntax specification. http://www.w3.org/TR/rdf-syntax-grammar.Google ScholarGoogle Scholar
  6. A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems, 19(3):332--383, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C.-Y. Chan, P. Felber, M. Garofalakis, and R. Rastogi. Efficient filtering of XML documents with XPath expressions. The VLDB Journal, 11(4):354--379, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Chaudhuri and K. Shim. Optimization of queries with user-defined predicates. ACM Transactions on Database Systems, 24(2):177--228, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. Chen, D. DeWitt, and J. Naughton. Design and evaluation of alternative selection placement strategies in optimizing continuous queries. In ICDE '02: Proceedings of the 18th International Conference on Data Engineering, pages 345--356, San Jose, California, USA, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Chen, D. DeWitt, F. Tian, and Y. Wang. NiagaraCQ: A scalable continuous query system for internet databases. In SIGMOD '00: Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 379--390, Dallas, Texas, USA, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. P. A. Chirita, S. Idreos, M. Koubarakis, and W. Nejdl. Publish/subscribe for RDF-based P2P networks. In ESWS '04: Proceedings of the 1st European Semantic Web Symposium, pages 182--197, Heraklion, Greece, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  12. M. Cilia, C. Bornhoevd, and A. P. Buchmann. CREAM: An infrastructure for distributed, heterogeneous event-based applications. In Proceedings of the International Conference on Cooperative Information Systems, pages 482--502, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  13. G. Cugola, E. D. Nitto, and A. Fuggetta. Exploiting an event-based infrastructure to develop complex distributed systems. In ICSE '98: Proceedings of the 20th International Conference on Software Engineering, pages 261--270, Kyoto, Japan, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. N. Dalvi, S. Sanghai, P. Roy, and S. Sudarshan. Pipelining in multi-query optimization. In PODS '01: Proceedings of the 20th ACM Symposium on Principles of Database Systems, pages 59--70, Santa Barbara, California, USA, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. O. Etzioni, S. Hanks, T. Jiangx, R. M. Karp, O. Madani, and O. Waarts. Efficient information gathering on the Internet. In FOCS '96: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 234--243, Burlington, Vermont, USA, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. Hellerstein and M. Stonebraker. Predicate migration: Optimizing queries with expensive predicates. In SIGMOD '93: Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 267--276, Washington, D.C., USA, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. S. Madden, M. Shah, J. Hellerstein, and V. Raman. Continuously adaptive continuous queries over streams. In SIGMOD '02: Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 49--60, Madison, Wisconsin, USA, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. H. Mistry, P. Roy, S. Sudarshan, and K. Ramamritham. Materialized view selection and maintenance using multi-query optimization. In SIGMOD '01: Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 307--318, Santa Barbara, California, USA, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. Pereira, F. Fabret, H.-A. Jacobsen, F. Llirbat, and D. Shasha. WebFilter: A high-throughput XML-based publish and subscribe system. In VLDB '01: Proceedings of the 27th International Conference on Very Large Data Bases, pages 723--724, Roma, Italy, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. M. Petrovic, I. Burcea, and H.-A. Jacobsen. S-ToPSS: Semantic Toronto publish/subscribe system. In VLDB '03: Proceedings of 29th International Conference on Very Large Data Bases, pages 1101--1104, Berlin, Germany, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. M. Petrovic, H. Liu, and H.-A. Jacobsen. G-ToPSS: Fast filtering of graph-based metadata. In WWW '05: Proceedings of the 14th International Conference on World Wide Web, pages 539--547, Chiba, Japan, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. J. Wang, B. Jin, and J. Li. An ontology-based publish/subscribe system. In Middleware '04: Proceedings of the 5th ACM/IFIP/USENIX International Conference on Middleware, pages 232--253, Toronto, Canada, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Scalable event matching for overlapping subscriptions in pub/sub systems

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      DEBS '07: Proceedings of the 2007 inaugural international conference on Distributed event-based systems
      June 2007
      275 pages
      ISBN:9781595936653
      DOI:10.1145/1266894

      Copyright © 2007 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 20 June 2007

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate130of553submissions,24%

      Upcoming Conference

      DEBS '24

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader