Applying design patterns is considered a helpful technique for designing software systems.
Patterns description, however, results not sufficiently precise providing a weak understanding and making it difficult to be certain when a pattern is being used correctly. We have formally…

The main purpose of this book is to present the contents of an introductory course in databases. In this regard, one can find a number of material validity and recognized different scopes. This work is developed under the guidelines that…

Hybrid dynamic spatial approximation trees are recently proposed data structures for searching in metric spaces, based on combining the concepts of spatial approximation and pivot based algorithms. These data structures are hybrid schemes, with the full features of dynamic spatial…

In C++, Generative Programming (GP) techniques are being used to generate highly customized and optimized products automatically manufactured at compile-time; to provide these functionalities increasing compiling power is required.
This work presents an improved compilation model for C++ by adding…

The Semantic Web attempts to reach a state in the future where everything on the Web will no longer be only machine-readable, but also machine-understandable. An ontology is an explicit specification of a conceptualization. A conceptualization is an abstract, simplified…

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…

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…

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

The concept of “approximate” searching has applications in a vast number of fields. Some examples are non-traditional databases (e. g. storing images, fingerprints or audio clips, where the concept of exact search is of no use and we search instead…

This paper is an attempt to define how a
specific data structure might be used to
store, in a persistent manner, temporal
information during a computer simulation.
In particular, it considers the sort of
temporal information generated during a
discrete…