Distributed Reactive XML

XML-centric models of computation have been proposed as an answer to the demand for interoperability, heterogeneity and openness in coordination models. We present a prototype implementation of an open XML-centric coordination middleware called Distributed Reactive XML. The middleware has as theoretical foundation a general distributed extensible process calculus inspired by the theory of Bigraphical Reactive Systems. The calculus is extensible just as XML is extensible, in that its signature and reaction rules are not fixed. It is distributed by allowing both the state of processes as well as the set of reaction rules to be distributed (or partly shared) between different clients. The calculus is implemented by representing process terms as XML documents stored in a value-oriented, peer-to-peer XML Store and reaction rules as XML transformations performed by the clients. The formalism does not require that only process terms are stored-inside process terms one may store application specific data as well. XML Store provides transparent sharing of process terms between all participating peers. Conflicts between concurrent reaction rules are handled by an optimistic concurrency control. The implementation thus provides an open XML-based coordination middleware with a formal foundation that encompasses both the shared data, processes and reaction rules.

[1]  Robin Milner,et al.  Axioms for bigraphical structure , 2005, Mathematical Structures in Computer Science.

[2]  JensenOle Høgh,et al.  Bigraphs and transitions , 2003 .

[3]  Ioana Manolescu,et al.  Active XML: Peer-to-Peer Data and Web Services Integration , 2002, VLDB.

[4]  Cédric Fournet,et al.  The reflexive CHAM and the join-calculus , 1996, POPL '96.

[5]  Franco Zambonelli,et al.  Coordination middleware for XML-centric applications , 2002, SAC '02.

[6]  Shih-Ying Chen,et al.  Concurrency control in XML document databases: XPath locking protocol , 2002, Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings..

[7]  Philippa Gardner,et al.  Modelling dynamic web data , 2003, Theor. Comput. Sci..

[8]  J. Stefani Global Computing Project IST-2001-32222 Mobile Calculi Based on Domains Requirements for a Global Computing Programming Model , 2003 .

[9]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

[10]  Vladimiro Sassone,et al.  BiLog: Spatial Logics for Bigraphs , 2006 .

[11]  Alberto O. Mendelzon,et al.  Research Issues in Structured and Semistructured Database Programming , 1999, Lecture Notes in Computer Science.

[12]  Robin Milner,et al.  Bigraphs and mobile processes (revised) , 2004 .

[13]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[14]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[15]  Wenfei Fan,et al.  Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model , 1999, DBPL.

[16]  Paolo Manghi,et al.  The Query Language TQL , 2002, WebDB.

[17]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.

[18]  Luca Cardelli Semistructured Computation , 1999, DBPL.

[19]  Robin Milner,et al.  Bigraphs and transitions , 2003, ACM-SIGACT Symposium on Principles of Programming Languages.

[20]  Jesper Tejlgaard Pedersen Value-oriented XML store , 2002 .

[21]  Vladimiro Sassone,et al.  Bigraphical Logics for XML , 2005, SEBD.

[22]  Ioana Manolescu,et al.  Active XML: A Data-Centric Perspective on Web Services , 2004, Web Dynamics.