Concept

Fonction d'agrégation

Publications associées (8)

Interactive-time Exploration, Querying, and Analysis of Large High-dimensional Datasets

In the current era of big data, aggregation queries on high-dimensional datasets are frequently utilized to uncover hidden patterns, trends, and correlations critical for effective business decision-making. Data cubes facilitate such queries by employing p ...

EPFL2023

Lightweight HI source finding for next generation radio surveys

Jean-Paul Richard Kneib, Frédéric Courbin, Aymeric Alexandre Galan, Austin Chandler Peel, Emma Elizabeth Tolley, Mark Thomas Sargent

Future deep HI surveys will be essential for understanding the nature of galaxies and the content of the Universe. However, the large volume of these data will require distributed and automated processing techniques. We introduce LiSA, a set of python modu ...

ELSEVIER2022

Feasibility of Homomorphic Encryption for Sharing I2B2 Aggregate-Level Data in the Cloud

Jean-Pierre Hubaux, Jean Louis Raisaro

The biomedical community is lagging in the adoption of cloud computing for the management of medical data. The primary obstacles are concerns about privacy and security. In this paper, we explore the feasibility of using advanced privacy-enhancing technolo ...

2018

Privacy - Preserving Data Exchange and Aggregation in Healthcare

Alevtina Dubovitskaya

Medical data are often scattered among multiple clinics, hospitals, insurance companies, pharmacies, and research institutions that store and process personal healthcare information. The use of information and communication technologies for health (eHealth ...

EPFL2018

Incremental Query Evaluation in a Ring of Databases

Christoph Koch

This article approaches the incremental view maintenance problem from an algebraic perspective. The algebraic structure of a ring of databases is constructed and extended to form a powerful aggregate query calculus. The query calculus inherits the key prop ...

2013

Incremental Query Evaluation in a Ring of Databases.

Christoph Koch

This paper approaches the incremental view maintenance problem from an algebraic perspective. We construct a ring of databases and use it as the foundation of the design of a query calculus that allows to express powerful aggregate queries. The query calcu ...

2010

Dynamic faceted search for discovery-driven analysis

Anastasia Ailamaki, Debabrata Dash

We propose a dynamic faceted search system for discovery-driven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically select a small set of "interesting" attributes and present aggregates on them ...

2008

ResIn: A Combination of Result Caching and Index Pruning for High-performance Web Search Engines

Gleb Skobeltsyn

Results caching is an efficient technique for reducing the query processing load, hence it is commonly used in real search engines. This technique, however, bounds the maximum hit rate due to the large fraction of singleton queries, which is an important l ...

2008

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search