On the Equivalence of Distributed Systems with Queries and Communication - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

On the Equivalence of Distributed Systems with Queries and Communication

Serge Abiteboul
Balder ten Cate
  • Fonction : Auteur
  • PersonId : 883766
Yannis Katsis
  • Fonction : Auteur
  • PersonId : 883767

Résumé

Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study the equivalence of such systems. We model a distributed system by a collection of Active XML documents, i.e., trees augmented with function calls for performing tasks such as sending, receiving and querying data. As our model is quite general, the equivalence problem turns out to be undecidable. However, we exhibit several restrictions of the model, for which equivalence can be effectively decided. We also study the computational complexity of the equivalence problem, and present an axiomatization of equivalence, in the form of a set of equivalence-preserving rewrite rules allowing us to optimize a system by rewriting it into an equivalent, but possibly more efficient system.
Fichier principal
Vignette du fichier
axml-equiv.pdf (560.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00540199 , version 1 (23-04-2011)

Identifiants

  • HAL Id : inria-00540199 , version 1

Citer

Serge Abiteboul, Balder ten Cate, Yannis Katsis. On the Equivalence of Distributed Systems with Queries and Communication. International Conference on Database Theory, Mar 2011, Uppsala, Sweden. ⟨inria-00540199⟩
138 Consultations
223 Téléchargements

Partager

Gmail Facebook X LinkedIn More