Abstract
Publish/subscribe system captures the dynamic aspect of the specified information by notifying users of interesting events as soon as possible. Fast response time is important for event filtering which requires multiple step processing and is also one of important factors to provide good service for subscribers.
Generally the event arrival rate is time varying and unpredictable. It is very possible that no event arrives in one unit time and multiple events arrive in another unit time. When multiple events with different workloads arrive at the same time, the average response time of multiple-event filtering depends on the sequence of event by event filtering.
As far as we know, significant research efforts have been dedicated to the techniques of single event filtering, they can not efficiently filter multiple events in fast response time. In this paper, we first propose a multiple-event filtering algorithm based on R-tree. By calculating relative workload of each event, event by event filtering can be executed with short-job first policy so as to improve average response time of multiple-event filtering. Furthermore, a self-adaptive model is proposed to filter multiple events in dynamically changing environment.
The multiple-event filtering algorithm and the self-adaptive model are evaluated in a simulated environment. The results show that the average response time can be improved maximum up to nearly 50%. With the self-adaptive model, multiple events can be filtered with average response time always same as or close to the possible best time in the dynamically changing environment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aguilera, M.K., Strom, R.E., Sturman, D.C., Astley, M., Chandra, T.D.: Matching Events in a Content-based Subscription System. In: Eighteenth ACM Symposium on Principles of Distributed Computing(PODC), pp. 53–61 (1999)
Bayer, R.: The Universal B-Tree for multidimensional Indexing. Technical Report TUM-I9637 (November 1996)
Bayer, R., Markl, V.: The UB-Tree: Performance of Multidiemnsional Range Queries. Technical Report TUM-I9814 (June 1998)
Beckmann, N., Kriegel, H.-P., Schneidar, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: SIGMOD, pp. 322–331 (1990)
Chandrasekaran, S., Franklin, M.J.: Streaming Queries over Streaming Data. In: Proceedings of the 28th VLDB Conference, Hong Kong, pp. 203–214 (2002)
Chen, J., DeWitt, D.J., Tian, F., Wang, Y.: NiagaraCQ: A Scalable Continuous Query System for Internet Databases. In: ACM SIGMOD, pp. 379–390 (2000)
Eugster, P.T., Felber, P., Guerraoui, R., Kermarrec, A.-M.: The Many Faces of Publish/Subscribe. Technical Report 200104, Swiss Federal Institute of Technology
Fabret, F., Jacobsen, H.A., Llirbat, F., Pereira, J., Ross, K.A., Shasha, D.: Filtering Algorithms and Implementation for Very Fast Publish/Subscribe Systems. In: ACM SIGMOD 2001, pp. 115–126 (2001)
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: ACM SIGMOD, pp. 47–57 (1984)
Hanson, E.N., Chaaboun, M., Kim, C.-H., Wang, Y.-W.: A Predicate Matching Algorithm for Database Rule Systems. In: ACM SIGMOD, pp. 271–280 (1990)
Hanson, E.N., Carnes, C., Huang, L., Konyala, M., Noronha, L.: Scalable Trigger Processing. In: ICDE 1999, pp. 266–275 (1999)
Hinze, A., Bittner, S.: Efficient Distribution-Based Event Filtering. In: International Workshop on Distributed Event Based Systems, Austrai (July 2002), pp. 525–532 (2002)
Jacobsen, H.A., Fabret, F.: Publish and Subscribe Systems, Tutorial. In: ICDE (2001)
Markl, V.: MISTRAL:Processing Relational Queries using a Multidimensional Access Tecnnique. Ph.D. Thesis, TU Munchen, 1999, published by infix Verlag, St.Augustin. DISDBIS 59, (1999) ISBN 3-89601-459-5
Madden, S., Shah, M., Hellerstein, J., Raman, V.: Continuously Adaptive Continuous Queries(CACA) over Streams. In: ACM SIGMOD, pp. 49–60 (2002)
Ramsak, F., Markl, V., Fenk, R., Zirkel, M., Elhardt, K., Bayer, R.: Intergrating the UB-tree into a Database System Kernel. In: VLDB, pp. 253–272 (2000)
Viglas, S.D., Naughton, J.F.: Rate-based query optimization for streaming information sources. In: SIGMOD Conference, pp. 37–48 (2002)
Wang, B., Zhang, W., Kitsuregawa, M.: Design of B+Tree-Based Predicate Index for Efficient Event Matching. In: Zhou, X., Zhang, Y., Orlowska, M.E. (eds.) APWeb 2003. LNCS, vol. 2642, pp. 548–559. Springer, Heidelberg (2003)
Wang, B., Zhang, W., Kitsuregawa, M.: UB-Tree Based Efficient Predicate Index with Dimension Transform for Pub/Sub System. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 63–74. Springer, Heidelberg (2004)
Whang, K.Y., Krishnamurthy, R.: The Multilevel Grid File - A Dynamic Hierarchical Multidimensional File Structure. In: DASFAA, pp. 449–458 (1991)
Yan, T.W., Garcia-Molina, H.: The SIFT Information Dissemination System. ACM TODS 24(4), 529–565 (1999)
Zhang, W.: Performance Analysis of Ub-Tree Indexed Publish/Subscribe System. Master Thesis. Department of Information and Communication Engineering, The University of Tokyo (March 2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, B., Zhang, W., Kitsuregawa, M. (2005). A Self-Adaptive Model to Improve Average Response Time of Multiple-Event Filtering for Pub/Sub System. In: Zhou, L., Ooi, B.C., Meng, X. (eds) Database Systems for Advanced Applications. DASFAA 2005. Lecture Notes in Computer Science, vol 3453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11408079_26
Download citation
DOI: https://doi.org/10.1007/11408079_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25334-1
Online ISBN: 978-3-540-32005-0
eBook Packages: Computer ScienceComputer Science (R0)