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…

The appearance and continuous growth of virtual communities on the web imposes the challenge of coping with the large amount of information and knowledge these communities produce. The Semantic Web with its set of standards and technologies provides the basic…

In this paper, we present a UML profile and a group of UML patterns for documenting the component-and-connector views of software architectures [8]. They facilitate the creation of the component and connector viewtype in any UML 2.0 tool with a…

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…

Resumen de la tesis del autor para obtener el grado de Magister en Redes de Datos de la Facultad de Informática de la UNLP, dirigida por Luis Armando Marrone.

This document describes a research and development project - Semantic Web and Cooperative Problem Solving for Online Communities of Practice. The aim of the project is to build a system supporting Cooperative Problem Solving within the framework of online Communities…

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

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…