Abstract
For event filtering of publish/subscribe system, significant research efforts have been dedicated to techniques based on multiple one-dimensional indexes built on attributes of subscription. Because such kinds of techniques are efficient only in the case that operators used in predicates are equality operator (=) and attributes used in subscriptions are fixed, the flexibility and expressiveness of publish/subscribe system are limited. Event filtering on subscriptions which include not only equality operator (=) but also non-equality operators (<=, =>) without fixed attributes, is similar to query in high dimensional data space. In this paper, considering dynamic maintenance and space efficiency of publish/subscribe system, we propose an index structure for event filtering based on UB-tree. There, by dimension transform, the event filtering is regarded as high dimensional range query. The feasibility of the proposed index is evaluated in simulated publish/subscription environment. Results show that in almost all the cases, the performance our proposed index is 4 order of magnitude faster than counting algorithm. Because our index can support both equality operator (=) and non-equality operators (<=, >=), we can conclude that our proposal is efficient and flexible for event filtering of publish/subscribe system under reasonable size of dimension.
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.
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)
Bentley, J.L.: Multidimensional binary search trees used for asociative searching. Commun. ACM 18, 509–517 (1975)
Berchtold, S., Bohm, C., Kriegel, H.-P.: The Pyramid-Technique: Towards Breaking the Curse of Dimesionality. ACM SIGMOD, 142–153 (1998)
Berchtold, S., Keim, D.A.: High-Dimensional Index Structure: Database Support for Next Decade’s Application Tutorial. In: ICDE (2000)
de Berg, M., Kreveld, M.V., Overmars, M., Schwarzkopf, O.: Computational Geometry-Algorithms and Applications. Springer, Heidelberg (1998) ISBN 3-540-65620-0
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. ACM SIGMOD, 379–390 (2000)
Chiang, Y.-J., Tamassai, R.: Dynamic Algorithms in Computational Geometry. Technial Report CS-91-24, Dept. of Computer Science, Brown Univ. (1991)
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. ACM SIGMOD, 115–126 (2001)
Fenk, R., Markl, V., Bayer, R.: Inerval Processing with the UB-Tree. In: IDEAS 2002, pp. 12–22 (2002)
Gaede, V., Gnther, O.: Multidimensional Access Methods. Computing Surverys 30(2), 170–231 (1998)
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. ACM SIGMOD, 47–57 (1984)
Hanson, E.N., Chaaboun, M., Kim, C.-H., Wang, Y.-W.: A Predicate Matching Algorithm for Database Rule Systems. ACM SIGMOD, 271–280 (1990)
Hanson, E.N., Carnes, C., Huang, L., Konyala, M., Noronha, L.: Scalable Trigger Processing. In: ACM ICDE, 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. 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, 1999
Madden, S., Shah, M., Hellerstein, J., Raman, V.: Continuously Adaptive Continuous Queries(CACA) over Streams. ACM SIGMOD, 49–60 (2002)
Motwani, R.: Models and Issues in Data Stream Systems. In: PODS 2002 (2002) (Invited Talk)
Ramsak, F., Markl, V., Fenk, R., Zirkel, M., Elhardt, K., Bayer, R.: Intergrating the UB-tree into a Database System Kernel. In: VLDB 2000, pp. 253–272 (2000)
Samet, H.: The quadtree and related hierarchical data structure. ACM Computer Survery 16(2), 187–260 (1984)
Sellis, T.K., Roussopoulos, N., Faloutsos, C.: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In: VLDB 1987, pp. 278–291 (1987)
Yan, T.W., Garcia-Molina, H.: The SIFT Information Dissemination System. ACM TODS 24(4), 529–565 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, B., Zhang, W., Kitsuregawa, M. (2004). UB-Tree Based Efficient Predicate Index with Dimension Transform for Pub/Sub System. In: Lee, Y., Li, J., Whang, KY., Lee, D. (eds) Database Systems for Advanced Applications. DASFAA 2004. Lecture Notes in Computer Science, vol 2973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24571-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-24571-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21047-4
Online ISBN: 978-3-540-24571-1
eBook Packages: Springer Book Archive