Publications associées à Base de données XML native

ms3: A parser for MuseScore files, serving as data factory for annotated music corpora

Martin Alois Rohrmeier, Johannes Hentschel

The Python library ms3 makes scores (symbolic representations of music) operational for computational approaches by representing their contents as sets of tabular files. Music scores represent relations between sounding events by graphical means. The Free ...

2023

P3LI5: Practical and confidEntial Lawful Interception on the 5G core

Apostolos Pyrgelis, Francesco Intoci

Lawful Interception (LI) is a legal obligation of Communication Service Providers (CSPs) to provide interception capabilities to Law Enforcement Agencies (LEAs) in order to gain insightful data from network communications for criminal proceedings, e.g., ne ...

IEEE2023

Designing Singlet Fission Candidates from Donor-Acceptor Copolymers

Anne-Clémence Corminboeuf, Sergio Vela Llausi, Maria Fumanal Quintana, Jacob Terence Blaskovits

Singlet fission (SF) has demonstrated significant promise for boosting the power conversion efficiency (PCE) of solar cells. Traditionally, SF is targeted as an intermolecular process; however, its dependence on crystal packing makes molecular design diffi ...

AMER CHEMICAL SOC2020

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

Tracking Transmission of Details in Paintings

Frédéric Kaplan, Isabella Di Lenardo, Benoît Laurent Auguste Seguin

In previous articles (di Lenardo et al, 2016; Seguin et al, 2016), we explored how efficient visual search engines operating not on the basis of textual metadata but directly through visual queries, could fundamen- tally change the navigation in large data ...

2017

Mapping and classifying molecules from a high-throughput structural database

Michele Ceriotti, Félix Benedito Clément Musil, Sandip De, Teresa Ingram, Carsten Baldauf

High-throughput computational materials design promises to greatly accelerate the process of discovering new materials and compounds, and of optimizing their properties. The large databases of structures and properties that result from computational search ...

Biomed Central Ltd2017

Enabling exact delay synthesis

Giovanni De Micheli, Mathias Soeken, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

Given (i) a Boolean function, (ii) a set of arrival times at the inputs, and (iii) a gate library with associated delay values, the exact delay synthesis problem asks for a circuit implementation which minimizes the arrival time at the output(s). The exact ...

IEEE2017

Scaling Up Concurrent Analytical Workloads on Multi-Core Servers

Iraklis Psaroudakis

Today, an ever-increasing number of researchers, businesses, and data scientists collect and analyze massive amounts of data in database systems. The database system needs to process the resulting highly concurrent analytical workloads by exploiting modern ...

EPFL2016

Mynodbcsv: Lightweight Zero-Config Database Solution for Handling Very Large CSV Files

Volumes of data used in science and industry are growing rapidly. When researchers face the challenge of analyzing them, their format is often the first obstacle. Lack of standardized ways of exploring different data layouts requires an effort each time to ...

2014

H2O: A Hands-free Adaptive Store

Anastasia Ailamaki, Ioannis Alagiannis

Modern state-of-the-art database systems are designed around a single data storage layout. This is a fixed decision that drives the whole architectural design of a database system, i.e., row-stores, column-stores. However, none of those choices is a univer ...

2014

A FFINITY: Efficiently Querying Statistical Measures on Time-Series Data

Karl Aberer, Saket Sathe

Computing statistical measures for large databases of time series is a fundamental primitive for querying and mining time-series data [1]–[6]. This primitive is gaining importance with the increasing number and rapid growth of time series databases. In thi ...

IEEE2013

Remotely powered implantable heart monitoring system for freely moving animals

Philippe Renaud, Catherine Dehollain, Harald Van Lintel, Enver Gürhan Kilinç, Alejandro Coronado Moya, Franco Maloberti

This paper presents a remotely powered implantable heart monitoring system for freely moving animals. The system measures the blood pressure in the left ventricle of the heart and transmits the data to a database unit. The implanted unit is remotely powere ...

IEEE2013

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

Query-driven indexing in large-scale distributed systems

Gleb Skobeltsyn

Efficient and effective search in large-scale data repositories requires complex indexing solutions deployed on a large number of servers. Web search engines such as Google and Yahoo! already rely upon complex systems to be able to return relevant query re ...

EPFL2009

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

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 ...

2007

Efficient processing of XPath queries with structured overlay networks

Karl Aberer, Manfred Hauswirth, Gleb Skobeltsyn

Non-trivial search predicates beyond mere equality are at the current focus of P2P research. Structured queries, as an important type of non-trivial search, have been studied extensively mainly for unstructured P2P systems so far. As unstructured P2P syste ...

Springer Verlag2005

Schema matching for structured document transformations

Aïda Boukottaya

This dissertation studies structured document content reuse problem. In structured document content reuse, a document (or a part of document) structured under one schema must be restructured and translated into an instance of a different schema. Thus, a no ...

EPFL2004