DKWS: A Distributed System for Keyword Search on Massive Graphs (Extended Abstract)

Addressing the complexities of querying unstructured graphs such as knowledge graphs and social networks, this paper introduces D KWS, a novel distributed keyword search system. Leveraging a monotonic property, we ensure correct parallelization of our advanced keyword search algorithm, which incorporates tight pruning bounds and is divided into monotonic backward and forward search phases. The system is further augmented by the notify-push paradigm and the PINE programming model, facilitating asynchronous communication and preemptive searches to mitigate staleness in distributed environments. Extensive experiments on real-world datasets demonstrate DKWS's performance advantage, being up to two orders of magnitude faster and incurring 7.6 times lower communication costs than the existing systems.