Grettel Monteagudo García

Grettel Monteagudo García

Auto-generated profile, based on publicly available information

Grettel Monteagudo García

Instituto Tecgraf, PUC-Rio

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 January 2025 in SN Computer Science
Verified
Journal Article
Closed access
PDF file
ENEduardo R. Nascimento
Eduardo R. Nascimento
GGGrettel García
Grettel García
YIYenier T. Izquierdo
Yenier T. Izquierdo
LFLucas Feijó
Lucas Feijó
GCGustavo M. C. Coelho
Gustavo M. C. Coelho
MCMarco A. Casanova
Marco A. Casanova

18 August 2024
Verified
Book Chapter
Closed access
PDF file
GCGustavo M. C. Coelho
Gustavo M. C. Coelho
ENEduardo R. S. Nascimento
Eduardo R. S. Nascimento
YIYenier T. Izquierdo
Yenier T. Izquierdo
GGGrettel M. García
Grettel M. García
LFLucas Feijó
Lucas Feijó
MCMarco A. Casanova
Marco A. Casanova

20 July 2020 in International Journal of Geographical Information Science
Verified
Journal Article
Open access
YIYenier Torres Izquierdo
Yenier Torres Izquierdo
GGGrettel Monteagudo García
Grettel Monteagudo García
MCMarco A. Casanova
Marco A. Casanova
LLLuiz André P. Paes Leme
Luiz André P. Paes Leme
CSChristos Sardianos
Christos Sardianos
LRLívia C. Ruback Rodrigues
Lívia C. Ruback Rodrigues
Stop-and-move semantic trajectories are segmented trajectories where the stops and moves are semantically enriched with additional data. A query language for semantic trajectory datasets has to include selectors for stops or moves based on their enrichments and sequence expressions that define how to match the results of selectors with the sequence the semantic trajectory defines. This article addresses the problem of searching semantic trajectories, using stop-and-move sequence expressions. The article first proposes a formal framework to define semantic trajectories and introduces stop-and-move sequence expressions, with well-defined syntax and semantics, which act as an expressive query language for semantic trajectories. Then, it describes a concrete semantic trajectory model in RDF, defines SPARQL stop-and-move sequence expressions and discusses strategies to compile such expressions into SPARQL queries. Lastly, the article specifies user-friendly keyword search expressions over semantic trajectories based on the use of keywords to specify stop-and-move queries, and the adoption of terms with predefined semantics to compose sequence expressions. It then shows how to compile such keyword search expressions into SPARQL queries. Finally, it provides a proof-of-concept experiment over a semantic trajectory dataset constructed with user-generated content from Flickr, combined with Wikipedia data.

21 October 2024
Verified
Book Chapter
Closed access
PDF file
AOAiko Oliveira
Aiko Oliveira
ENEduardo Nascimento
Eduardo Nascimento
JPJoão Pinheiro
João Pinheiro
CACaio Viktor S. Avila
Caio Viktor S. Avila
GCGustavo Coelho
Gustavo Coelho
MCMarco A. Casanova
Marco A. Casanova

23 January 2025 in arXiv
Verified
Preprint
Open access
PDF file
ENEduardo R. Nascimento
Eduardo R. Nascimento
CACaio Viktor S. Avila
Caio Viktor S. Avila
YIYenier T. Izquierdo
Yenier T. Izquierdo
GGGrettel M. García
Grettel M. García
LALucas Feijó L. Andrade
Lucas Feijó L. Andrade
MCMarco A. Casanova
Marco A. Casanova
Text-to-SQL prompt strategies based on Large Language Models (LLMs) achieve remarkable performance on well-known benchmarks. However, when applied to real-world databases, their performance is significantly less than for these benchmarks, especially for Natural Language (NL) questions requiring complex filters and joins to be processed. This paper then proposes a strategy to compile NL questions into SQL queries that incorporates a dynamic few-shot examples strategy and leverages the services provided by a database keyword search (KwS) platform. The paper details how the precision and recall of the schema-linking process are improved with the help of the examples provided and the keyword-matching service that the KwS platform offers. Then, it shows how the KwS platform can be used to synthesize a view that captures the joins required to process an input NL question and thereby simplify the SQL query compilation step. The paper includes experiments with a real-world relational database to assess the performance of the proposed strategy. The experiments suggest that the strategy achieves an accuracy on the real-world relational database that surpasses state-of-the-art approaches. The paper concludes by discussing the results obtained.