Your mediators need data conversion!
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Piazza: data management infrastructure for semantic web applications
WWW '03 Proceedings of the 12th international conference on World Wide Web
DBGlobe: a service-oriented P2P system for global computing
ACM SIGMOD Record
Active XML: peer-to-peer data and web services integration
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XPeer: a self-organizing XML P2P database system
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
| Hi-index | 0.00 |
In XML peer-to-peer (p2p) database systems, query results are usually assumed to be incomplete. Incompleteness issues derive from the unstable and open-ended nature of the network, where new nodes may connect at any time, and existing nodes may suddenly disappear. The incompleteness of input data used for query evaluation may also lead to the incorrectness of query results, which greatly affects the usefulness of the whole p2p approach to XML databases. In this paper we formally deal with the problem of result correctness in the presence of incomplete input data, and identify query classes for which the result correctness can be statically predicted at no extra cost w.r.t. usual syntactical and semantic query analysis.