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.
https://hal.inria.fr/hal-01169968 Contributor : David Gross-AmblardConnect in order to contact the contributor Submitted on : Tuesday, June 30, 2015 - 3:39:19 PM Last modification on : Thursday, October 21, 2021 - 3:34:39 AM Long-term archiving on: : Tuesday, April 25, 2017 - 8:26:20 PM
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⟩