Publications related to Parallelizing Query Optimization on Shared-Nothing Architectures

A profiling framework for high level design space exploration for memory and system architectures

In 1971, the first microprocessor produced in mass production had 2300 transistor and was able to compute 60'000 operations per second at 740 kHz. Nowadays, even a common gaming console uses a central unit including 243 millions of transistors running at 4 ...

EPFL2007

The virtue of patience in low complexity scheduling of packetized media with feedback

Pascal Frossard, Christophe De Vleeschouwer

We consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedbacks. We first review the rate-distortion optimization framework in such scenarios. Given an estimation of future transmission resources, ...

2007

Efficient Use of the Query Optimizer for Automated Database Design

Anastasia Ailamaki, Debabrata Dash

State-of-the-art database design tools rely on the query optimizer for comparing between physical design alternatives. Although it provides an appropriate cost model for physical design, query optimization is a computationally expensive process. The signif ...

2007

Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree based communication structure, where the goal is to minimize the total trans- mission cost of transporting the information collected by the nodes, to the sink nod ...

2006

Can we assess the model complexity for a bioprocess: theory and example of the anaerobic digestion process

Benoît Chachuat, Olivier Bernard

In this paper we propose a methodology to determine the structure of the pseudo-stoichiometric coefficient matrix K in a mass balance based model, i.e. the maximal number of biomasses that must be taken into account to reproduce an available data set. It c ...

2006

Interaction of spatial and temporal integration in global form processing

Jane Aspell

The mechanisms by which global structure is extracted from local orientation information are not well understood. Sensitivity to global structure can be investigated using coherence thresholds for detection of global forms of varying complexity, such as pa ...

Elsevier2006

Range queries in trie-structured overlays

Karl Aberer, Manfred Hauswirth, Anwitaman Datta, Roman Schmidt, Renault John Lecoultre

Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of query results have been identified as some of the most relevant issues. This ...

2005

The virtue of patience in low complexity scheduling of packetized media with feedback

Pascal Frossard, Christophe De Vleeschouwer

We consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedbacks. We first review the rate-distortion optimization framework in such scenarios. Given an estimation of future transmission resources, ...

2005

Efficient liquid schedule search strategies for collective communications

Roger Hersch, Emin Gabrielyan

The upper limit of a network's capacity is its liquid throughput. The liquid throughput corresponds to the flow of a liquid in an equivalent network of pipes. However, the aggregate throughput of a collective communication pattern (traffic) scheduled accor ...

Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ 08855-1331, United States2004

A Kalman filtering algorithm for regularization networks

Giancarlo Ferrari Trecate

Regularization networks are nonparametric estimators obtained from the application of Tychonov regularization or Bayes estimation to the hypersurface reconstruction problem. With the usual algorithm, the computation of the weights scales as

O(n^3)

where ...

2000

Parallelizing Query Optimization on Shared-Nothing Architectures

Graph Chatbot

Chat with Graph Search

A profiling framework for high level design space exploration for memory and system architectures

The virtue of patience in low complexity scheduling of packetized media with feedback

Efficient Use of the Query Optimizer for Automated Database Design

Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms

Can we assess the model complexity for a bioprocess: theory and example of the anaerobic digestion process

Interaction of spatial and temporal integration in global form processing

Range queries in trie-structured overlays

The virtue of patience in low complexity scheduling of packetized media with feedback

Efficient liquid schedule search strategies for collective communications

A Kalman filtering algorithm for regularization networks

A profiling framework for high level design space exploration for memory and system architectures

Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms

Can we assess the model complexity for a bioprocess: theory and example of the anaerobic digestion process

Interaction of spatial and temporal integration in global form processing

Efficient Use of the Query Optimizer for Automated Database Design

A Kalman filtering algorithm for regularization networks

The virtue of patience in low complexity scheduling of packetized media with feedback

The virtue of patience in low complexity scheduling of packetized media with feedback

Efficient liquid schedule search strategies for collective communications

Range queries in trie-structured overlays