• Aucun résultat trouvé

November21st,2016 AntoineAmarilli ,SilviuManiu UncertainDataManagementClassStructure

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

Academic year: 2022

Partager "November21st,2016 AntoineAmarilli ,SilviuManiu UncertainDataManagementClassStructure"

Copied!
8
0
0

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

Texte intégral

(1)

Uncertain Data Management Class Structure

Antoine Amarilli1, Silviu Maniu2

1Télécom ParisTech

2LRI

November 21st, 2016

1/8

(2)

Class 1 (Nov 21): Introduction and Reminder

Motivations andsources of uncertain data Classstructure (these slides!)

Reminder: relational algebra and relational calculus

(3)

Class 2 (Nov 28): Open- and Closed-World Databases

Open-world databases: modeling incompleteness Missing values (NULLs)

c-tables

Representation size for the various models

3/8

(4)

Class 3 (Dec 5): Relational Probabilistic Databases

Semantics of probabilistic databases Models:

Tuple-independent databases

Block-independent disjoint databases pc-tables

Extensions

(5)

Class 5 (Dec 12): Querying Relational Prob. Databases

Semantics of queries on uncertain data

Extensionalapproach: evaluating the querydirectly Intensional approach: computing the query lineage Tractable rulesfor query evaluation

Tractable lineageclasses Computationalhardness results

5/8

(6)

Class 4 (Jan 9): Non-Relational Probabilistic Databases

Uncertain XML

Semanticsof documents Modelsand compactness Query languagesand complexity Uncertain graphs: queries and semantics

(7)

Class 6 (Jan 16): Practical Applications

Social Applications Crawling the Web Crowdsourcing

Practical implementation The MayBMSengine

7/8

(8)

Class 7 (Jan 23): Lab Session

Lab session: MayBMS

Références

Télécharger maintenant ( PDF - 8 Page - 45.34 KB )

Documents relatifs

Query Rewriting under Existential Rules

This invited talk is based on a long line of research that is still ongoing, and several researchers from different institutions have been involved: Pablo Barcel´o (University

Query Labelling for Indic Languages using a hybrid approach

Named Entity recognition was done based on a lookup based method that would classify words as named entities in the test set if they were found in the training set.. This

Tractable Query Answering and Optimization for Extensions of Weakly-Sticky Datalog+-

For example, the function S ⊥ that always returns an empty set of finite po- sitions, WChS(S ⊥ ) is the class of sticky programs, because stickiness must hold no matter what

A Query Structured Approach for Model Transformation

Fig. 6 shows the code for defining the class-to-table example in ETL. Inten- tionally, the code font size used is very small in the figure, since we will not discuss in detail each

Tractable Approaches to Consistent Query Answering in Ontology-Based-Data Access

We study the data complexity of conjunctive query answering under these new semantics, and show a general tractability result for all known first-order rewritable ontology languages.

Faceted Approach To Diverse Query Processing

This method is the simplest one and it is often the only method available when the user does not know anything about the subject to search, or the user’s knowledge on the query

A General Approach to Query the Web of Data

The task of data discovery and extraction is to discover new data sources those are unknown in advance for the query processing according to the data inference configuration.. The

Tractable Query Answering over Ontologies with Datalog+/-

An important result of these works is that the main variants of DL-Lite are not only decidable, but that answering (unions of) conjunctive queries for these logics is in LOGSPACE ,