Efficient Path Query Processing in Relational Database Systems
A full list of my papers, in reverse chronological order. See also my Google Scholar profile.
Efficient Path Query Processing in Relational Database Systems
Informed Search for Regular Path Query Reachability
Studies heuristic-guided (greedy best-first / A*) search for evaluating Regular Path Query reachability over the product graph, finding that the search regime dominates heuristic choice and that DFS remains hard to beat for Boolean reachability.