This research article presents a novel method for efficient top-k keyword search in relational databases by introducing the Integrated Candidate Network (ICN). The approach addresses the challenge of navigating large structured datasets without requiring users to have query language expertise. By reducing redundant computations and pruning non-promising candidate networks, the method significantly improves query response times compared to existing techniques. Unlike many current solutions that focus on unstructured data or leverage large language models, this work specifically optimizes keyword search within structured relational databases. Extensive experiments on real-world datasets validate the effectiveness and scalability of the proposed approach, contributing valuable advancements to database search technologies.