An Upper Bound on the Number of Accesses for Datalog α Last Queries - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

An Upper Bound on the Number of Accesses for Datalog α Last Queries

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.
Fichier principal
Vignette du fichier
bda2014-actes-phd-6-pp31-32.pdf (513.57 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01169968 , version 1 (30-06-2015)

Licence

Attribution - ShareAlike

Identifiers

  • HAL Id : hal-01169968 , version 1

Cite

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⟩
73 View
117 Download

Share

Gmail Facebook X LinkedIn More