Selectivity-sensitive shared evaluation of multiple continuous XPath queries over XML streams

  • Authors:
  • Hyun-Ho Lee;Won-Suk Lee

  • Affiliations:
  • Division of Computer Information, Anyang Technical College, San39-1 Anyang3-Dong Manan-Gu, Anyang-Si, Gyeonggi-Do, Republic of Korea;Department of Computer Science, Yonsei University, 13 Shinchon-Dong Sedaemoon-Gu, Seoul, Republic of Korea

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2009

Quantified Score

Hi-index 0.07

Visualization

Abstract

One of the primary issues confronting XML message brokers is the difficulty associated with processing a large set of continuous XPath queries over incoming XML streams. This paper proposes a novel system designed to present an effective solution to this problem. The proposed system transforms multiple XPath queries before their run-time into a new data structure, called an XP-table, by sharing their common constraints. An XP-table is matched with a stream relation (SR) transformed from a target XML stream by a SAX parser. This arrangement is intended to minimize the run-time workload of continuous query processing. In addition, an early-query-termination strategy is proposed as an improved alternative to the basic approach. It optimizes query processing by arranging the evaluation sequence of the member-lists (m-lists) of an XP-table adaptively and offers increased efficiency, especially in cases of low selectivity. System performance is estimated and verified through a variety of experiments, including comparisons with previous approaches such as YFilter and LazyDFA. The proposed system is practically linear-scalable and stable for evaluating a set of XPath queries in a continuous and timely fashion.