Conquer is an extensible architecture designed for transforming a pull-based data management system (e.g., conventional DBMSs, web search engines and query systems) into a push-enabled data management systems. The key ideas of Conquer are the concept of continual queries; the mechanisms for eecient and scalable implementation of continual queries 20], including synchronous or asynchronous event...

Techniques for solving divide-and-conquer recurrences are routinely taught to thousands of Computer Science students each year. The dominant approach to solving such recurrences is known as the Master Method [2]. Recently, Akra and Bazzi [1] discovered a surprisingly elegant generalization of the Master Method that yields a very simple formula for solving most divideand-conquer recurrences. In ...

This paper studies the runtime behaviour of various parallel divide-and-conquer algorithms written in a non-strict functional language, when three common granularity control mechanisms are used: a simple cut-off, a priority thread creation and a priority scheduling mechanism. These mechanisms use granularity information that is currently provided via annotations to improve the performance of th...

We propose a sequence of equational transformations and specializations which turns a divide-and-conquer skeleton in Haskell into a parallel loop nest in C. Our initial skeleton is often viewed as general divide-and-conquer. The spe-cializations impose a balanced call tree, a xed degree of the problem division, and elementwise operations. Our goal is to select parallel implementations of divide...

This document describes a rule learning framework called SeCo (derived from Separate-and-Conquer). This framework uses building blocks to specify each component that is needed to build up a configuration for a rule learner. It is based on a general separate-and-conquer algorithm. The framework allows to configurate any given rule learner that fulfills some properties. These are mainly that it e...

We propose a sequence of equational transformations and specializations which turns a divide-and-conquer skeleton in Haskell into a parallel loop nest in C. Our initial skeleton is often viewed as general divide-and-conquer. The specializations impose a balanced call tree, a xed degree of the problem division, and elementwise operations. Our goal is to select parallel implementations of divide-...

An instance of the given problem is divided into easier instances of the same problem, which are solved recursively and then combined to create a solution to the original instance. Of course, divide and conquer is not suitable for every problem. A divide and conquer approach will only work if the problem is easily divided into a small number of easier sub-problems, and the solution to the entir...

We characterize the classes of functions computable by uniform log-depth (NC) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent to ALOGTIME, the latter to polylogarithmic space.) The closures involve the \safe" composition of Bellantoni and Cook as well as a safe \divide and conquer" recursion; a simple change to the de nition of the latter dis...

The structure common to a class of divide and conquer algorithms is represented by a program scheme. A theorem is presented which relates the functionality of a divide and conquer algorithm to its structure and the functionalities of its subalgorithms. Several strategies for designing divide and conquer algorithms arise from this theorem and they are used to formally derive algorithms for sorti...