BFilter: Efficient XML Message Filtering and Matching in Publish/Subscribe Systems

@article{Dai2016BFilterEX,
  title={BFilter: Efficient XML Message Filtering and Matching in Publish/Subscribe Systems},
  author={Liang Dai and Chung-Horng Lung and Shikharesh Majumdar},
  journal={J. Softw.},
  year={2016},
  volume={11},
  pages={376-402}
}
XML message filtering and matching are important operations for the application layer XML message multicast. As a publish/subscribe system and a specific case of content-based multicast in the application layer, XML message multicast depends highly on the data filtering and matching processes. As the XML applications emerge, efficient XML message filtering and matching become more desirable. Many XML filtering techniques have been proposed in the literature. Most of those techniques do not… 
3 Citations

MESA: An Efficient Matching Scheme in Content-Based Publish/Subscribe System with Simplified Bayesian Approach

TLDR
An efficient matching scheme with simplified Bayesian networks approach, named MESA, is proposed to filter the inconsequential event in content-based PS system and shows that the MESA scheme is efficient, robust and accurate on large-scale uncertain data sets.

References

SHOWING 1-10 OF 39 REFERENCES

BFilter - A XML Message Filtering and Matching Approach in Publish/Subscribe Systems

TLDR
BFilter is proposed, which evaluates user queries that use backward matching branch points to delay further matching processes until branch points match in the XML document and user query and has better performance than the well-known YFilter for complex queries.

FiST: Scalable XML Document Filtering by Sequencing Twig Patterns

TLDR
A novel scalable filtering system called FiST (Filtering by Sequencing Twigs) that transforms twig patterns expressed in XPath and XML documents into sequences using Prufer's method, and organizes the sequences into a dynamic hash based index for efficient filtering.

Fast XML document filtering by sequencing twig patterns

TLDR
This article proposes a novel scalable filtering system called iFiST that transforms user profiles of a twig pattern expressed in XPath into sequences using the Prüfer's method, and demonstrates that the holistic matching approach reduces filtering cost and memory consumption, thereby improving the scalability of FiST.

System architecture and effect of depth of query on XML document filtering using PFilter

  • Preeti SaxenaRaj Kamal
  • Computer Science
    2013 Sixth International Conference on Contemporary Computing (IC3)
  • 2013
TLDR
Experimental results are given for the performance of the filtering system for thousands of queries on streaming XML documents, demonstrating that the proposed system performs better compared to earlier state-of-the-art YFilter system.

AFilter: adaptable XML filtering with prefix-caching suffix-clustering

TLDR
AFilter, an adaptable, and thus scalable, path expression filtering approach, which has a base memory requirement linear in filter expression and data size and uses a triggering mechanism to prevent excessive consumption of resources by delaying processing until a trigger condition is observed.

Path sharing and predicate evaluation for high-performance XML filtering

TLDR
The results show that the path sharing employed by YFilter can provide order-of-magnitude performance benefits, and two alternative techniques for extending YFilter's shared structure matching with support for value-based predicates are proposed, and the performance of these two techniques are compared.

Towards an Internet-Scale XML Dissemination Service

An XML query engine for network-bound data

TLDR
Tukwila is built with a new system architecture that extends adaptive query processing and relational-engine techniques into the XML realm, as facilitated by a pair of operators that incrementally evaluate a query's input path expressions as data is read.

A Simple and Scalable Filter for XML Streams

TLDR
This paper proposes a simple and scalable system for the XML stream querying problem that indexes the queries compactly using a query guide and uses simple integer stacks to eciently process the stream.

Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents

TLDR
To the authors' knowledge, this is the first GTP matching solution that avoids any post path-join, sort, duplicate elimination and grouping operations, and the proposed Twig2Stack algorithm not only has better twig query processing performance than state-of theart algorithms, but is also capable of efficiently processing the more complex GTP queries.