Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

MySQL

Related publications (17)

Aggregation and Exploration of High-Dimensional Data Using the Sudokube Data Cube Engine

Christoph Koch, Sachin Basil John, Peter Lindner, Zhekai Jiang

We present Sudokube, a novel system that supports interactive speed querying on high-dimensional data using partially materialized data cubes. Given a storage budget, it judiciously chooses what projections to precompute and materialize during cube constru ...

Association for Computing Machinery2023

Getting Started with PATSTAT Register

Gaétan Jean A de Rassenfosse

This article provides a technical introduction to the PATSTAT Register database, which contains bibliographical, procedural and legal status data on patent applications handled by the European Patent Office. It presents eight MySQL queries that cover some ...

Wiley2017

Building Efficient Query Engines using High-Level Languages

Ioannis Klonatos

We are currently witnessing a shift towards the use of high-level programming languages for systems development. These approaches collide with the traditional wisdom which calls for using low-level languages for building efficient software systems. This sh ...

EPFL2017

Techniques for Identifying Elusive Corner-Case Bugs in Systems Software

Radu Banabic

Modern software is plagued by elusive corner-case bugs (e.g., security bugs). Because there are no scalable, automated ways of finding them, such bugs can remain hidden until software is deployed in production. This thesis proposes approaches to solve this ...

EPFL2015

An Incremental Anytime Algorithm for Multi-Objective Query Optimization

Christoph Koch, Immanuel Trummer

Query plans offer diverse tradeoffs between conflicting cost metrics such as execution time, energy consumption, or execution fees in a multi-objective scenario. It is convenient for users to choose the desired cost tradeoff in an interactive process, dyna ...

2015

Approximation schemes for many-objective query optimization

Christoph Koch, Immanuel Trummer

The goal of multi-objective query optimization (MOQO) is to find query plans that realize a good compromise between conicting objectives such as minimizing execution time and minimizing monetary fees in a Cloud scenario. A previously proposed exhaustive MO ...

ACM Press2014

Approximation Schemes for Many-Objective Query Optimization

Christoph Koch, Immanuel Trummer

The goal of multi-objective query optimization (MOQO) is to find query plans that realize a good compromise between conflicting objectives such as minimizing execution time and minimizing monetary fees in a Cloud scenario. A previously proposed exhaustive ...

2014

A Multi-sensor Office-building Database for Experimental Validation and Advanced Control Algorithm Development

Nicolas Morel, Nikolaos Zarkadis

Data from multiple sensors and actuators has been recorded from December 2001 to March 2008 at the LESO-PB building of the EPFL campus, using the EIB/KNX bus standard. Sensors and actuators provided data on room temperature, presence, lighting level, windo ...

2014

Fast black-box testing of system recovery code

George Candea, Radu Banabic

Fault injection-a key technique for testing the robustness of software systems-ends up rarely being used in practice, because it is labor-intensive and one needs to choose between performing random injections (which leads to poor coverage and low represent ...

2012

Entangled queries: enabling declarative data-driven coordination

Christoph Koch

Many data-driven social and Web applications involve collaboration and coordination. The vision of Declarative Data-Driven Coordination (D3C), proposed in Kot et al. [2010], is to support coordination in the spirit of data management: to make it data-centr ...

Assoc Computing Machinery2011

Deadlock Immunity : Enabling General-Purpose Software to Defend Itself against Deadlocks

Horatiu Jula

Deadlock immunity is a property by which programs, once afflicted by a deadlock, develop resistance against future occurrences of that deadlock. We enable real applications to automatically achieve immunity against deadlock bugs involving mutex locks, sema ...

EPFL2011

Efficient Testing of Recovery Code Using Fault Injection

George Candea

A critical part of developing a reliable software system is testing its recovery code. This code is traditionally difficult to test in the lab, and, in the field, it rarely gets to run; yet, when it does run, it must execute flawlessly in order to recover ...

2011

Query-Driven Indexing for Scalable Peer-to-Peer Text Retrieval

Karl Aberer, Martin Rajman, Vinh Toan Luu, Gleb Skobeltsyn

We present a query-driven algorithm for the distributed indexing of large document collections within structured P2P networks. To cope with bandwidth consumption that has been identified as the major problem for the standard P2P approach with single term i ...

2009

Query-Driven Indexing for Scalable Peer-to-Peer Text Retrieval

Karl Aberer, Martin Rajman, Vinh Toan Luu, Gleb Skobeltsyn

In this paper, we present a query-driven indexing/retrieval strategy for efficient full text retrieval from large document collections distributed within a structured P2P network. Our indexing strategy is based on two important properties: (1) the generate ...

2009

The Flux: Creating a Large Annotated Image Database

Sabine Süsstrunk, Patrick Vandewalle, Patrick Merryl Marlon Schönmann

From image retrieval to image classification, all research shares one common requirement: a good image database to test or train the algorithms. In order to create a large database of images, we set up a project that allowed gathering a collection of more ...

2008

Optimistic Algorithms for Partial Database Replication

Rodrigo Malta Schmidt, Fernando Pedone

In this paper, we study the problem of partial database replication. Numerous previous works have investigated database replication, however, most of them focus on full replication. We are here interested in genuine partial replication protocols, which req ...

2006

Distributed Cache Table: Efficient Query-Driven Processing of Multi-Term Queries in P2P Networks

Karl Aberer, Gleb Skobeltsyn

The state-of-the-art techniques for processing multi-term queries in P2P environments are query flooding and inverted list intersection. However, it has been shown that due to scalability reasons both methods fail to support full-text search in large scale ...

2006