A data warehouse efficiently processes a given set of queries by utilizing the multiple materialized views. Owing to the constraint on space and maintenance cost, the materialization of all views is unfeasible. One of the critical decisions involved in the…

The term Federated Databases refers to the data integration of distributed, autonomous and heterogeneous databases. However, a federation can also include information systems, not only databases. At integrating data, several issues must be addressed. Here, we focus on the problem…

Vertical partitioning, in which attributes of a relation are
assigned to partitions, is aimed at improving database
performance. We extend previous research that is based on
a single relation to multi-relation database environment,
by including referential integrity constraints, access time

This book provides an excellent foundation for the principles of database and data management. It explains some of the more difficult concepts fairly well. The book is meant for an introductory course in database management which is usually required as…

The studies of Relational Data Base Management Systems and Databases constitute nowadays a main tren of investigation in large businesses and universities of the entire world. The creation of a data base engine keeps being a challenge since there are…

This paper presents an evolution of a simulation environment where situations in which a DDB should maintain data integrity are modeled and implemented. These situations include failures taking place during transactions, and the focus is mainly on the utilization and…

We present partial results of a research project in which we use boolean circuits as a parallel computation model for the expression of queries to relational databases. For that purpose, we use the well-known equivalence between First Order Logic (FO)…

Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, called Sparse Spatial Selection (SSS).
The main characteristic of this method is that it…

Nowadays, data intensive applications are in constant demand and there is need of computing environments with better intelligent capabilities than those present in today's Database Management Systems (DBMS). To build such systems we need formalisms that can perform complicate inferences,…

This paper presents a data structure based on Sparse Spatial Selection (SSS) for similarity searching. An algorithm that tries periodically to adjust pivots to the use of database index is presented. This index is dynamic. In this way, it is…