Research
Our Main Research Topics
We consider two main research areas for our expertise development. First, we are working on maximizing performance in Graph Database Management Systems. In this area, we propose a new way to devise data storage and management. Information tends to be organized in large networks where not only data about certain entities are important, but also the relationship between those entities. Examples of this may include social networks, biochemical investigation on complex organisms, communication networks, etc. We propose a new and sound system that allows for the efficient manipulation of data in large networks. This type of system poses new research challenges to be explored. Second, we study performance in Relational Database Management Systems. Most of the data in the real world is still organized following the traditional relational model. In this situation, it is mandatory to be able to return reliable and fast answers to user queries on complex databases.
Research Projects
Graph Databases
Data tends to be organized in huge data networks!
The size of the volume of data manipulated in any organization is Today constantly drier. The analysis of these has an increasingly greater role In the decision-making of large enterprises or in the study of various fields, Academics and non-academics, which have an impact on the improvement of life Society in which we live.
Graph Database Projects
Relational Database Management Systems
Managing large amounts of relational data!
The use of Relational Database Management Systems as powerful tools to store, modify and access data in a database is completely generalized world-wide. The complexity of RDBMSs range from the most simple applications, designed for home use or small companies with modest information storage requirements, like Microsoft Access, to very complex and sophisticated RDBMSs, such as DB2 UDB, Oracle or Microsoft SQL Server, used in critical situations where the huge amount of data to be manipulated requires advanced techniques to improve performance.
However, the rapid and continuous growth of the amount of data to be stored and manipulated in-creases beyond the possibilities of current hardware and software, jeopardizing the acceptable performance of RDBMSs.
Active Relational DBMS Projects
Past Relational DBMS Projects
Distributed cache techniques for search engines
Current Information Retrieval systems deal with giant data repositories: the major search engines crawl more than a trillion unique URLs now and the number will continue to grow. The location of useful information in these huge repositories requires very efficient architectures and algorithms to achieve a good performance.The details of the architecture in major search engines have evolved with the new technology and algorithms available, however some fundamental characteristics are latent in their designs: distributed computing and data caching. One single computer is far from achieving the throughput required by major search engines, and the engineers deploy these systems on clusters of computers, often based on commodity hardware. Although this architecture accumulates the processing power of several computing nodes, it is not enough to rely on the accumulation of hardware because the amount of resources needed would become prohibitive. This project targets the improvement of cache-aware techniques for distributed systems in order to improve the system performance.
Cooperative caching
