On the equivalence of distributed systems with queries and communication

Serge Abiteboul 1, 2 Yannis Katsis 3 Balder Ten Cate 4
2 DAHU - Verification in databases
CNRS - Centre National de la Recherche Scientifique : UMR8643, Inria Saclay - Ile de France, ENS Cachan - École normale supérieure - Cachan, LSV - Laboratoire Spécification et Vérification [Cachan]
Abstract : Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluating 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-00879029
Contributor : Serge Abiteboul <>
Submitted on : Thursday, October 31, 2013 - 3:31:48 PM
Last modification on : Wednesday, August 7, 2019 - 12:18:47 PM
Long-term archiving on : Saturday, February 1, 2014 - 4:28:57 AM

File

axml-equiv.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00879029, version 1

Collections

Citation

Serge Abiteboul, Yannis Katsis, Balder Ten Cate. On the equivalence of distributed systems with queries and communication. Journal of Computer and System Sciences, Elsevier, 2013. ⟨hal-00879029⟩

Share

Metrics

Record views

503

Files downloads

319