$\mathsf {DKWS}$. First, we present a monotonic property with keyword search algorithms that guarantees correct parallelization. Second, we present a keyword search algorithm as monotonic backward and forward search phases. Moreover, we propose new tight bounds for pruning nodes being searched. Third, we propose a notify-push paradigm and

$\mathsf {PINE}$

programming model of

$\mathsf {DKWS}$

. The notify-push paradigm allows asynchronously exchanging the upper bounds of matches across the workers and the coordinator in

$\mathsf {DKWS}$

. The

$\mathsf {PINE}$

programming model naturally fits keyword search algorithms, as they have distinguished phases, to allow preemptive searches to mitigate staleness in a distributed system. Finally, we investigate the performance and effectiveness of

$\mathsf {DKWS}$

through experiments using real-world datasets. We find that

$\mathsf {DKWS}$

is up to two orders of magnitude faster than related techniques, and its communication costs are 7.6 times smaller than those of other techniques.">

DKWS: A Distributed System for Keyword Search on Massive Graphs (original) (raw)

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2026 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.