Abstract
Todays’ data over web are retrieved from Relational Database Management Systems (RDBMS). Web retrieval and content analysis by keyword search in relational database has become the preferential way to search in todays’ era of Big Data. Any keyword search system has two main parts including candidate network generation and evaluation. Most research’s attention is on providing an efficient candidate network evaluation algorithm and relies on non-efficient candidate network generation paradigm. In this work, a novel probabilistic candidate network generation algorithm is proposed. From the outcome of our investigation on benchmark databases including new ISC database, it is possible to conclude that the proposed candidate network generation approach enhances the efficiency of databases keyword search.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.