In this paper we focus on a (as much as possible) simple logic, called XHyb, expressive enough to allow the specification of the most common integrity constraints in XML documents. In particular we will deal with constraints on ID and IDREF(S) attributes, which are the common way of logically connecting parts of XML documents, besides the usual containment relation of XML elements.

An important aspect of data integration involves answering queries using various resources rather than by accessing database relations. The process of transforming a query from the database relations to the resources is often referred to as query folding or answering queries using views, where the views are the resources. We present a uniform approach that includes as special cases much of the ...

Our goal is to develop a scienti c understanding of the kinds of mandatory controls needed to support data integrity. There is general consensus that integrity is an important problem and requires some kind of mandatory controls for its solution. At the same time, inspite of considerable e ort [17, 18, for instance], there is little consensus on what is meant by the two key terms: mandatory con...

We present a system for publishing as XML data from mixed (relational+XML) proprietary storage, while supporting redundancy in storage for tuning purposes. The correspondence between public and proprietary schemas is given by a combination of LAVand GAV-style views expressed in XQuery. XML and relational integrity constraints are also taken into consideration. Starting with client XQueries form...

In this paper we analyse some of the classical paradoxes in Social Choice Theory (namely, the Condorcet paradox, the discursive dilemma, the Ostrogorski paradox and the multiple election paradox) using a general framework for the study of aggregation problems called binary aggregation with integrity constraints. We provide a definition of paradox that is general enough to account for the four c...

We propose and investigate a semantics for peer data exchange systems (or peer data management systems) where different peers are pairwise related to each other by means of data exchange constraints and trust relationships. These two elements plus the data at the peers’ sites and the local integrity constraints for a peer are made compatible via the proposed semantics by determining a set of so...

When data sources are integrated into a single global system, inconsistencies wrt global integrity constraints are likely to occur. In this paper, the notion of consistent answer to a global query in the context of the local-as-view approach to data integration is characterized. Furthermore, a methodology for generating query plans for retrieving consistent answer to global queries is introduce...

The present paper introduces two new information merging protocols for the family of adaptive logics ADM, for which majority merging has been defined in previous work. The new adaptive operators reflect the negotiation processes of quasi-merging and pure-arbitration known from the Integrity Constraints framework. The Adaptive Variant Counting selection provides results equivalent to the GMax fa...

We formulate and study a privacy guarantee to data owners, who share information with clients by publishing views of a proprietary database. The owner identifies the sensitive proprietary data using a secret query against the proprietary database. Given an extra view, the privacy guarantee ensures that potential attackers will not learn any information about the secret that could not already be...

Medication errors are harmful and costly for healthcare systems. Recent studies show that a major part of these errors are due to the problems in transferring the patient current medication-data between primary and secondary healthcare. Recent ICT development promises to improve the communication between primary and secondary healthcare. In order to find out the constraints that may hamper a co...