2019/10/15 by Yuxiang Wang, Wang, Yuxiang, Arijit Khan +7 · 1 citation
Computer Science · #Advanced Graph Neural Networks #Advanced Image and Video Retrieval Techniques #Databases (cs.DB) #FOS: Computer and information sciences #Graph Theory and Algorithms
paper · pdf · doi:10.48550/arxiv.1910.06584
openalex publication_date 2019/10/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Recently, graph query is widely adopted for querying knowledge graphs. Given a query graph GQ, the graph query finds subgraphs in a knowledge graph G that exactly or approximately match GQ. We face two challenges on graph query: (1) the structural gap between GQ 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 SGQ, and we define the path semantic similarity (pss) over SGQ as the metric to evaluate the answer's quality. Then, we propose an A* semantic search on SGQ 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.