Concept

Tuple relational calculus

Publications associées (20)

Jumping the ORDER BY Barrier in Large-Scale Pattern Matching

Event-series pattern matching is a major component of large-scale data analytics pipelines enabling a wide range of system diagnostics tasks. A precursor to pattern matching is an expensive ``shuffle the world'' stage wherein data are ordered by time and s ...

2017

On the Density of Coprime Tuples of the Form (n, ⌊f1(n)⌋, …, ⌊fk(n)⌋), Where f_1, …, f_k Are Functions from a Hardy Field

Florian Karl Richter

Let k∈Nk∈Nk \in \mathbb{N} and let f1, …, f k belong to a Hardy field. We prove that under some natural conditions on the k-tuple ( f1, …, f k ) the density of the set {n∈N:gcd(n,⌊f1(n)⌋,…,⌊fk(n)⌋)=1}{n∈N:gcd(n,⌊f1(n)⌋,…,⌊fk(n)⌋)=1}\displaystyle{\big{n \i ...

Springer International Publishing2017

Fast Queries Over Heterogeneous Data Through Engine Customization

Anastasia Ailamaki, Manolis Karpathiotakis, Ioannis Alagiannis

Industry and academia are continuously becoming more data-driven and data-intensive, relying on the analysis of a wide variety of heterogeneous datasets to gain insights. The different data models and formats pose a significant challenge on performing anal ...

Assoc Computing Machinery2016

A Polynomial Regularity Lemma For Semialgebraic Hypergraphs And Its Applications In Geometry And Property Testing

János Pach

In this paper, we prove several extremal results for geometrically defined hypergraphs. In particular, we establish an improved lower bound, single exponentially decreasing in k, on the best constant delta > 0 such that the vertex classes P-1,...,P-k of ev ...

Society for Industrial and Applied Mathematics2016

Maximizing k-Submodular Functions and Beyond

Justin Dean Ward

We consider the maximization problem in the value oracle model of functions defined on k-tuples of sets that are submodular in every orthant and r-wise monotone, where k >= 2 and 1

Assoc Computing Machinery2016

Scale preserving PTZ tracking with size estimation using tilt sensory data

Kwang Moo Yi

We propose an pan-tilt-zoom (PTZ) tracking method to keep the target object at the center of the image with a predefined size in image. For this purpose, we develop an efficient method for object size estimation using only the tilt sensory data. First we i ...

2014

Ramsey-Type Results For Semi-Algebraic Relations

János Pach

A k-ary semi-algebraic relation E on R-d is a subset of R-kd, the set of k-tuples of points in R-d, which is determined by a finite number of polynomial inequalities in kd real variables. The description complexity of such a relation is at most t if d, k < ...

Amer Mathematical Soc2014

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

Ramsey-type results for semi-algebraic relations

János Pach

A k-ary semi-algebraic relation E on R^d is a subset of R^{kd}, the set of k-tuples of points in R^d, which is determined by a finite number of polynomial equations and inequalities in kd real variables. The description complexity of such a relation is at ...

2013

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

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