An effective XML filtering method for high-performance publish/subscribe system

Authors:
Tong Wang;Da-Xin Liu;Wei Sun;Wan-song Zhang
Affiliations:
Department of Computer Science and Technology, Harbin Engineering University, China;Department of Computer Science and Technology, Harbin Engineering University, China;Department of Computer Science and Technology, Harbin Engineering University, China;Department of Computer Science and Technology, Harbin Engineering University, China
Venue:
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Year:
2006

Citing 10
Cited 0

DTD inference for views of XML data

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML in a nutshell

XML in a nutshell
Extracting indexing information from XML DTDs

Information Processing Letters
Adding Structure to Unstructured Data

ICDT '97 Proceedings of the 6th International Conference on Database Theory
Processing XML Streams with Deterministic Automata

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Query Optimization for XML

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Efficient Filtering of XML Documents for Selective Dissemination of Information

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Exchanging intensional XML data

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Stream processing of XPath queries with predicates

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
YFilter: Efficient and Scalable Filtering of XML Documents

ICDE '02 Proceedings of the 18th International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

During the process large-scale XPath queries against fast XML streams on Internet, a bottleneck occurs due to the lack of memory for filtering. This paper presents an effective automaton method to reduce the memory need by diminishing the tedious operators (such as “//” and “*”) in XPath expressions. The method contains a product automata to convert XPath to the actual path; thus to reduce the complexity in search space. The proposed method was implemented in MFSA (Multi- Finite States Automata) system for filtering queries of subscribers. The empirical evidence shows its efficiency and stability when the scale of queries is large.