Catégorie

Data exchange

Publications associées (32)

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

ChemCalc: a building block for tomorrow’s chemical infrastructure

Alain Borel, Luc Patiny

Web services, as an aspect of cloud computing, are becoming an important part of the general IT infrastructure, and scientific computing is no exception to this trend. We propose a simple approach to develop chemical web services, through which servers cou ...

2013

Measurements of B Meson Lifetime Ratios with the LHCb Detector

Johan Luisier

The LHCb experiment is one of the four main experiments at the Large Hadron Collider (LHC) at CERN. The LHCb detector is a one-arm spectrometer dedicated to precise measurements of the CP-violation and studies or rare b-hadron decays. The centre of mass en ...

EPFL2012

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

Efficient static analysis of XML paths and types

We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically type-check XPath queries. To this end, we prove the decidability of a logic with converse for finite ordered trees whose time comple ...

2007

Self-Organizing Schema Mappings in the GridVine Peer Data Management System

Karl Aberer, Philippe Cudré-Mauroux, Parisa Haghani, Adriana Budura

GridVine is a Peer Data Management System based on a decentralized access structure. Built following the principle of data independence, it separates a logical layer -- where data, schemas and mappings are managed -- from a physical layer consisting of a s ...

2007

From Bioinformatic Web Portals to Semantically Integrated Data Grid Networks

Karl Aberer, Philippe Cudré-Mauroux, Adriana Budura

We propose a semi-automated method for redeploying bioinformatic databases indexed in a Web portal as a decentralized, semantically integrated and service-oriented Data Grid. We generate peer-to-peer schema mappings leveraging on cross-referenced instances ...

2007

Efficient Semi-structured Queries in Scala using XQuery Shipping

This project proposes a new approach to interact with database systems through programming languages. A formal query language can be integrated within modern programming languages and the semi-structured queries can be evaluated using automatic transformat ...

2006

A Search Engine for QoS-enabled Discovery of Semantic Web Services

Karl Aberer, Manfred Hauswirth

Directory services are a genuine constituent of any distributed architecture which facilitate binding attributes to names and then querying this information, i.e., announcing and discovering resources. In the web services domain this functionality is provi ...

2006

An Extensible Query Execution Engine for Supporting New Query Execution Models

Query processing in traditional Database Management Systems (DBMS) has been extensively studied in the literature and adopted in industry. Such success is, in part, due to the performance of their Query Execution En-gines (QEE) for supporting the execution ...

2005

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

2005