全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

CLASCN: Candidate Network Selection for Efficient Top-k Keyword Queries over Databases

Keywords: relational database,keyword search,top-k query,candidate network
数据库
,关键字查找,关系数据库,计算机网络

Full-Text   Cite this paper   Add to My Lib

Abstract:

Keyword Search Over Relational Databases (KSORD) enables casual or Web users easily access databases through free-form keyword queries. Improving the performance of KSORD systems is a critical issue in this area. In this paper, a new approach CLASCN (Classification, Learning And Selection of Candidate Network) is developed to efficiently perform top-k keyword queries in schema-graph-based online KSORD systems. In this approach, the Candidate Networks (CNs) from trained keyword queries or executed user queries are classified and stored in the databases, and top-k results from the CNs are learned for constructing CN Language Models (CNLMs). The CNLMs are used to compute the similarity scores between a new user query and the CNs from the query. The CNs with relatively large similarity score, which are the most promising ones to produce top-k results, will be selected and performed. Currently, CLASCN is only applicable for past queries and New All-keyword-Used (NAU) queries which are frequently submitted queries. Extensive experiments also show the efficiency and effectiveness of our CLASCN approach. Electronic supplementary material Electronic supplementary material is available for this article at and accessible for authorised users. This work is supported by the National Natural Science Foundation of China under Grant Nos. 60473069 and 60496325.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133