Concept

Database theory

Related publications (10)

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

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

Timely and cost-efficient data exploration through adaptive tuning

Matthaios Alexandros Olma

Modern applications accumulate data at an exponentially increasing rate and traditional database systems struggle to keep up. Decision support systems used in industry, rely heavily on data analysis, and require real-time responses irrespective of data siz ...

EPFL2019

Efficient Bundled Spatial Range Queries

Anastasia Ailamaki, Darius Sidlauskas, Thomas Heinis, Eleni Tzirita Zacharatou, Farhan Tauheed

Efficiently querying multiple spatial data sets is a growing challenge for scientists. Astronomers query data sets that contain different types of stars (e.g., dwarfs, giants, stragglers) while neuroscientists query different data sets that model different ...

ASSOC COMPUTING MACHINERY2019

Fast Queries Over Heterogeneous Data Through Engine Customization

Anastasia Ailamaki, Ioannis Alagiannis, Manolis Karpathiotakis

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

Efficient Incremental Data Analysis

Milos Nikolic

Many data-intensive applications require real-time analytics over streaming data. In a growing number of domains -- sensor network monitoring, social web applications, clickstream analysis, high-frequency algorithmic trading, and fraud detections to name a ...

EPFL2016

Creating Probabilistic Databases from Imprecise Time-Series Data

Karl Aberer, Saket Sathe, Ho Young Jeung

Although efficient processing of probabilistic databases is a well-established field, a wide range of applications are still unable to benefit from these techniques due to the lack of means for creating probabilistic databases. In fact, it is a challenging ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

JReq: Database Queries in Imperative Languages

Willy Zwaenepoel, Christopher Ming-Yee Iu, Emmanuel Cecchet

Instead of writing SQL queries directly, programmers often prefer writing all their code in a general purpose programming language like Java and having their programs be automatically rewritten to use database queries. Traditional tools such as object-rela ...

Springer Verlag2010

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

Generalized Hypertree Decompositions: NP-hardness and Tractable Variants

Zoltán Miklós

The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergraphs have bounded GHW are known to be solvable in polynomial time. However, i ...

2009

Contextualized and personalized location-based services

Shijun Yu

Advances in the technologies of smart mobile devices and tiny sensors together with the increase in the number of web resources open up a plethora of new mobile information services where people can acquire and disseminate information at any place and any ...

EPFL2008