Welcome to the InfoSci Platform
Reference Hub3
Efficient Filtering of Branch Queries for High-Performance XML Data Services

Efficient Filtering of Branch Queries for High-Performance XML Data Services

Ryan H. Choi, Raymond K. Wong
Copyright: © 2009 |Volume: 20 |Issue: 2 |Pages: 26
ISSN: 1063-8016|EISSN: 1533-8010|ISSN: 1063-8016|EISBN13: 9781615200382|EISSN: 1533-8010|DOI: 10.4018/jdm.2009040104
Cite Article Cite Article

MLA

Choi, Ryan H., and Raymond K. Wong. "Efficient Filtering of Branch Queries for High-Performance XML Data Services." JDM vol.20, no.2 2009: pp.58-83. http://doi.org/10.4018/jdm.2009040104

APA

Choi, R. H. & Wong, R. K. (2009). Efficient Filtering of Branch Queries for High-Performance XML Data Services. Journal of Database Management (JDM), 20(2), 58-83. http://doi.org/10.4018/jdm.2009040104

Chicago

Choi, Ryan H., and Raymond K. Wong. "Efficient Filtering of Branch Queries for High-Performance XML Data Services," Journal of Database Management (JDM) 20, no.2: 58-83. http://doi.org/10.4018/jdm.2009040104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Efficient XML filtering has been the fundamental technique in recent Web service and XML publish/subscribe applications. In this article, we consider the problem of filtering a streaming XML data efficiently against a large number of branch XPath queries. To improve the performance of XML filtering, branch queries are grouped into similar queries, and the common paths between queries in the same group are identified. After performing structural matching of queries, queries are organized in a way that multiple queries can be evaluated simultaneously in the post-processing phase. In the post-processing phase, join operations are executed in a pipeline fashion, and intermediate join results are shared amongst the queries in the same group. As a result, the total number of join operations performed in the post-processing phase is significantly reduced. In addition, we also present how to efficiently return all matching elements for each matching branch query. Experiments show that our proposal is efficient and scalable compared to previous work.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.