Abstract
XML message filtering is to evaluate the path matching of a large number of registered path queries over a continuous stream of XML messages in real time. For this purpose, YFilter system has been suggested to exploit the prefix commonalities that exist among path expressions. Sharing such commonality gives the benefit of improving filtering performance through the tremendous reduction in filtering machine size. However, postfix sharing also can be useful for an XML filtering situation. For example, if a stream of XML messages does not have any defined DTD (or XML schema), the XPath queries beginning with the ancestor-descendant axis (’//’) can be used often, e.g., ’//buyer/name’, ’//seller/name’, and ’//name’, and such query type is most likely to have the postfix sharing. Therefore, in this paper, we propose a bottom up filtering approach exploiting postfix sharing against the top down approach of YFilter exploiting prefix sharing. Some experimental results show that our method has better performance in the postfix-shared scenario.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Schmidt, A.R., Waas, F., Kersten, M.L., Carey, M.J., Manolescu, I., Busse, R.: XMark: a benchmark for XML data management. In: Proceedings of VLDB, Hong Kong, China, pp. 974–985 (2002)
Dickerson, C.: RSS Growing Pains (2004), available at http://www.infoworld.com/article/04/07/16/29OPconnection_1.html
Winer, D.: RSS 2.0 Specification (2005), available at http://blogs.law.harvard.edu/tech/rss
Chalupsky, H.: OntoMorph: a translation system for symbolic knowledge. In: Proceedings of 7th international conference on knowledge representation and reasoning (KR), Breckenridge (CO US), pp. 471–482 (2000)
Candan, K.S., Hsiung, W., Chen, S., Tatemura, J., Agrawal, D.: AFilter: Adaptable XML Filtering with Prefix-Caching and Suffix-Clustering. In: Proc. of VLDB, Seoul, Korea, pp. 559–570 (2006)
Altinel, M., Franklin, M.J.: Efficient Filtering of XML Documents for Selective Dissemination of Information. In: Proc. of VLDB, Cairo, Egypt, pp. 53–64 (2000)
Petrovic, M., Liu, H., Jacobsen, H.: G-ToPSS: Fast Filtering of Graph-based Metadata. In: Proc. of the International Conference on World Wide Web, pp. 539–547 (2005)
Eugster, P.Th., Felber, P.A., Guerraoui, R., Kermarrec, A.: The Many Faces of Publish/Subscribe. ACM Computing Surveys 35(2), 114–131 (2003)
Miller, R.: RSS Traffic Burdens Publisher’s Servers (2004), available at http://news.netcraft.com/archives/2004/07/19/rss_traffic_burdens_publishers_servers.html
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)
Diao, Y., Altinel, M., Franklin, M.J., Zhang, H., Fischer, P.: Path Sharing and Predicate Evaluation for High-Performance XML Filtering. ACM Transactions on Database Systems 28(4), 467–516 (2003)
XML Path Language (XPath) Version 1.0, http://www.w3.org/TR/xpath
YFilter 1.0 release, http://yfilter.cs.umass.edu/code_release.htm
Mena, E., Kashyap, V., Illarramendi, A., Sheth, A.: Domain Specific Ontologies for Semantic Information Brokering on the Global Information Infrastructure. In: Proc. of the International Conference on Formal Ontology in Information Systems, pp. 269–283 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, J., Kim, Y., Park, S. (2007). PosFilter: An Efficient Filtering Technique of XML Documents Based on Postfix Sharing. In: Cooper, R., Kennedy, J. (eds) Data Management. Data, Data Everywhere. BNCOD 2007. Lecture Notes in Computer Science, vol 4587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73390-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-73390-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73389-8
Online ISBN: 978-3-540-73390-4
eBook Packages: Computer ScienceComputer Science (R0)