Abstract
As our best knowledge, in the Publish/Subscribe application environment, few research work has been done on the dissemination and routing of compressed XML (extended markup language) data. A high-speed compressed XML data routing and dissemination framework-BloomRouter is proposed. In BloomRouter, a Bloom Filter based pre-filtering mechanism is used to filter out compressed XML elements that users do not care; after that an interval tree disseminator forwards target elements to the corresponding end users by matching the incomming compressed XML elements with indexed users' query regions. Based on this framework, we can efficiently filter/query the compressed incoming XML data, and then route the query result to the corresponding subscriber.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Liefke H, Dan S. XMill: An efficient Compressor for XML data,Proc of the 2000ACM SIGMOD Int'l Conf on Management of Data 2000, New York, May 2000, 153–164.
Tolani P M, Haritsa J R. XGRIND: A Query-friendly XML Compressor,Proc of the 18th Int'l Conf on Data Engineering (ICDE' 02). Washington, February 2002, 225–225.
Min J K, Park M J, Chung C W,et al. XPRESS: A Queriable Compression for XML data. In:Proc of the 2003ACM SIGMOD Int'l Conf on Management of Data, New York, June 2003, 122–133.
Manolopoalos Y, Theodoridis Y, Tsotras V J.Advanced Database Indexing. Boston: Kluwer Academic Publishers, 1999, 61–81.
Papakonstantinou Y, Garcia-Molina H, Widom J. Object Exchange Across Heterogeneous Information Sources, In:Proc of the 11th Int'l Conf on Data Engineering (ICDE' 95). Washington, March 1995, 251–260.
Lelewer D A, Hirschberg D S. Data Compression,ACM Computing Surveys, 1987,19 (3): 261–296.
Cormen T H, Leiserson C E, Rivest R L.Introduction to algorithms. Cambridge: MIT Press, 1990.
Bloom B H. Space/Time Trade-Offs in Hash Coding with Allowable Errors.Communications of the ACM, 1970,13 (7): 422–426.
Diao Y, Franklin M. Query Processing for High-Volume XML Message Brokering.Proceedings of the 29th Very Large Data Bases Conference (VLDB'03), San Fransisco, September 2003. 261–272.
Altinel M, Franklin M J. Efficient Filtering of XML Documents for Selective Dissemination of Information.Proceedings of the 26th Very Large Data Bases Conference (VLDB' 00), San Fransisco, September 2000. 53–64.
Dan S. From Searching Text to Querying XML Streams.Journal of discrete algorithms, 2004,2: 17–32.
Diao Y, Rizvi S, Franklin M J. Towards an Internet-Scale XML Dissemination Service.Proceedings of the 30th Very Large Data Bases Conference (VLDB'04), San Fransisco, August 2004, 612–623.
Diao Y, Fischer P, Franklin M J,et al. YFilter: Efficient and Scalable Filtering of XML Documents.Proceedings of the 18th International Conference on Data Engineering (IC-DE'02), Washington, February 2002, 341.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National High Technology Development of China (2005AA4Z3070), the National Grand Fundamental Research 973 Program of China under Grant (G1999032705)
Biography: BAO Xiao-yuan (1971-), male, Ph. D candidate, research direction: XML database and information system
Rights and permissions
About this article
Cite this article
Xiao-yuan, B., Shi-wei, T., Dong-qing, Y. et al. BloomRouter: A framework for dissemination of compressed XML stream. Wuhan Univ. J. Nat. Sci. 11, 100–106 (2006). https://doi.org/10.1007/BF02831712
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02831712