Runtime-efficient approach for multiple continuous filtering in XML message brokers

Hyunho Lee, Wonsuk Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

XML message brokers play a key role in exchanging information in ubiquitous environments. One of their core technical issues is difficulty associated with processing a set of XPath queries for multiple continuous filtering over incoming XML streams. This paper proposes a novel system designed to provide an epochal solution to this problem. The proposed system provides efficient data structures and matching algorithm in order to minimize the runtime workload of continuous filtering over XML streams. Also, the performance of proposed approach is verified through a variety of experiments, including comparisons with YFilter. The proposed approach is practically linear-scalable and stable in terms of processing a set of XPath queries in a continuous and timely fashion. Furthermore, this approach consistently outperforms YFilter, particularly under conditions of low selectivity.

Original languageEnglish
Title of host publicationSOFSEM 2007
Subtitle of host publicationTheory and Practice of Computer Science - 33rd Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
Pages738-749
Number of pages12
Publication statusPublished - 2007 Dec 1
Event33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007 - Harrachov, Czech Republic
Duration: 2007 Jan 202007 Jan 26

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4362 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007
CountryCzech Republic
CityHarrachov
Period07/1/2007/1/26

Fingerprint

XML
XPath
Filtering
Comparison of Experiments
Query
Matching Algorithm
Processing
Selectivity
Workload
Data structures
Data Structures
Minimise
Experiments

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Lee, H., & Lee, W. (2007). Runtime-efficient approach for multiple continuous filtering in XML message brokers. In SOFSEM 2007: Theory and Practice of Computer Science - 33rd Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (pp. 738-749). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4362 LNCS).
Lee, Hyunho ; Lee, Wonsuk. / Runtime-efficient approach for multiple continuous filtering in XML message brokers. SOFSEM 2007: Theory and Practice of Computer Science - 33rd Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. 2007. pp. 738-749 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{683f23ecb519409b90bea0684d9a9d6a,
title = "Runtime-efficient approach for multiple continuous filtering in XML message brokers",
abstract = "XML message brokers play a key role in exchanging information in ubiquitous environments. One of their core technical issues is difficulty associated with processing a set of XPath queries for multiple continuous filtering over incoming XML streams. This paper proposes a novel system designed to provide an epochal solution to this problem. The proposed system provides efficient data structures and matching algorithm in order to minimize the runtime workload of continuous filtering over XML streams. Also, the performance of proposed approach is verified through a variety of experiments, including comparisons with YFilter. The proposed approach is practically linear-scalable and stable in terms of processing a set of XPath queries in a continuous and timely fashion. Furthermore, this approach consistently outperforms YFilter, particularly under conditions of low selectivity.",
author = "Hyunho Lee and Wonsuk Lee",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "9783540695066",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "738--749",
booktitle = "SOFSEM 2007",

}

Lee, H & Lee, W 2007, Runtime-efficient approach for multiple continuous filtering in XML message brokers. in SOFSEM 2007: Theory and Practice of Computer Science - 33rd Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4362 LNCS, pp. 738-749, 33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007, Harrachov, Czech Republic, 07/1/20.

Runtime-efficient approach for multiple continuous filtering in XML message brokers. / Lee, Hyunho; Lee, Wonsuk.

SOFSEM 2007: Theory and Practice of Computer Science - 33rd Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. 2007. p. 738-749 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4362 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Runtime-efficient approach for multiple continuous filtering in XML message brokers

AU - Lee, Hyunho

AU - Lee, Wonsuk

PY - 2007/12/1

Y1 - 2007/12/1

N2 - XML message brokers play a key role in exchanging information in ubiquitous environments. One of their core technical issues is difficulty associated with processing a set of XPath queries for multiple continuous filtering over incoming XML streams. This paper proposes a novel system designed to provide an epochal solution to this problem. The proposed system provides efficient data structures and matching algorithm in order to minimize the runtime workload of continuous filtering over XML streams. Also, the performance of proposed approach is verified through a variety of experiments, including comparisons with YFilter. The proposed approach is practically linear-scalable and stable in terms of processing a set of XPath queries in a continuous and timely fashion. Furthermore, this approach consistently outperforms YFilter, particularly under conditions of low selectivity.

AB - XML message brokers play a key role in exchanging information in ubiquitous environments. One of their core technical issues is difficulty associated with processing a set of XPath queries for multiple continuous filtering over incoming XML streams. This paper proposes a novel system designed to provide an epochal solution to this problem. The proposed system provides efficient data structures and matching algorithm in order to minimize the runtime workload of continuous filtering over XML streams. Also, the performance of proposed approach is verified through a variety of experiments, including comparisons with YFilter. The proposed approach is practically linear-scalable and stable in terms of processing a set of XPath queries in a continuous and timely fashion. Furthermore, this approach consistently outperforms YFilter, particularly under conditions of low selectivity.

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

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

M3 - Conference contribution

AN - SCOPUS:38149061900

SN - 9783540695066

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 738

EP - 749

BT - SOFSEM 2007

ER -

Lee H, Lee W. Runtime-efficient approach for multiple continuous filtering in XML message brokers. In SOFSEM 2007: Theory and Practice of Computer Science - 33rd Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. 2007. p. 738-749. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).