Skip to main content

An XML Publish/Subscribe Algorithm Implemented by Relational Operators

  • Conference paper
Advances in Data and Web Management (APWeb 2007, WAIM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4505))

Abstract

An XML publish/subscribe algorithm needs to store large numbers of XPath or XQuery subscriptions and match subscriptions with published XML documents. Since the number of the subscriptions may be very large, the performance and the scalability of the algorithm may be critical. The scalability of the method of constructing a large finite state automata or decision tree for all subscriptions is limited by amount of available physical memory. In this paper, we will introduce an XML publish/subscribe algorithm which is consisted of the publish algorithm, subscribe algorithm, and matching algorithm. The matching algorithm uses relational operators to match subscriptions with publications inside a relational database, so the scalability of the algorithm is no longer limited by amount of available physical memory. Experimental results show that the matching algorithm has very good performance and scalability.

Supported by NSF of China Grants 60473051 and 60503037, NSF of Beijing China Grant 4062018, and National High-Technical Project of China Grant 2006AA01Z230.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chen, J., DeWitt, D.J., Tian, F., Wang, Y.: NiagaraCQ: A Scalable Continuous Query System for Internet Databases. In: Proceedings of SIGMOD, pp. 379–390 (2000)

    Google Scholar 

  2. Seshadri, P.: Building Notification Services with Microsoft SQLServer. In: Proceedings of SIGMOD, pp. 635–636 (2003)

    Google Scholar 

  3. Zeller, H.: NonStop SQL/MX Publish/Subscribe: Continuous Data Streams in Transaction Processing. In: Proceedings of SIGMOD, p. 636 (2003)

    Google Scholar 

  4. Aguilera, M.K., Strom, R.E., Sturman, D.C., Astley, M., Chandra, T.D.: Matching Events in a Content-Based Subscription System. In: Proceedings of PODC, pp. 53–61 (1999)

    Google Scholar 

  5. Altinel, M., Franklin, M.J.: Efficient Filtering of XML Documents for Selective Dissemination of Information. In: Proceedings of VLDB, pp. 53–64 (2000)

    Google Scholar 

  6. Diao, Y., Fischer, P.M., Franklin, M.J., To, R.: YFilter: Efficient and Scalable Filtering of XML Documents. In: Proceedings of ICDE, p. 341 (2002)

    Google Scholar 

  7. Chan, C.Y., Felber, P., Garofalakis, M.N., Rastogi, R.: Efficient Filtering of XML Documents with XPath Expressions. In: Proceedings of ICDE, pp. 235–244 (2002)

    Google Scholar 

  8. Chan, C.Y., Felber, P., Garofalakis, M.N., Rastogi, R.: Efficient filtering of XML documents with XPath Expressions. VLDB Journal 11(4), 354–379 (2002)

    Article  MATH  Google Scholar 

  9. Green, T.J., Miklau, G., Onizuka, M., Suciu, D.: Processing XML Streams with Deterministic Automata. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 173–189. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Peng, F., Chawathe, S.S.: XPath Queries on Streaming Data. In: Proceedings of SIGMOD, pp. 431–442 (2003)

    Google Scholar 

  11. Gupta, A.K., Suciu, D.: Stream Processing of XPath Queries with Predicates. In: Proceedings of SIGMOD, pp. 419–430 (2003)

    Google Scholar 

  12. Tian, F., Reinwald, B., Pirahesh, H., Mayr, T., Myllymaki, J.: Implementing A Scalable XML Publish/Subscribe System Using Relational Database Systems. In: Proceedings of SIGMOD, pp. 479–490 (2004)

    Google Scholar 

  13. Yoshikawa, M., Amagasa, T., Shimura, T., Uemura, S.: XRel: A Path-based Approach to Storage and Retrieval of XML Documents Using Relational Databases. ACM Transactions on Internet Technology 1(1), 110–141 (2001)

    Article  Google Scholar 

  14. Amagasa, T., Yoshikawa, M., Uemura, S.: QRS: A Robust Numbering Scheme for XML Documents. In: Proceedings of ICDE, pp. 705–707 (2003)

    Google Scholar 

  15. Tatarinov, I., Viglas, S., Beyer, K.S., Shanmugasundaram, J., Shekita, E.J., Zhang, C.: Storing and Querying Ordered XML Using a Relational Database System. In: Proceedings of SIGMOD, pp. 204–215 (2002)

    Google Scholar 

  16. Cohen, E., Kaplan, H., Milo, T.: Labeling Dynamic XML Trees. In: Proceedings of PODS, pp. 271–281 (2002)

    Google Scholar 

  17. Wu, X., Lee, M.-L., Hsu, W.: A Prime Number Labeling Scheme for Dynamic Ordered XML Trees. In: Proceedings of ICDE, pp. 66–78 (2004)

    Google Scholar 

  18. Mignet, L., Barbosa, D., Veltri, P.: Web XML: A First Study. In: Proceedings of WWW, pp. 500–510 (2003)

    Google Scholar 

  19. http://tarantella.gsfc.nasa.gov/xml/dataset_dtd.txt

  20. http://www.alphaworks.ibm.com/tech/xmlgenerator

Download references

Author information

Authors and Affiliations

Authors

Editor information

Guozhu Dong Xuemin Lin Wei Wang Yun Yang Jeffrey Xu Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Zhao, J., Yang, D., Gao, J., Wang, T. (2007). An XML Publish/Subscribe Algorithm Implemented by Relational Operators. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds) Advances in Data and Web Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72524-4_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72524-4_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72483-4

  • Online ISBN: 978-3-540-72524-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics