Concept

Base de données XML native

Publications associées (41)

AFFINITY: Efficiently Querying Statistical Measures on Time-Series Data

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

2012

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

Influence of the constant life diagram formulation on the fatigue life prediction of composite materials

Thomas Keller, Anastasios Vassilopoulos, Behzad Dehghan Manshadi

The influence of the constant life diagram (CLD) formulation on the fatigue life prediction of composite materials was examined. Most commonly used and recently proposed CLDs applied on composite materials fatigue data are presented and their applicability ...

Elsevier2010

Incremental Query Evaluation in a Ring of Databases.

Christoph Koch

This paper approaches the incremental view maintenance problem from an algebraic perspective. We construct a ring of databases and use it as the foundation of the design of a query calculus that allows to express powerful aggregate queries. The query calcu ...

2010

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

Improving OLTP Concurrency through Early Lock Release

Anastasia Ailamaki, Frederick Ryan Johnson, Manoussos Gavriil Athanassoulis, Radu Ioan Stoica

Since the beginning of the multi-core era, database systems research has restarted focusing on increasing concurrency. Even though database systems have been able to accommodate concurrent requests, the exploding number of available cores per chip has surf ...

2009

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

Evaluation of Background Subtraction Methods

Samira Sheikhi

In this paper we evaluate and compare six well-known foreground from background subtraction methods against a standard database. To be able to compare these algorithms objectively, we have chosen three challengeable scenarios from this database. The algori ...

2008

On finding nearest neighbors in a set of compressible signals

Pierre Vandergheynst, Philippe Jost

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

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