Combining user and database perspective for solving keyword queries over relational databases
作者：
Highlights：
• A three step approach for solving keyword queries in structured databases is proposed.
• The forward step exploits heuristic rules and machine learning techniques.
• The backward step models the database with a Steiner Tree.
• A probabilistic framework based on the Dempster Shafer Theory combines the results.
• An extensive set of experiments offers a deep understanding of the whole process.
摘要
Highlights•A three step approach for solving keyword queries in structured databases is proposed.•The forward step exploits heuristic rules and machine learning techniques.•The backward step models the database with a Steiner Tree.•A probabilistic framework based on the Dempster Shafer Theory combines the results.•An extensive set of experiments offers a deep understanding of the whole process.
论文关键词：Keyword search over relational databases,Hidden Markov Models,Dempster–Shafer Theory,Machine learning
论文评审过程：Received 15 June 2014, Revised 18 July 2015, Accepted 21 July 2015, Available online 30 July 2015, Version of Record 15 August 2015.
论文官网地址：https://doi.org/10.1016/j.is.2015.07.005
