An Upper Bound on the Number of Accesses for Datalog α Last Queries - BDA 2014<br>Gestion de Données – Principes, Technologies et Applications Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

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

Résumé

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
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

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

Licence

Paternité - Partage selon les Conditions Initiales

Identifiants

  • HAL Id : hal-01169968 , version 1

Citer

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⟩
76 Consultations
118 Téléchargements

Partager

Gmail Facebook X LinkedIn More