Concept

Comparison of relational database management systems

Related publications (27)

Scalable Logic Rewriting Using Don’t Cares

Giovanni De Micheli, Alessandro Tempia Calvino

Logic rewriting is a powerful optimization technique that replaces small sections of a Boolean network with better implementations. Typically, exact synthesis is used to compute optimum replacement on-the-fly, with possible support for Boolean don't cares. ...

2024

Adaptive table placement in NUMA architectures

Anastasia Ailamaki, Iraklis Psaroudakis

Techniques and solutions are provided for performing adaptive database table placement in a non-uniform memory access (NUMA) architecture. The adaptive table placement can occur in response to changing workloads on the NUMA nodes. For example, if a particu ...

2022

Deciding Robustness for Lower SQL Isolation Levels

Christoph Koch, Bas Ketsman

While serializability always guarantees application correctness, lower isolation levels can be chosen to improve transaction throughput at the risk of introducing certain anomalies. A set of transactions is robust against a given isolation level if every p ...

ASSOC COMPUTING MACHINERY2022

Robustness against Read Committed for Transaction Templates

Christoph Koch, Bas Ketsman

The isolation level Multiversion Read Committed (RC), offered by many database systems, is known to trade consistency for increased transaction throughput. Sometimes, transaction workloads can be safely executed under RC obtaining the perfect isolation of ...

ASSOC COMPUTING MACHINERY2021

Micro-architectural Analysis of Database Workloads

Utku Sirin

Database workloads have significantly evolved in the past twenty years. Traditional database systems that are mainly used to serve Online Transactional Processing (OLTP) workloads evolved into specialized database systems that are optimized for particular ...

EPFL2021

Micro-architectural analysis of in-memory OLTP: Revisited

Anastasia Ailamaki, Danica Porobic, Utku Sirin

Micro-architectural behavior of traditional disk-based online transaction processing (OLTP) systems has been investigated extensively over the past couple of decades. Results show that traditional OLTP systems mostly under-utilize the available micro-archi ...

2021

A Nitride Ring Isolator

Tobias Kippenberg, Anat Siddharth, Junqiu Liu

A silicon nitride optical ring isolator is realized by spatiotemporal modulation using bulk acoustic wave stress-optical transducers. By driving three actuators with fixed relative phases, over 17 dB isolation is achieved. (C) 2020 The Author(s) ...

IEEE2020

Deciding Robustness for Lower SQL Isolation Levels

Christoph Koch, Bas Ketsman

ASSOC COMPUTING MACHINERY2020

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

Proximity Operators of Discrete Information Divergences

Mireille El Gheche, Giovanni Chierchia

While phi-divergences have been extensively studied in convex analysis, their use in optimization problems often remains challenging. In this regard, one of the main shortcomings of existing methods is that the minimization of phi-divergences is usually pe ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

Locking Timestamps versus Locking Objects

Rachid Guerraoui, Tudor Alexandru David, Junxiong Wang

We present multiversion timestamp locking (MVTL), a new genre of multiversion concurrency control algorithms for serializable transactions. The key idea behind MVTL is simple: lock individual timestamps instead of locking objects. After presenting a generi ...

ASSOC COMPUTING MACHINERY2018

Building Efficient Query Engines using High-Level Languages

Ioannis Klonatos

We are currently witnessing a shift towards the use of high-level programming languages for systems development. These approaches collide with the traditional wisdom which calls for using low-level languages for building efficient software systems. This sh ...

EPFL2017

Rack-Scale Memory Pooling for Datacenters

Stanko Novakovic

The rise of web-scale services has led to a staggering growth in user data on the Internet. To transform such a vast raw data into valuable information for the user and provide quality assurances, it is important to minimize access latency and enable in-me ...

EPFL2017

Dictionary Compression in Point Cloud Data Management

Anastasia Ailamaki, Mirjana Pavlovic

Nowadays, massive amounts of point cloud data can be collected thanks to advances in data acquisition and processing technologies like dense image matching and airborne LiDAR (Light Detection and Ranging) scanning. With the increase in volume and precision ...

2017

We get the algorithms of our ground truths: Designing referential databases in digital image processing

Florian Lucas Jaton

This article documents the practical efforts of a group of scientists designing an imageprocessing algorithm for saliency detection. By following the actors of this computer science project, the article shows that the problems often considered to be the st ...

SAGE Publications2017

Interleaving with Coroutines: A Practical Approach for Robust Index Joins

Anastasia Ailamaki, Georgios Psaropoulos

Index join performance is determined by the efficiency of the lookup operation on the involved index. Although database indexes are highly optimized to leverage processor caches, main memory accesses inevitably increase lookup runtime when the index outsiz ...

VLDB Endowment Inc.2017

Just-in-time Analytics Over Heterogeneous Data and Hardware

Manolis Karpathiotakis

Industry and academia are continuously becoming more data-driven and data-intensive, relying on the analysis of a wide variety of datasets to gain insights. At the same time, data variety increases continuously across multiple axes. First, data comes in mu ...

EPFL2017

How Fast can a Distributed Transaction Commit?

Rachid Guerraoui, Junxiong Wang

The atomic commit problem lies at the heart of distributed database systems. The problem consists for a set of processes (database nodes) to agree on whether to commit or abort a transaction (agreement property). The commit decision can only be taken if al ...

ACM Press2017

UnLynx: A Decentralized System for Privacy-Conscious Data Sharing

Jean-Pierre Hubaux, Bryan Alexander Ford, David Jules Froelicher, Jean Louis Raisaro, Zhicong Huang, Christian Vincent Mouchet, Joao André Gomes de Sá e Sousa, Patricia Egger

Current solutions for privacy-preserving data sharing among multiple parties either depend on a centralized authority that must be trusted and provides only weakest-link security (e.g., the entity that manages private/secret cryptographic keys), or leverag ...

De Gruyter2017

A Multiagent System for Dynamic Data Aggregation in Medical Research

Karl Aberer, Michael Ignaz Schumacher, Alevtina Dubovitskaya

The collection of medical data for research purposes is a challenging and long-lasting process. In an effort to accelerate and facilitate this process we propose a new framework for dynamic aggregation of medical data from distributed sources. We use agent ...

Hindawi Publishing Corporation2016