Efficient evaluation of multiple queries on streamed XML fragments

  • Authors:
  • Huan Huo;Rui Zhou;Guoren Wang;Xiaoyun Hui;Chuan Xiao;Yongqian Yu

  • Affiliations:
  • Institute of Computer System, Northeastern University, Shenyang, China;Institute of Computer System, Northeastern University, Shenyang, China;Institute of Computer System, Northeastern University, Shenyang, China;Institute of Computer System, Northeastern University, Shenyang, China;Institute of Computer System, Northeastern University, Shenyang, China;Institute of Computer System, Northeastern University, Shenyang, China

  • Venue:
  • WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the prevalence of Web applications, expediting multiple queries over streaming XML has become a core challenge due to one-pass processing and limited resources. Recently proposed Hole-Filler model is low consuming for XML fragments transmission and evaluation; however existing work addressed the multiple query problem over XML tuple streams instead of XML fragment streams. By taking advantage of schema information for XML, this paper proposes a model of tid+ tree to construct multiple queries over XML fragments and to prune off duplicate and dependent operations. Based on tid+ tree, it then proposes a notion of FQ-Index as the core in M-XFPro to index both multiple queries and XML fragments for processing multiple XPath queries involving simple path and twig path patterns. We illustrate the effectiveness of the techniques developed with a detailed set of experiments.