Abstract : In the mediation approach for data integration, domain rules [2, 3] were previously proposed to deal with access limitations (aka access patterns). For data integration systems (e.g., DaWeS [6, 5]) that use domain rules, we study an upper bound on the possible number of accesses implied by the evaluation of an executable query (expressed with relations having access patterns). Indeed it allows to compare various evaluation algorithms, to schedule API operation calls and meet the service level agreements (SLA) of the service providers.
Type de document :
Communication dans un congrès
BDA 2014 : Gestion de données - principes, technologies et applications, Oct 2014, Autrans, France. pp.31--32
https://hal.inria.fr/hal-01169968
Contributeur : David Gross-Amblard
<>
Soumis le : mardi 30 juin 2015 - 15:39:19
Dernière modification le : jeudi 11 janvier 2018 - 06:16:31
Document(s) archivé(s) le : mardi 25 avril 2017 - 20:26:20
John Samuel, Benjamin Momège. An Upper Bound on the Number of Accesses for Datalog α Last Queries. BDA 2014 : Gestion de données - principes, technologies et applications, Oct 2014, Autrans, France. pp.31--32. 〈hal-01169968〉
