Research
My research experiences have been mostly centered around Visualization, Databases, HCI, and Statistical
Methods. As of right now, my research is centered around graph databases. More specifically, I am
interested in understanding how non-trivial graph pattern queries are executed, and if current systems
implement solutions that involve producing huge intermediate results, whereas the final output size is much
smaller. I hope to keep working on them and be able to optimize for scalable solutions.
Graph query languages let users express recursive, pattern-based traversals over data, but evaluating
them efficiently is hard: systems often build huge intermediate results along the way, even when the
final answer is small. My current work (ReCAP) explores compiling these path queries into relational
engines in a way that filters non-matching paths early, before they blow up into large intermediate
state, and studies how traversal strategy itself (informed vs. uninformed search) affects the cost of
answering these queries.
See the Publications page for the papers coming out of this line of work.
As an undergraduate at UPRM, I worked with Dr. Alcibiades Bustillo on constructing 2D digital watermarks
by composing 1D periodic arrays, producing watermarks that were robust against common image-manipulation
attacks.
