Ariel Afonso
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ariel Afonso has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Altigran Soares da Silva
Universidade Federal do Amazonas (UFAM)
1 shared publication - Edleno Silva de Moura
Federal University of Amazonas
1 shared publication - João Henrique F. Cavalcanti
Instituto de Educação, Agricultura e Ambiente Universidade Federal do Amazonas Humaitá Amazonas Brazil
1 shared publication - Paulo Rodrigo Oliveira Martins
Institute of Computing, Universidade Federal do Amazonas, Manaus, Brazil
1 shared publication
Latest Publications
- Open Access
- 25 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 92365-92390
Supporting Schema References in Keyword Queries Over Relational Databases
Relational Keyword Search (R-KwS) systems enable naive/informal users to explore and retrieve information from relational databases without knowing schema details or query languages. They take a keyword query, locate their corresponding elements in the target database, and connect them using information on PK/FK constraints. Although there are many such systems in the literature, most of them only support queries with keywords referring to the contents of the database and just very few support queries with keywords refering the database schema. We propose Lathe, a novel R-KwS that supports such queries. To this end, we first generalize the well-known concepts of Candidate Joining Networks (CJNs) and Query Matches (QMs) to handle keywords referring to schema elements and propose new algorithms to generate them. Then, we introduce two major innovations: a ranking algorithm for selecting better QMs, yielding the generation of fewer but better CJNs, and an eager evaluation strategy for pruning void useless CJNs. We present experiments performed with query sets and datasets previously experimented with state-of-the-art R-KwS systems. Our results indicate that Lathe can handle a wider variety of queries while remaining highly effective, even for databases with intricate schemas.
- 25 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 92365-92390
Open AccessSupporting Schema References in Keyword Queries Over Relational Databases
Relational Keyword Search (R-KwS) systems enable naive/informal users to explore and retrieve information from relational databases without knowing schema details or query languages. They take a keyword query, locate their corresponding elements in the target database, and connect them using information on PK/FK constraints. Although there are many such systems in the literature, most of them only support queries with keywords referring to the contents of the database and just very few support queries with keywords refering the database schema. We propose Lathe, a novel R-KwS that supports such queries. To this end, we first generalize the well-known concepts of Candidate Joining Networks (CJNs) and Query Matches (QMs) to handle keywords referring to schema elements and propose new algorithms to generate them. Then, we introduce two major innovations: a ranking algorithm for selecting better QMs, yielding the generation of fewer but better CJNs, and an eager evaluation strategy for pruning void useless CJNs. We present experiments performed with query sets and datasets previously experimented with state-of-the-art R-KwS systems. Our results indicate that Lathe can handle a wider variety of queries while remaining highly effective, even for databases with intricate schemas.