A Novel Multi-hop Query Answering System Based on a Large Knowledge Graph and Distributed Computing

• Published in: ACM transactions on Asian and low-resource language information processing 2025-01
• Main Authors: Phan Hong, Trung, Do, Phuc
• Format: Article
• Language: English
• Subjects: Computing methodologies; Computing methodologies / Artificial intelligence; Computing methodologies / Artificial intelligence / Knowledge representation and reasoning; Information systems; Information systems / Data management systems; Information systems / Data management systems / Database management system engines; Information systems / Data management systems / Database management system engines / Database query processing; Information systems / Information retrieval; Information systems / Information retrieval / Document representation; Information systems / Information retrieval / Information retrieval query processing; Information systems / Information retrieval / Retrieval models and ranking; Information systems / Information retrieval / Retrieval tasks and goals; Information systems / Information retrieval / Retrieval tasks and goals / Question answering; Theory of computation; Theory of computation / Theory and algorithms for application domains; Theory of computation / Theory and algorithms for application domains / Database theory; Theory of computation / Theory and algorithms for application domains / Database theory / Database query processing and optimization (theory)
• ISSN: 2375-4699; 2375-4702
• DOI: 10.1145/3711824

An automated query answering system (QAS) is a very useful application in organizations. Therefore, there is a lot of research to build, develop and improve it. In this paper, we present a method to build a multi-hop query answering system (MQAS) based on a large knowledge graph (KG), Bidirectional Encoder Representations from Transformers (BERT), and the indexing structure K-Dimensional Tree (KD-Tree). The large KG provides knowledge for MQAS. BERT is used to transform questions into vectors. KD-Tree helps find the right answers quickly. On the other hand, we also propose a solution for distributed indexing of large vector spaces by building a distributed indexing structure called Distributed KD-Tree (DKD-Tree). In addition, we also present experiments and evaluation results to demonstrate the effectiveness of our solution.