Efficient Radial Pattern Keyword Search on Knowledge Graphs in Parallel
Yueji Yang, Anthony K. H. Tung

TL;DR
This paper introduces RAKS, a parallel keyword search engine for knowledge graphs that allows user-specified focus on central and marginal keywords, improving search relevance and efficiency.
Contribution
It proposes a novel parallel search method with weighting schemes that enhance retrieval of semantically relevant subgraphs based on user focus.
Findings
RAKS outperforms existing methods in efficiency on large KGs.
It effectively retrieves semantically relevant subgraphs with user-specified keyword focus.
Experimental results demonstrate improved speed and relevance in search results.
Abstract
Recently, keyword search on Knowledge Graphs (KGs) becomes popular. Typical keyword search approaches aim at finding a concise subgraph from a KG, which can reflect a close relationship among all input keywords. The connection paths between keywords are selected in a way that leads to a result subgraph with a better semantic score. However, such a result may not meet user information need because it relies on the scoring function to decide what keywords to link closer. Therefore, such a result may miss close connections among some keywords on which users intend to focus. In this paper, we propose a parallel keyword search engine, called RAKS. It allows users to specify a query as two sets of keywords, namely central keywords and marginal keywords. Specifically, central keywords are those keywords on which users focus more. Their relationships are desired in the results. Marginal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Advanced Database Systems and Queries · Algorithms and Data Compression
