Design of B+Tree-Based Predicate Index for Efficient Event Matching

  • Botao Wang
  • Wang Zhang
  • Masaru Kitsuregawa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2642)


Efficient event matching algorithms are the core of publish/subscribe systems. Such algorithms are typically designed based on memory structure for performance reasons. Given the explosive growth of information, it is not always practically feasible to keep the index for event filtering memory-resident, thereby necessitating the need for a secondary storage structure. Incidentally, even though search algorithms designed for active databases and spatio-temporal databases are applicable to publish/subscribe systems, these algorithms are not specifically designed for publish/subscribe systems which require both fast search as well as efficient support for dynamic insertions and deletions. To address this problem, we propose a predicate index for secondary storage structures with space complexity O(n) and search time complexity O(log n). Analytical comparison of our proposed algorithms with existing work indicates that our secondary storage predicate index is efficient for event matching.


Leaf Node Index Structure Continuous Query Binary Search Tree Event Match 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Marcos K. Aguilera, Robert E. Strom, Daniel C. Sturman, Mark Astley, Tushar D. Chandra. Matching Events in a Content-based Subscription System. Eighteenth ACM Symposium on Principles of Distributed Computing(PODC), 1999Google Scholar
  2. 2.
    Tolga Bozkaya, Meral Ozsoyoglu. Indexing transaction time database. Information Sciences 112(1998)Google Scholar
  3. 3.
    Sirish Chandrasekaran, Michael J. Franklin. Streaming Queries over Streaming Data. Proceedings of the 28th VLDB Conference, Hong Kong, 2002Google Scholar
  4. 4.
    Jiangjun Chen, David J. DeWitt, Feng Tian, Yuan Wang. NiagaraCQ: A Scalable Continuous Query System for Internet Databases. ACM SIGMOD 2000Google Scholar
  5. 5.
    Y.-J. Chiang and R. Tamassai, “Dynamic Algorithms in Computational Geometry”. Technial Report CS-91-24, Dept. of Computer Science, Brown Univ., 1991Google Scholar
  6. 6.
    Ramez Elmasri, Gene T.J. Wuu, Yeong-Joon Kim. THE TIME INDEX: AN ACCESS STRUCTURE FOR TEMPORAL DATA. VLDB 1990Google Scholar
  7. 7.
    P. Th. Eugster, P. Felber, R. Guerraoui and A.-M. Kermarrec. The Many Faces of Publish/Subscribe. Technical Report 200104, Swiss Federal Institute of TechnologyGoogle Scholar
  8. 8.
    Francoise Fabret, Francois Llirbat, Joao Pereira, Dennis Shasha. Efficient matching for Content-based Publish/Subscribe Systems. Technical report, INRIA, 2000.Google Scholar
  9. 9.
    Francoise Fabret, H. Arno Jacobsen, Francois Llirbat, Joao Pereira, Kenneth A. Ross, Dennis Shasha. Filtering Algorithms and Implementation for Very Fast Publish/Subscribe Systems. ACM SIGMOD 2001Google Scholar
  10. 10.
    Antonin Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. ACM SIGMOD 1984Google Scholar
  11. 11.
    Eric N. Hanson, Moez Chaaboun, Chang-Ho, Yu-Wang Wang. A Predicate Matching Algorithm for Database Rule Systems. ACM SIGMOD 1990Google Scholar
  12. 12.
    Eric N. Hanson, Theodore Hohnson. Selection Predicate Indexing for Active Database Using Interval Skip List. TR94-017. CIS department, Univeristy of Florida, 1994Google Scholar
  13. 13.
    Eric N. Hanson, Chris Carnes, Lan Huang, Mohan Konyala, Lloyd Noronha. Scalable Trigger Processing. ACM SIGMOD 1999Google Scholar
  14. 14.
    Annika Hinze, Sven Bittner. Efficient Distribution-Based Event Filtering. International Workshop on Distributed Event Based Systems. Austrai July 2002Google Scholar
  15. 15.
    H. Arno Jacobsen, Francoise Fabret. Publish and Subscribe Systems. Tutorial. ICDE 2001Google Scholar
  16. 16.
    Samuel Madden, Mehul Shah, Joseph Hellerstein, Vijayshankar Raman. Continuously Adaptive Continuous Queries(CACA) over Streams. ACM SIGMOD 2002Google Scholar
  17. 17.
    Rajeev Motwani. Models and Issues in Data Stream Systems. Invited Talk. PODS 2002Google Scholar
  18. 18.
    Tak W. Yan, Hector Garcia-Molina. The SIFT Information Dissemination System. In ACM TODS 2000Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Botao Wang
    • 1
  • Wang Zhang
    • 1
  • Masaru Kitsuregawa
    • 1
  1. 1.Institute of Industrial ScienceThe University of TokyoTokyoJapan

Personalised recommendations