Yanlei Diao and Michael Franklin

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-03-1228
February 2003

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2003/CSD-03-1228.pdf

XML filtering solutions developed to date have focused on the matching of documents or elements to large numbers of queries but have not addressed the customization of output needed for emerging distributed information infrastructures. Support for such customization can significantly increase the complexity of the filtering process. In this paper, we show how to leverage an efficient, shared path matching engine to extract the specific XML elements needed to generate customized output in an XML Message Broker. We compare three different approaches that differ in the degree to which they exploit the shared path matching engine. We also present techniques to optimize the post-processing of the path matching engine output, and to enable the sharing of such processing across queries. We evaluate these techniques with a detailed performance study of our implementation.

BibTeX citation:

@techreport{Diao:CSD-03-1228,
    Author = {Diao, Yanlei and Franklin, Michael},
    Title = {Query Processing for High-Volume XML Message Brokering},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2003},
    Month = {Feb},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2003/5348.html},
    Number = {UCB/CSD-03-1228},
    Abstract = {XML filtering solutions developed to date have focused on the matching of documents or elements to large numbers of queries but have not addressed the customization of output needed for emerging distributed information infrastructures. Support for such customization can significantly increase the complexity of the filtering process. In this paper, we show how to leverage an efficient, shared path matching engine to extract the specific XML elements needed to generate customized output in an XML Message Broker. We compare three different approaches that differ in the degree to which they exploit the shared path matching engine. We also present techniques to optimize the post-processing of the path matching engine output, and to enable the sharing of such processing across queries. We evaluate these techniques with a detailed performance study of our implementation.}
}

EndNote citation:

%0 Report
%A Diao, Yanlei
%A Franklin, Michael
%T Query Processing for High-Volume XML Message Brokering
%I EECS Department, University of California, Berkeley
%D 2003
%@ UCB/CSD-03-1228
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2003/5348.html
%F Diao:CSD-03-1228