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…

The development of languages allowing a proper handling of time is important in many areas of computer science because the capability to deal with the notions of change and time are essential to solve their problems.
In the development of…

In this position paper, the main steps to measure and evaluate quantitatively the quality of sites are shown. Besides, some specific models, criteria and procedures to apply in these activities are discussed by quoting case studies already performed (e.g., in…

Time and change are notions that seems unavoidable in some areas of work and investigation, languages that can deal with these notions are necessary. At the same time, methods for a proper time handling are quite complex, mainly because problem’s…

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…

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…