Effective Keyword Search in Weighted Graphs (Extended Abstract)

Mehdi Kargar,Jaroslaw Szlichta,Morteza Zihayat,Divesh Srivastava,Lukasz Golab

doi:10.1109/icde51399.2021.00261

Effective Keyword Search in Weighted Graphs (Extended Abstract)

Mehdi Kargar, Jaroslaw Szlichta + Show 3 more

https://doi.org/10.1109/icde51399.2021.00261

Copy DOI

Publication Date: Apr 1, 2021

Citations: 1

Affiliation: Toronto Metropolitan University, University of Ontario Institute of Technology, AT&T (United States), University of Waterloo

#Node Weights #Edge Weights + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

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.

Full Text