Papers › Semantic Guided and Response Times Bounded Top-k Similarity Search over Knowledge Graphs
Semantic Guided and Response Times Bounded Top-k Similarity Search over Knowledge Graphs
Yuxiang Wang, Arijit Khan, Tianxing Wu, Jiahui Jin, Haijiang Yan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Recently, graph query is widely adopted for querying knowledge graphs. Given a query graph G_Q, the graph query finds subgraphs in a knowledge graph G that exactly or approximately match G_Q. We face two challenges on graph query: (1) the structural gap between G_Q and the predefined schema in G causes mismatch with query graph, (2) users cannot view the answers until the graph query terminates, leading to a longer system response time (SRT). In this paper, we propose a semantic-guided and response-time-bounded graph query to return the top-k answers effectively and efficiently. We leverage a knowledge graph embedding model to build the semantic graph SG_Q, and we define the path semantic similarity (pss) over SG_Q as the metric to evaluate the answer's quality. Then, we propose an A* semantic search on SG_Q to find the top-k answers with the greatest pss via a heuristic pss estimation. Furthermore, we make an approximate optimization on A* semantic search to allow users to trade off the effectiveness for SRT within a user-specific time bound. Extensive experiments over real datasets confirm the effectiveness and efficiency of our solution.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections