Related publications (38)

HyperLogLog: Exponentially Bad in Adversarial Settings

Mathilde Aliénor Raynal

Computing the count of distinct elements in large data sets is a common task but naive approaches are memory-expensive. The HyperLogLog (HLL) algorithm (Flajolet et al., 2007) estimates a data set's cardinality while using significantly less memory than a ...
IEEE COMPUTER SOC2022

Columnar Storage Optimization and Caching for Data Lakes

Haoqiong Bian

As a unified data repository, data lake plays a vital role in enterprise data management and analysis. It composes the raw files into tables that are processed in-situ by various computation engines and applications. Therefore, the read performance of the ...
2022

Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation

Bas Ketsman

Single-round multiway join algorithms first reshuffle data over many servers and then evaluate the query at hand in a parallel and communication-free way. A key question is whether a given distribution policy for the reshuffle is adequate for computing a g ...
ASSOC COMPUTING MACHINERY2019

Interactive Visual Exploration of Spatio-Temporal Urban Data Sets using Urbane

Anastasia Ailamaki, Eleni Tzirita Zacharatou, Haoqiong Bian

The recent explosion in the number and size of spatio-temporal data sets from urban environments and social sensors creates new opportunities for data-driven approaches to understand and improve cities. Visual analytics systems like Urbane aim to empower d ...
2018

How to Architect a Query Compiler

Christoph Koch, Ioannis Klonatos, Amir Shaikhha, Lionel Emile Vincent Parreaux, Mohammad Dashti Rahmat Abadi, Lewis Alexander Brown

This paper studies architecting query compilers. The state of the art in query compiler construction is lagging behind that in the compilers field. We attempt to remedy this by exploring the key causes of technical challenges in need of well founded soluti ...
2016

Building Efficient Query Engines in a High-Level Language

Christoph Koch, Ioannis Klonatos, Amir Shaikhha

Abstraction without regret refers to the vision of using high-level programming languages for systems development without experiencing a negative impact on performance. A database system designed according to this vision offers both increased productivity ...
2016

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.