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

We present point slicing, a new slicing technique for imperative programs that gives an answer to the question Which sentences can be executed if sentence p is executed?, very common in program testing, debugging, and understanding tasks and, as far…

As a contribution to consider software projects to be risk investments, it is important the full standardization of either the planning methodology (as a subset of project management methodology) and the effort estimation method. We think there is important and…