The Experts below are selected from a list of 165 Experts worldwide ranked by ideXlab platform
Hansarno Jacobsen - One of the best experts on this subject based on the ideXlab platform.
-
gpx matcher a generic Boolean Predicate based xpath expression matcher
Extending Database Technology, 2011Co-Authors: Mohammad Sadoghi, Ioana Burcea, Hansarno JacobsenAbstract: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, 2011Co-Authors: Mohammad Sadoghi, Ioana Burcea, Hansarno JacobsenAbstract: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 - One of the best experts on this subject based on the ideXlab platform.
-
gpx matcher a generic Boolean Predicate based xpath expression matcher
Extending Database Technology, 2011Co-Authors: Mohammad Sadoghi, Ioana Burcea, Hansarno JacobsenAbstract: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, 2011Co-Authors: Mohammad Sadoghi, Ioana Burcea, Hansarno JacobsenAbstract: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 - One of the best experts on this subject based on the ideXlab platform.
-
gpx matcher a generic Boolean Predicate based xpath expression matcher
Extending Database Technology, 2011Co-Authors: Mohammad Sadoghi, Ioana Burcea, Hansarno JacobsenAbstract: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, 2011Co-Authors: Mohammad Sadoghi, Ioana Burcea, Hansarno JacobsenAbstract: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.
T. Bouaziz - One of the best experts on this subject based on the ideXlab platform.
-
ICDE - Fuzzy triggers: incorporating imprecise reasoning into active databases
Proceedings 14th International Conference on Data Engineering, 1998Co-Authors: A. Wolski, T. BouazizAbstract:Traditional event-condition-action triggers (active database rules) include a Boolean Predicate as a trigger condition. We propose fuzzy triggers whereby fuzzy inference is utilized in the condition evaluation. In this way, approximate reasoning may be integrated with a traditional crisp database. The new approach paves the way for intuitive expression of application semantics of imprecise nature, in database-bound applications. Two fuzzy trigger models are proposed. Firstly, a set of fuzzy rules is encapsulated into a Boolean-valued function called a rule set function, leading to the C-fuzzy trigger model. Subsequently, actions are expressed also in fuzzy terms, and the corresponding CA-fuzzy trigger model is proposed. Examples are provided to illustrate how fuzzy triggers can be applied to a real-life drive control system in an industrial installation.
-
Fuzzy triggers: incorporating imprecise reasoning into active databases
Proceedings 14th International Conference on Data Engineering, 1998Co-Authors: A. Wolski, T. BouazizAbstract:Traditional event-condition-action triggers (active database rules) include a Boolean Predicate as a trigger condition. We propose fuzzy triggers whereby fuzzy inference is utilized in the condition evaluation. In this way, approximate reasoning may be integrated with a traditional crisp database. The new approach paves the way for intuitive expression of application semantics of imprecise nature, in database-bound applications. Two fuzzy trigger models are proposed. Firstly, a set of fuzzy rules is encapsulated into a Boolean-valued function called a rule set function, leading to the C-fuzzy trigger model. Subsequently, actions are expressed also in fuzzy terms, and the corresponding CA-fuzzy trigger model is proposed. Examples are provided to illustrate how fuzzy triggers can be applied to a real-life drive control system in an industrial installation.
Will Rosenbaum - One of the best experts on this subject based on the ideXlab platform.
-
SIROCCO - Space-Time Tradeoffs for Distributed Verification
Structural Information and Communication Complexity, 2017Co-Authors: Rafail Ostrovsky, Mor Perry, Will RosenbaumAbstract:Verifying that a network configuration satisfies a given Boolean Predicate is a fundamental problem in distributed computing. Many variations of this problem have been studied, for example, in the context of proof labeling schemes (\(\mathrm {PLS}\)), locally checkable proofs (\(\mathrm {LCP}\)), and non-deterministic local decision (\(\mathrm {NLD}\)). In all of these contexts, verification time is assumed to be constant. Korman et al. [16] presented a proof-labeling scheme for MST, with poly-logarithmic verification time, and logarithmic memory at each vertex.
-
PODC - Brief Announcement: Space-Time Tradeoffs for Distributed Verification
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing - PODC '16, 2016Co-Authors: Mor Baruch, Rafail Ostrovsky, Will RosenbaumAbstract:Verifying that a network configuration satisfies a given Boolean Predicate is a fundamental problem in distributed computing. Many variations of this problem have been studied, for example, in the context of proof labeling schemes (PLS), locally checkable proofs (LCP), and non-deterministic local decision (NLD). In all of these contexts, verification time is assumed to be constant. Korman, Kutten and Masuzawa presented a proof-labeling scheme for MST, with poly-logarithmic verification time, and logarithmic memory at each vertex. In this paper we introduce the notion of a t-PLS, which allows the verification procedure to run for super-constant time. Our work analyzes the tradeoffs of t-PLS between time, label size, message length, and computation space. We construct a universal t-PLS and prove that it uses the same amount of total communication as a known one-round universal PLS, and t factor smaller labels. In addition, we provide a general technique to prove lower bounds for space- time tradeoffs of t-PLS. We use this technique to show an optimal tradeoff for testing that a network is acyclic (cycle free). Our optimal t-PLS for acyclicity uses label size and computation space O((log n)/t). We further describe a recursive O(log* n) space verifier for acyclicity which does not assume previous knowledge of the run-time t.
-
Space-Time Tradeoffs for Distributed Verification
arXiv: Distributed Parallel and Cluster Computing, 2016Co-Authors: Rafail Ostrovsky, Mor Perry, Will RosenbaumAbstract:Verifying that a network configuration satisfies a given Boolean Predicate is a fundamental problem in distributed computing. Many variations of this problem have been studied, for example, in the context of proof labeling schemes (PLS), locally checkable proofs (LCP), and non-deterministic local decision (NLD). In all of these contexts, verification time is assumed to be constant. Korman, Kutten and Masuzawa [PODC 2011] presented a proof-labeling scheme for MST, with poly-logarithmic verification time, and logarithmic memory at each vertex. In this paper we introduce the notion of a $t$-PLS, which allows the verification procedure to run for super-constant time. Our work analyzes the tradeoffs of $t$-PLS between time, label size, message length, and computation space. We construct a universal $t$-PLS and prove that it uses the same amount of total communication as a known one-round universal PLS, and $t$ factor smaller labels. In addition, we provide a general technique to prove lower bounds for space-time tradeoffs of $t$-PLS. We use this technique to show an optimal tradeoff for testing that a network is acyclic (cycle free). Our optimal $t$-PLS for acyclicity uses label size and computation space $O((\log n)/t)$. We further describe a recursive $O(\log^* n)$ space verifier for acyclicity which does not assume previous knowledge of the run-time $t$.
