Unambiguous syntactic eXtensible Markup Language query matching on eXtensible Markup Language streams

Abstract

We propose a method of syntactic pattern recognition for e Xtensible Markup Language query matching on e Xtensible Markup Language streams. A set of declarative grammar rules is generated, and then its parser, which is produced by full-fledged compiler tools, can be used to match multiple queries concurrently with only one-time scan on e Xtensible Markup Language streams. The grammar is proved unambiguous with lemmas and theorems. We also analyze the time complexity and prove the correctness of multiple-query matching. Several experiments were conducted to demonstrate the efficiency and scalability of the proposed method in various aspects. As a result, the proposed method is beneficial for building efficient e Xtensible Markup Language–based publish/subscribe applications.