Boolean Predicate - Explore the Science & Experts | ideXlab

Scan Science and Technology

Contact Leading Edge Experts & Companies

Boolean Predicate

The Experts below are selected from a list of 165 Experts worldwide ranked by ideXlab platform

Hansarno Jacobsen – 1st expert on this subject based on the ideXlab platform

  • gpx matcher a generic Boolean Predicate based xpath expression matcher
    Extending Database Technology, 2011
    Co-Authors: Mohammad Sadoghi, Ioana Burcea, Hansarno Jacobsen

    Abstract:

    Content-based architectures for XML data dissemination are gaining increasing attention both in academia and industry. These dissemination networks are the building blocks of selective information dissemination applications which have wide applicability such as sharing and integrating information in both scientific and corporate domains. At the heart of these dissemination services is a fast engine for matching of an incoming XML message against stored XPath expressions to determine interested consumers for the message. To achieve the ultra-low response time, predominant in financial message processing, the XPath expression matching must be done efficiently. In this paper, we develop and evaluate a novel algorithm based on a unique encoding of XPath expressions and XML messages, unlike dominating automaton-based algorithms, for efficiently solving this matching problem. We demonstrate a matching time in the millisecond range for millions of XPath expressions which significantly outperforms state-of-the-art algorithms.

  • EDBT – GPX-matcher: a generic Boolean Predicate-based XPath expression matcher
    Proceedings of the 14th International Conference on Extending Database Technology – EDBT ICDT '11, 2011
    Co-Authors: Mohammad Sadoghi, Ioana Burcea, Hansarno Jacobsen

    Abstract:

    Content-based architectures for XML data dissemination are gaining increasing attention both in academia and industry. These dissemination networks are the building blocks of selective information dissemination applications which have wide applicability such as sharing and integrating information in both scientific and corporate domains. At the heart of these dissemination services is a fast engine for matching of an incoming XML message against stored XPath expressions to determine interested consumers for the message. To achieve the ultra-low response time, predominant in financial message processing, the XPath expression matching must be done efficiently. In this paper, we develop and evaluate a novel algorithm based on a unique encoding of XPath expressions and XML messages, unlike dominating automaton-based algorithms, for efficiently solving this matching problem. We demonstrate a matching time in the millisecond range for millions of XPath expressions which significantly outperforms state-of-the-art algorithms.

Mohammad Sadoghi – 2nd expert on this subject based on the ideXlab platform

  • gpx matcher a generic Boolean Predicate based xpath expression matcher
    Extending Database Technology, 2011
    Co-Authors: Mohammad Sadoghi, Ioana Burcea, Hansarno Jacobsen

    Abstract:

    Content-based architectures for XML data dissemination are gaining increasing attention both in academia and industry. These dissemination networks are the building blocks of selective information dissemination applications which have wide applicability such as sharing and integrating information in both scientific and corporate domains. At the heart of these dissemination services is a fast engine for matching of an incoming XML message against stored XPath expressions to determine interested consumers for the message. To achieve the ultra-low response time, predominant in financial message processing, the XPath expression matching must be done efficiently. In this paper, we develop and evaluate a novel algorithm based on a unique encoding of XPath expressions and XML messages, unlike dominating automaton-based algorithms, for efficiently solving this matching problem. We demonstrate a matching time in the millisecond range for millions of XPath expressions which significantly outperforms state-of-the-art algorithms.

  • EDBT – GPX-matcher: a generic Boolean Predicate-based XPath expression matcher
    Proceedings of the 14th International Conference on Extending Database Technology – EDBT ICDT '11, 2011
    Co-Authors: Mohammad Sadoghi, Ioana Burcea, Hansarno Jacobsen

    Abstract:

    Content-based architectures for XML data dissemination are gaining increasing attention both in academia and industry. These dissemination networks are the building blocks of selective information dissemination applications which have wide applicability such as sharing and integrating information in both scientific and corporate domains. At the heart of these dissemination services is a fast engine for matching of an incoming XML message against stored XPath expressions to determine interested consumers for the message. To achieve the ultra-low response time, predominant in financial message processing, the XPath expression matching must be done efficiently. In this paper, we develop and evaluate a novel algorithm based on a unique encoding of XPath expressions and XML messages, unlike dominating automaton-based algorithms, for efficiently solving this matching problem. We demonstrate a matching time in the millisecond range for millions of XPath expressions which significantly outperforms state-of-the-art algorithms.

Ioana Burcea – 3rd expert on this subject based on the ideXlab platform

  • gpx matcher a generic Boolean Predicate based xpath expression matcher
    Extending Database Technology, 2011
    Co-Authors: Mohammad Sadoghi, Ioana Burcea, Hansarno Jacobsen

    Abstract:

    Content-based architectures for XML data dissemination are gaining increasing attention both in academia and industry. These dissemination networks are the building blocks of selective information dissemination applications which have wide applicability such as sharing and integrating information in both scientific and corporate domains. At the heart of these dissemination services is a fast engine for matching of an incoming XML message against stored XPath expressions to determine interested consumers for the message. To achieve the ultra-low response time, predominant in financial message processing, the XPath expression matching must be done efficiently. In this paper, we develop and evaluate a novel algorithm based on a unique encoding of XPath expressions and XML messages, unlike dominating automaton-based algorithms, for efficiently solving this matching problem. We demonstrate a matching time in the millisecond range for millions of XPath expressions which significantly outperforms state-of-the-art algorithms.

  • EDBT – GPX-matcher: a generic Boolean Predicate-based XPath expression matcher
    Proceedings of the 14th International Conference on Extending Database Technology – EDBT ICDT '11, 2011
    Co-Authors: Mohammad Sadoghi, Ioana Burcea, Hansarno Jacobsen

    Abstract:

    Content-based architectures for XML data dissemination are gaining increasing attention both in academia and industry. These dissemination networks are the building blocks of selective information dissemination applications which have wide applicability such as sharing and integrating information in both scientific and corporate domains. At the heart of these dissemination services is a fast engine for matching of an incoming XML message against stored XPath expressions to determine interested consumers for the message. To achieve the ultra-low response time, predominant in financial message processing, the XPath expression matching must be done efficiently. In this paper, we develop and evaluate a novel algorithm based on a unique encoding of XPath expressions and XML messages, unlike dominating automaton-based algorithms, for efficiently solving this matching problem. We demonstrate a matching time in the millisecond range for millions of XPath expressions which significantly outperforms state-of-the-art algorithms.