Massively parallel XML twig filtering using dynamic programming on FPGAs


In recent years, XML-based Publish-Subscribe Systems have become popular due to the increased demand of timely event-notification. Users (or subscribers) pose complex profiles on the structure and content of the published messages. If a profile matches the message, the message is forwarded to the interested subscriber. As the amount of published content continues to grow, current software-based systems will not scale. We thus propose a novel architecture to exploit parallelism of twig matching on FPGAs. This approach yields up to three orders of magnitude higher throughput when compared to conventional approaches bound by the sequential aspect of software computing. This paper, presents a novel method for performing unordered holistic twig matching on FPGAs without any false positives, and whose throughput is independent of the complexity of the user queries or the characteristics of the input XML stream. Furthermore, we present experimental comparison of different granularities of twig matching, namely path-based (root-to-leaf) and pair-based (parent-child or ancestor-descendant).We provide comprehensive experiments that compare the throughput, area utilization and the accuracy of matching (percent of false positives) of our holistic, path-based and pair-based FPGA approaches.

DOI: 10.1109/ICDE.2011.5767899

Extracted Key Phrases

13 Figures and Tables

Cite this paper

@article{Moussalli2011MassivelyPX, title={Massively parallel XML twig filtering using dynamic programming on FPGAs}, author={Roger Moussalli and Mariam Salloum and Walid A. Najjar and Vassilis J. Tsotras}, journal={2011 IEEE 27th International Conference on Data Engineering}, year={2011}, pages={948-959} }