• Aucun résultat trouvé

DBWeb: Research Topics Pierre Senellart

N/A
N/A
Info
Télécharger
Protected

Academic year: 2022

Partager "DBWeb: Research Topics Pierre Senellart"

Copied!
6
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

DBWeb: Research Topics

Pierre Senellart

(2)

The DBWeb team

The team:

4 permanent researchers (+1 multi-affiliated member) 6 PhD candidates (+2 multi-affiliated students)

At the confluence of four areas of research:

Web data management, social networks XML database systems

Database theory Cognitive science

(3)

Web data management, social networks

Unsupervisedinformation extractionfrom the structured Web (PhD thesis of Nora Derouiche)

Web archiving: RSS feeds, deep Web, and other new forms of Web information (PhD thesis of Marilena Oita)

Trustinference, propagation, and management insocial networks (PhD theses of Silviu Maniu and Imen Ben Dhia)

Large-scalerecommendation systems(PhD thesis of Modou Gueye)

Data cleaningand data enrichment using Web sources

(4)

XML database systems

Aprobabilistic XMLsystem (PhD thesis of Asma Souihli) XML diffsand application to document integration

Access controlin XML documents

PruningofXQueryqueries (see Talel’s talk)

(5)

Database theory

Probabilistic XML(PhD thesis of Evgeny Kharlamov)

Answering queries using views, in relational and XML settings Answering queries in the presence oflimited access patterns, e.g., in the deep Web

(6)

Cognitive science

Temporal informationin natural language: modeling, extraction (PhD thesis of Damien Munch)

Evolutionaryaspects of communication and language

Relevance, surprise, coincidences: aKolmogorov complexity explanation

Références

Télécharger maintenant ( PDF - 6 Page - 59.88 KB )

Documents relatifs

Answering Ontological Ranking Queries Based on Subjective Reports

– As we are using a kind of “how”-provenance modeled using semirings, we can map the general semiring to more specific ones that capture different ways in which the

Combined Complexity of Answering Tree-like Queries in OWL 2 QL

u t Discussion If we compare the new and existing results for OWL 2 QL with those from relational databases, we observe that adding an OWL 2 QL TBox of bounded depth does not change

Answering EL Queries in the Presence of Preferences

We apply this idea to model the preferences of query answers indirectly, by modeling the preferences over the contexts that entail them.. In a nutshell, we divide an EL knowledge

Elastiq: Answering Similarity-threshold Instance Queries in EL

To answer a relaxed instance query is to compute for a given concept C, a CSM ∼, and a threshold t between 0 and 1, a set of concepts such that each of these concepts are similar to

Answering Queries over OWL Ontologies with SPARQL

In this paper, we present a sound and complete algorithm for answering SPARQL queries under the OWL 2 Direct Semantics entailment regime (from now on, SPARQL-OWL), describe

Answering Metric Skyline Queries by PM-tree

The experimentation with M-tree and PM-tree based metric skyline processing has shown that the PM-tree outperforms the M-tree implementation up to 2 times in the number of

Answering Reachability Queries on Streaming Graphs

As a more specific use case we can consider Urban Computing [7], which is the application of pervasive computing to urban environments. The data in this application can be modeled

Answering SPARQL Queries using Views

We use SPARQL conjunctive queries as views that describe sources contents. As in the Bucket Algorithm [20], relevant sources are selected per query subgoal, i.e., triple pattern.