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 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…

The structured techniques for systems analysis and design are still the most widely known. One of the alternatives of this technique is the JAD methodology (Joint Application Design). This methodology is an improvement with respect to the existing ones -…

Framework comprehension is a very limiting factor to take full advantage of the benefits that frameworks offer to increase quality and productivity in software development. In this paper, a reverse engineering approach to framework comprehension using the MetaExplorer tool is…

The genetic algorithms have seen applied in knowledge discovery and specially for discovering association rules. In this paper, we explore the use of di erent rule quality measures in the tness function in a genetic algorithm for discovering association rules.…

Manipulating and retrieving multimedia data has received increasing attention with the advent of cloud storage facilities. The ability of querying by similarity over large data collections is mandatory to improve storage and user interfaces. But, all of them are expensive…

Clustering of short texts is an important research area because of its applicability in information retrieval and text mining. To this end was proposed CLUDIPSO, a discrete Particle Swarm Optimization algorithm to cluster short texts. Initial results showed that CLUDIPSO…

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…

The metric spaces model formalizes the similarity search concept in nontraditional databases. The goal is to build an index designed to save distance computations when answering similarity queries later. A large class of algorithms to build the index are based…

Ontology mapping involves the task of finding similarities among overlapping sources by using ontologies. In a Federated System in which distributed, autonomous and heterogeneous information sources must be integrated, ontologies have emerged as tools to solve semantic heterogeneity problems. In…