Publication

AFFINITY: Efficiently Querying Statistical Measures on Time-Series Data

Related publications (45)

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.

Database Queries in Java

Christopher Ming-Yee Iu

In conventional programming languages like Java, the interface for accessing databases is often inelegant. Typically, an entire separate database query language must be embedded inside a conventional programming language for programmers to access the full ...

EPFL2010

On Probabilistic Fixpoint and Markov Chain Query Languages.

Christoph Koch

We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e.g. datalog rules) can fire probabilistically. We define two possible semantic ...

2010

Computing in Social Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure Computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a function f : V -> U of their inputs in a set of constant size, in a sca ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Adaptive query execution for data management in the cloud

Anastasia Ailamaki, Debabrata Dash, Adrian Daniel Popescu

A major component of many cloud services is query processing on data stored in the underlying cloud cluster. The traditional techniques for query processing on a cluster are those offered by parallel DBMS. These techniques however, cannot guarantee high pe ...

ACM Press2010

A Scalable, Predictable Join Operator for Highly Concurrent Data Warehouses

George Candea

Conventional data warehouses employ the query-at-a-time model, which maps each query to a distinct physical plan. When several queries execute concurrently, this model introduces contention, because the physical plans—unaware of each other—compete for acce ...

2009

Sharing of probabilistically correlated data in peer-to-peer networks

Roman Schmidt

The impact of Peer-to-Peer (P2P) networks on the Internet landscape is undisputed. It has led to a series of new applications, e.g., as part of the so-called Web 2.0. The shift from the classical client-server based paradigm of the Internet, with a clear d ...

EPFL2008

On finding approximate nearest neighbours in a set of compressible signals

Pierre Vandergheynst, Philippe Jost

Numerous applications demand that we manipulate large sets of very high-dimensional signals. A simple yet common example is the problem of finding those signals in a database that are closest to a query. In this paper, we tackle this problem by restricting ...

2008

On finding nearest neighbors in a set of compressible signals

Pierre Vandergheynst, Philippe Jost

2007

Pervasive Computing with Frugal Objects

Rachid Guerraoui, Maxime Monod, Benoît Garbinato, Jesper Honig Spring

This paper presents a computing model for resource-limited mobile devices that might be ubiquitously deployed in private and business environments. The model integrates a strongly-typed event-based communication paradigm with abstractions for frugal contro ...

2007

Pervasive Computing with Frugal Objects

Rachid Guerraoui, Maxime Monod, Benoît Garbinato, Jesper Honig Spring

2007