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

Hyun Ho Lee, Won Suk Lee

Research output: Contribution to journalArticle

5 Citations (Scopus)

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. Crown

Original languageEnglish
Pages (from-to)1984-2001
Number of pages18
JournalInformation sciences
Volume179
Issue number12
DOIs
Publication statusPublished - 2009 May 30

Fingerprint

XPath
Selectivity
XML
Query processing
Query
Table
Evaluation
Query Processing
Comparison of Experiments
Continuous Queries
Data structures
Large Set
Termination
Workload
System Performance
Arrangement
Data Structures
Sharing
Optimise
Transform

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this

@article{5c8fa47ae9df4541988df642a6b8216d,
title = "Selectivity-sensitive shared evaluation of multiple continuous XPath queries over XML streams",
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. Crown",
author = "Lee, {Hyun Ho} and Lee, {Won Suk}",
year = "2009",
month = "5",
day = "30",
doi = "10.1016/j.ins.2009.01.022",
language = "English",
volume = "179",
pages = "1984--2001",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "12",

}

Selectivity-sensitive shared evaluation of multiple continuous XPath queries over XML streams. / Lee, Hyun Ho; Lee, Won Suk.

In: Information sciences, Vol. 179, No. 12, 30.05.2009, p. 1984-2001.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Lee, Hyun Ho

AU - Lee, Won Suk

PY - 2009/5/30

Y1 - 2009/5/30

N2 - 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. Crown

AB - 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. Crown

UR - http://www.scopus.com/inward/record.url?scp=63149156172&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=63149156172&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2009.01.022

DO - 10.1016/j.ins.2009.01.022

M3 - Article

AN - SCOPUS:63149156172

VL - 179

SP - 1984

EP - 2001

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 12

ER -