CLASCN:: Candidate network selection for efficient top-k keyword queries over databases

被引:6
|
作者
Zhang, Jun [1 ]
Peng, Zhao-Hui
Wang, Shan
Nie, Hui-Jing
机构
[1] Renmin Univ China, Sch Informat, Beijing 100872, Peoples R China
[2] Minist Educ, Key Lab Data Engn & Knowledge Engn, Beijing 100872, Peoples R China
[3] Dalian Maritime Univ, Comp Sci & Technol Coll, Dalian 116026, Peoples R China
来源
关键词
relational database; keyword search; top-k query; candidate network;
D O I
10.1007/s11390-007-9026-6
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:197 / 207
页数:11
相关论文
共 50 条
  • [1] CLASCN: Candidate Network Selection for Efficient Top-k Keyword Queries over Databases
    Jun Zhang
    Zhao-Hui Peng
    Shan Wang
    Hui-Jing Nie
    [J]. Journal of Computer Science and Technology, 2007, 22 : 197 - 207
  • [2] Answering Top-k Keyword Queries on Relational Databases
    Thein, Myint Myint
    Thwin, Mie Mie Su
    [J]. INTERNATIONAL JOURNAL OF INFORMATION RETRIEVAL RESEARCH, 2012, 2 (03) : 36 - 57
  • [3] Efficient Top-k Keyword Search Over Multidimensional Databases
    Yu, Ziqiang
    Yu, Xiaohui
    Liu, Yang
    [J]. INTERNATIONAL JOURNAL OF DATA WAREHOUSING AND MINING, 2013, 9 (03) : 1 - 21
  • [4] Efficient processing of top-k queries in uncertain databases
    Yi, Ke
    Li, Feifei
    Kollios, George
    Srivastava, Divesh
    [J]. 2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2008, : 1406 - +
  • [5] Efficient processing of top-k frequent spatial keyword queries
    Xu, Tao
    Xu, Aopeng
    Mango, Joseph
    Liu, Pengfei
    Ma, Xiaqing
    Zhang, Lei
    [J]. SCIENTIFIC REPORTS, 2022, 12 (01)
  • [6] Efficient processing of top-k frequent spatial keyword queries
    Tao Xu
    Aopeng Xu
    Joseph Mango
    Pengfei Liu
    Xiaqing Ma
    Lei Zhang
    [J]. Scientific Reports, 12
  • [7] Efficient Continuous Top-k Keyword Search in Relational Databases
    Xu, Yanwei
    Ishikawa, Yoshiharu
    Guan, Jihong
    [J]. WEB-AGE INFORMATION MANAGEMENT, PROCEEDINGS, 2010, 6184 : 755 - +
  • [8] Top-k selection queries over relational databases:: Mapping strategies and performance evaluation
    Bruno, N
    Chaudhuri, S
    Gravano, L
    [J]. ACM TRANSACTIONS ON DATABASE SYSTEMS, 2002, 27 (02): : 153 - 187
  • [9] Evaluating Top-k Skyline queries over relational databases
    Brando, Carmen
    Goncalves, Marlene
    Gonzalez, Vanessa
    [J]. DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2007, 4653 : 254 - +
  • [10] Top-K data source selection for keyword queries over multiple XML data sources
    Khanh Nguyen
    Cao, Jinli
    [J]. JOURNAL OF INFORMATION SCIENCE, 2012, 38 (02) : 156 - 175