• Aucun résultat trouvé

Optimizing database architecture for machine architecture: is there still hope?

N/A
N/A
Protected

Academic year: 2022

Partager "Optimizing database architecture for machine architecture: is there still hope?"

Copied!
1
0
0

Texte intégral

(1)

Optimizing database architecture for machine architecture:

is there still hope?

Peter Boncz CWI p.boncz@cwi.nl

Extended Abstract

In the keynote, I will give some examples of how computer architecture has strongly evolved in the past decennia and how this influences the performance, and therefore the de- sign, of algorithms and data structure for data management.

One the one hand, these changes in hardware architecture have caused the (continuing) need for new data management research. i.e. hardware-conscious database research. Here, I will draw examples from hardware-conscious research per- formed on the CWI systems MonetDB and Vectorwise.

This diversification trend in computer architectural char- acteristics of the various solutions in the market seems to be intensifying. This is seen in quite different architectural options, such as CPU vs GPU vs FPGA, but also even re- stricting oneself to just CPUs there seems to be increasing design variation in architecture and platform behavior. This poses a challenge to hardware-conscious database research.

25thGI-Workshop on Foundations of Databases (Grundlagen von Daten- banken), 28.05.2013 - 31.05.2012, Ilmenau, Germany.

Copyright is held by the author/owner(s).

In particular, there is the all too present danger to over- optimize of one particular architecture; or to propose tech- niques that will have only a very short span of utility. The question thus is not only to find specific ways to optimize for certain hardware features, but do so in a way that works across the full spectrum of architectural, i.e. robust tech- niques.

I will close the talk by recent work at CWI and Vectorwise on robustness of query evaluator performance, describing a project called ”Micro-Adaptivity” where database systems are made self-adaptive and react immediately to observed performance, self-optimizing to the combination of current query workload, observed data distributions, and hardware characteristics.

Références

Documents relatifs

Once the connection is set up, the program can send SQL commands to the database by using SQLE xec D irect C language variables can be bound to attributes of the query result, so

This philosophy can be considered as equivalent to the generalization of the theta-join operator of the relational model [24] (with theta equals to a spatial operator). The

In this chapter, we look at existing techniques for querying encrypted data and use our Homomorphic Query Processing method in conjunction with a keyword search technique proposed

The brute-force search in a large motion database (which consists of comparing paired-wise each frame in the database) makes the process of retrieving motion captured data highly

Après 2006, les demandeurs d'emploi qui sont présents à la n du 3 e mois se répartissent donc de la façon suivante (cf. gure 6) :  21 % des éligibles (et 7 % des

Most of the connexions in the example link to taxonomic pages, but is possible to link to pages of other subjects, for example, pages with bibliographic references, personal

This adaptive mech- anism allows delegating specific resources to the query plan at runtime as the data structure hosts specific pre- computed tuning

Keywords : Image Database Management, Super-Resolution, Visual Data, Data Indexing, Hash Function, Content-Based Image Retrieval (CBIR), Industrial Information Integration