Demo Data from VLDB 2026 / reviewers in the wild / expert
Alexandre A. B. Lima
dblp:62/2290
· DBLP profile ↗
7ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0001-7486-0415ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 5 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
High-performance computing · 77% Distributed systems · 23% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
bioinformatics workflow |
0.1 | 1 | 2010 | Data parallelism in bioinformatics workflows using Hydra · HPDC 2010 |
High-performance computing › scientific workflow
scientific workflow management |
0.1 | 1 | 2010 | Data parallelism in bioinformatics workflows using Hydra · HPDC 2010 |
Distributed systems
data provenance |
0.0 | 1 | 2010 | Data parallelism in bioinformatics workflows using Hydra · HPDC 2010 |
Methods — techniques the papers use, named apart from their topics
data parallelism · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | OLAP parallel query processing in clouds with C-ParGRESabstractSummary The advent of big data technologies has changed the way many companies manage their data. Several companies moved their data to the cloud using the concept of database‐as‐a‐service (DBaaS). Moving databases to the cloud presents several challenges related to flexible and scalable management of data. Although some of these companies migrated to NoSQL databases, most still rely on relational databases in the cloud to manage data, especially data that is critical to the decision making process. Online analytical processing (OLAP) queries take a long time to be processed, thus demanding high‐performance capabilities from their associated database systems to get results in a feasible time. In this article, we propose a middleware solution that can be deployed in any cloud provider, named C‐ParGRES, which explores database replication and interquery and intraquery parallelism to efficiently support OLAP queries in the cloud. C‐ParGRES is an extension of ParGRES, an open‐source database cluster middleware for high‐performance OLAP query processing in clusters. C‐ParGRES exploits cloud capabilities such as on‐demand resource provisioning and elasticity. In addition, C‐ParGRES can create multiple and independent virtual clusters for different database and users. We evaluate C‐ParGRES with two real‐world OLAP applications, both from the Brazilian Institute of Geography and Statistics. Results show that C‐ParGRES is a cost‐effective solution for OLAP query processing in the cloud. Marcello W. M. Ribeiro, Alexandre A. B. Lima, Daniel de Oliveira 0001 |
Concurr. Comput. Pract. Exp. | 2 |
| 2011 | Many task computing for orthologous genes identification in protozoan genomes using HydraabstractSUMMARY One of the main advantages of using a scientific workflow management system (SWfMS) is to orchestrate data flows among scientific activities and register provenance of the whole workflow execution. Nevertheless, the execution control of distributed activities in high performance computing environments by SWfMS presents challenges such as steering control and provenance gathering. Such challenges may become a complex task to be accomplished in bioinformatics experiments, particularly in Many Task Computing scenarios. This paper presents a data parallelism solution for a bioinformatics experiment supported by Hydra, a middleware that bridges SWfMS and high performance computing to enable workflow parallelization with provenance gathering. Hydra Many Task Computing parallelization strategies can be registered and reused. Using Hydra, provenance may also be uniformly gathered. We have evaluated Hydra using an Orthologous Gene Identification workflow. Experimental results show that a systematic approach for distributing parallel activities is viable, sparing scientist time and diminishing operational errors, with the additional benefits of distributed provenance support. Copyright © 2011 John Wiley & Sons, Ltd. Fábio Coutinho, Eduardo S. Ogasawara, Daniel de Oliveira 0001, Vanessa Braganholo, Alexandre A. B. Lima, Alberto M. R. Dávila, Marta Mattoso |
Concurr. Comput. Pract. Exp. | 5 |
| 2010 | Data parallelism in bioinformatics workflows using HydraabstractLarge scale bioinformatics experiments are usually composed by a set of data flows generated by a chain of activities (programs or services) that may be modeled as scientific workflows. Current Scientific Workflow Management Systems (SWfMS) are used to orchestrate these workflows to control and monitor the whole execution. It is very common in bioinformatics experiments to process very large datasets. In this way, data parallelism is a common approach used to increase performance and reduce overall execution time. However, most of current SWfMS still lack on supporting parallel executions in high performance computing (HPC) environments. Additionally keeping track of provenance data in distributed environments is still an open, yet important problem. Recently, Hydra middleware was proposed to bridge the gap between the SWfMS and the HPC environment, by providing a transparent way for scientists to parallelize workflow executions while capturing distributed provenance. This paper analyzes data parallelism scenarios in bioinformatics domain and presents an extension to Hydra middleware through a specific cartridge that promotes data parallelism in bioinformatics workflows. Experimental results using workflows with BLAST show performance gains with the additional benefits of distributed provenance support. Fábio Coutinho, Eduardo S. Ogasawara, Daniel de Oliveira 0001, Vanessa Braganholo, Alexandre A. B. Lima, Alberto M. R. Dávila, Marta Mattoso |
HPDC | 5 |
| 2009 | Parallel OLAP query processing in database clusters with data replication
Alexandre A. B. Lima, Camille Furtado, Patrick Valduriez, Marta Mattoso |
Distributed Parallel Databases | 1 |
| 2008 | Parallel query processing for OLAP in gridsabstractAbstract OLAP query processing is critical for enterprise grids. Capitalizing on our experience with the ParGRES database cluster, we propose a middleware solution, GParGRES, which exploits database replication and inter‐ and intra‐query parallelism to efficiently support OLAP queries in a grid. GParGRES is designed as a wrapper that enables the use of ParGRES in PC clusters of a grid (in our case, Grid5000). Our approach has two levels of query splitting: grid‐level splitting, implemented by GParGRES, and node‐level splitting, implemented by ParGRES. GParGRES has been partially implemented as database grid services compatible with existing grid solutions such as the open grid service architecture and the Web services resource framework. We give preliminary experimental results obtained with two clusters of Grid5000 using queries of the TPC‐H Benchmark. The results show linear or almost linear speedup in query execution, as more nodes are added in all tested configurations. Copyright © 2008 John Wiley & Sons, Ltd. Nelson Kotowski, Alexandre A. B. Lima, Esther Pacitti, Patrick Valduriez, Marta Mattoso |
Concurr. Comput. Pract. Exp. | 2 |
| 2005 | Physical and Virtual Partitioning in OLAP Database ClustersabstractOn-line analytical processing (OLAP) applications require high performance database support to achieve good response time (crucial for decision making). Database clusters provide a cost-effective alternative to parallel database systems. For OLAP applications, that typically use heavy weight queries, intra-query parallelism yields better performance as it reduces the execution time of individual queries. Intra-query parallelism is based on processing the same query on different subsets of the query table. Combining physical and virtual partitioning to define table subsets provides flexibility in intra-query parallelism while optimizing disk space usage and data availability. Experiments with our partitioning technique using TPC-H benchmark queries on a 32-dual node cluster gave linear and super-linear speedup, thereby reducing significantly the time of typical OLAP heavy weight queries. Camille Furtado, Alexandre A. B. Lima, Esther Pacitti, Patrick Valduriez, Marta Mattoso |
SBAC-PAD | 2 |
| 2004 | OLAP Query Processing in a Database Cluster
Alexandre A. B. Lima, Marta Mattoso, Patrick Valduriez |
Euro-Par | 1 |