This paper describes XPeer, a zero-administration system for sharing and querying XML data. The system allows users to share XML data without significant human intervention, and to pose XQuery FLWR queries against them.The proposed system can be used in any application field, being a general purpose XML p2p DBMS, even though its main application is the management of resource descriptions in GRID environments. This work was partly funded by the FIRB GRID.IT project. Our Contribution This paper describes a zero-administration p2p system for sharing and querying XML data (XPeer). The system allows users to share XML data and to pose XQuery FLWR queries against them without any significant human intervention (the user still has to write her own queries). The system, based on a hybrid p2p architecture, self-organizes its superpeer network, and allows for arbitrary changes in the network topology. Paper Outline The paper is organized as follows. Section 2 describes some important issues that emerge in the management of p2p XML databases. Section 3, then, presents an overview of the system, while Section 4 illustrates the system architecture in more detail. Section 5, next, outlines the techniques used in XPeer for processing queries. Section 6, then, discusses some related works. In Section 7, finally, we draw our conclusions and describe some future work. 2 Issues in P2P XML Data Management The problem of managing p2p XML databases is quite complex. The source of most issues is the dynamic nature of these systems, where both data and topology may suddenly change. Hence, a closer look at these aspects is necessary. Changing topology Peer-to-peer systems are usually described as open-ended networks of peers willing to share resources. Peers are autonomous, in the sense that they are free to choose the data to contribute to the system, to manage local data without external constraints, and to connect and disconnect at any time. As a consequence, the system is formed by a collection of nodes S = {p 1 ,. .. , p n } that can evolve over time. Topology changes mostly affect the indexing structures used for routing queries. For instance, if a node p i containing data (let's say a set of XML nodes s) relevant for a query q suddenly becomes unreachable, then any index entry associating p i to s should be updated to avoid unnecessary messages, or, in the worst case, run-time problems. Local updates Peer autonomy implies that peers have the right to update their data, even if shared, at any time. In particular, peers can perform both value and schema changing updates (unlike in relational databases, the loose structure of XML data blurs the distinction between value and schema updates). Value and schema updates influence query mediation and query routing since sudden data changes may invalidate existing query plans or routing structures, hence imposing potentially expensive updates of distributed index structures. Moreover, most schema-driven data management approaches (see [1]) are severely affected by local updates, hence requi...

Abstract. Bigraphs are emerging as an interesting model for concurrent calculi, like CCS, pi-calculus, and Petri nets. Bigraphs are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper-)graph for connections. With the aim of describing bigraphical structures, we introduce a general framework for logics whose terms represent arrows in monoidal categories. We then instantiate the framework to bigraphical structures and obtain a logic that is a natural composition of a place graph logic and a link graph logic. We explore the concepts of separation and sharing in these logics and we prove that they generalise some known spatial logics for trees, graphs and tree contexts.

TQL is a query language for semi-structured data. TQL binding mechanism is based upon the ambient logic. This binding mechanism is the key feature of TQL, but its implementation is far from obvious, being based on a logic which includes "difficult" operators such as negation, universal quantification, recursion, and new tree-related operators. In [6] an "implementation model" is presented, here we first extend it with tree operations, hence obtaining an algebra for the full TQL language. Then we shortly describe the evaluation techniques that we exploit in the actual implementation. 1. R. Baeza-Yates et al. (eds.

Abstract. We study decidability of a logic for describing processes with restricted names. We choose a minimal fragment of the Ambient Logic, but the techniques we present should apply to every logic which uses Cardelli and Gordon revelation and hiding operators, and Gabbay and Pitts freshness quantifier. We start from the static fragment of ambient logic that Calcagno, Cardelli and Gordon proved to be decidable. We prove that the addition of a hiding quantifier makes the logic undecidable. Hiding can be decomposed as freshness plus revelation. Quite surprisingly, freshness alone is decidable, but revelation alone is not.