Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
PhD defense of Federico Ulliana
Federico Ulliana

12 December 2012, 14h00 - 12 December 2012, 15h30
Salle/Bat : 455/PCRI-N
Contact : fulliana@lri.fr

Activités de recherche :

Résumé :
In the last decade XML became one of the main standards for data storage and exchange on the Web. Detecting XML query-update independence is crucial to efficiently perform data management tasks, like those concerning view-maintenance, concurrency control, and security. This thesis presents a novel static analysis technique to
detect XML query-update independence, in the presence of a schema. Rather than types, the presented system infers chains of types. Each chain represents a path that can be traversed on a valid document during query/update evaluation. The resulting independence analysis is precise, although it raises a challenging issue: recursive schemas may lead to infer infinitely many chains. This thesis presents a sound and complete approximation technique ensuring a finite analysis in any case, together with an efficient implementation performing the chain-based analysis in polynomial space and time.

Pour en savoir plus :
Séminaires
Distributed decision and verification by mobile ag
Algorithmique distribuée
Tuesday 22 January 2019 - 10h30
Salle : 465 - PCRI-N
Evangelos Bampas .............................................

Redundancy in Distributed Proofs
Algorithmique distribuée
Tuesday 04 December 2018 - 00h00
Salle : 465 - PCRI-N
Ami Paz .............................................

Some recent results on the integer linear programm
Théorie des graphes
Friday 30 November 2018 - 00h00
Salle : 445 - PCRI-N
Hung Nguyen .............................................

Scalable and exhaustive screening of metabolic fun
Wednesday 28 November 2018 - 11h00
Salle : 465 - PCRI-N
Clémence Frioux .............................................

De la sociologie *avec* des algorithmes à la socio
Friday 09 November 2018 - 14h30
Salle : 445 - PCRI-N
Christpohe Prieur .............................................