Effective Keyword Search in Weighted Graphs (Extended Abstract)
Mehdi Kargar, Lukasz Golab, Divesh Srivastava, Jaroslaw Szlichta, Morteza Zihayat · 2021
Real graphs contain edge and node weights, representing penalty, distance or cost. We study the problem of keyword search in weighted node-labeled graphs, in which a query consists of a set of keywords and an answer is a subgraph. We consider three ranking strategies for answer subgraphs: edge weights, node weights, and a bi-objective combination of both node and edge weights. We propose and experimentally evaluate algorithms that optimize these objectives with an approximation ratio of two.