Query optimization by using knowledge about data semantics
In this paper we address the problem of using semantic properties of data within the process of query optimization. The discussion is in terms of the relational data model. We present query transformation rules, called semantic transformation rules (or simply semantic rules), that are based on the database properties expressed by the integrity constraints. The semantic rules presented in the paper allow join elimination, clustering index introduction and empty query test according to the content of the integrity constraints. We provide a formal proof of the correction of such transformation rules. We also investigate the problem of using semantic rules within transactions, where any arbitrary sequence of queries and modification operations may occur, and semantic integrity can be violated during intermediate steps of processing. Conditions are provided under which the semantic rules presented in the paper can be correctly applied to transform queries occurring within complied transactions.

title: Extending the ODMG Object Model with Time
abstract: Although many temporal extensions of the relational data model have been proposed, there is no comparable amount of work in the context of object-oriented data models. Moreover, extensions to the relational model have been proposed in the framework of SQL standards, whereas no attempts have been made to extend the standard for objectoriented databases, defined by ODMG. This paper presents T_ODMG, a temporal extension of the ODMG-93 standard data model. The main contributions of this work are, thus, the formalization of the ODMG standard data model and its extension with time. Another contribution of this work is the investigation, on a formal basis, of the main issues arising from the introduction of time in an object-oriented model.

title: Extending the ODMG object model with composite objects
abstract: In this paper we extend the ODMG object data model with composite objects. A composite object is an object built by aggregating other component objects. Exclusiveness and dependency constraints, as well as referential integrity, can be associated with composition relationships among objects. Our composite object model is developed in the framework of the ODMG object database standard data model, but can be used in both object-oriented and object-relational database systems. In the paper, we propose a language for defining composite objects and we define the semantics of update operations on composite objects.

title: A temporal authorization model
abstract: This paper presents a discretionary access control model in which authorizations contain temporal information. This information can be used to specify temporal intervals of validity for authorizations and temporal dependencies among authorizations. A formal definition of those concepts is presented in the paper, in terms of their interpretation in first order logic. We characterize sets of temporal dependencies that can lead to undesirable states of the authorization system and we sketch an algorithm for their detection. Finally, operations to add, remove, or modify authorizations and temporal dependencies are described.

title: An Approach to Authorization Modeling in Object-Oriented Database Systems
abstract: Authorization is an important functionality that every data management system should provide. An authorization mechanism allows different access rights on data items to be selectively assigned to users. Authorization models and mechanisms have been widely investigated in the framework of traditional database systems. The extension of those models and mechanisms to advanced data management systems is quite complex, because those systems are characterized by data models with a larger number of semantic constructs than traditional models, like the relational one. A first authorization model defined for object-oriented (and semantic) database systems has been presented in . In this paper we present an authorization model that substantially extends and revises that model. The most significant extension concerns the support for content-dependent authorization, which was not provided in . Content-dependent authorization is very important in providing an authorization mechanism able to directly support authorization policies of application environments. Moreover, it is a crucial functionality in environments where data objects frequently change their status. In addition, the model presented here differs from the model defined in [20] in that new authorization types are introduced and a finer control of versions is provided. Finally, authorization administration of objects is considered.

title: An index allocation tool for object-oriented database systems
abstract: The problem of index configuration is an important topic for database system performance and has been extensively investigated for relational Database Management Systems (DBMS). By contrast, the problem of index allocation for Object-Oriented DBMS (OODBMS) has been considered only from a theoretical point of view and no practical development of any tool for commercial OODBMS has been reported. In this paper, we investigate the problem of index configuration in the framework of a commercially available OODBMS. We first identify the features that characterize such OODBMS and we develop two cost models: the first extends the generic cost model presented by Gardarin et al. (), the second is an analytical cost model tailored to the OODBMS at hand. Both cost models have been validated by comparing the estimated costs and the actual costs observed from the system. The comparison has shown that both models are quite accurate. Using the proposed cost models, we have also developed an algorithm for the efficient index allocation on a given path, given a workload specified in terms of operation frequencies. Even though our algorithm has been developed for a specific OODBMS, we believe that it can be easily tailored to other OODBMS and persistent programming languages.

title: Controlled and cooperative updates of XML documents in byzantine and failure-prone distributed systems
abstract: This paper proposes an infrastructure and related algorithms for the controlled and cooperative updates of XML documents. Key components of the proposed system are a set of XML-based languages for specifying access-control policies and the path that the document must follow during its update. Such path can be fully specified before the update process begins or can be dynamically modified by properly authorized subjects while being transmitted. Our approach is fully distributed in that each party involved in the process can verify the correctness of the operations performed until that point on the document without relying on a central authority. More importantly, the recovery procedure also does not need the participation of a central authority. Our approach is based on the use of some special control information that is transmitted together with the document and a suite of protocols. We formally specify the structure of such control information and the protocols. We also analyze security and complexity of the proposed protocols.

title: Privacy preserving schema and data matching
abstract: In many business scenarios, record matching is performed across different data sources with the aim of identifying common information shared among these sources. However such need is often in contrast with privacy requirements concerning the data stored by the sources. In this paper, we propose a protocol for record matching that preserves privacy both at the data level and at the schema level. Specifically, if two sources need to identify their common data, by running the protocol they can compute the matching of their datasets without sharing their data in clear and only sharing the result of the matching. The protocol uses a third party, and maps records into a vector space in order to preserve their privacy. Experimental results show the efficiency of the matching protocol in terms of precision and recall as well as the good computational performance.

title: An integrated approach to federated identity and privilege management in open systems
abstract: Online partnerships depend on federations of not only user identities but also of user entitlements across organizational boundaries.