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 条
  • [31] Evaluating top-k selection queries
    Chaudhuri, S
    Gravano, L
    [J]. PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, 1999, : 399 - 410
  • [32] Optimizing top-k selection queries over multimedia repositories
    Chaudhuri, S
    Gravano, L
    Marian, A
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2004, 16 (08) : 992 - 1009
  • [33] A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases
    Ayanso, Anteneh
    Goes, Paulo B.
    Mehta, Kumar
    [J]. JOURNAL OF DATABASE MANAGEMENT, 2009, 20 (04) : 1 - 25
  • [34] Distributed Top-k Keyword Search over Very Large Databases with MapReduce
    Yu, Ziqiang
    Yu, Xiaohui
    Chen, Yuehui
    Ma, Kun
    [J]. 2016 IEEE INTERNATIONAL CONGRESS ON BIG DATA - BIGDATA CONGRESS 2016, 2016, : 349 - 352
  • [35] Scalable top-k keyword search in relational databases
    Yanwei Xu
    [J]. Cluster Computing, 2019, 22 : 731 - 747
  • [36] Supporting Top-K Keyword Search in XML Databases
    Chen, Liang Jeff
    Papakonstantinou, Yannis
    [J]. 26TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING ICDE 2010, 2010, : 689 - 700
  • [37] Scalable top-k keyword search in relational databases
    Xu, Yanwei
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 1): : 731 - 747
  • [38] Top-k typicality queries and efficient query answering methods on large databases
    Ming Hua
    Jian Pei
    Ada W. C. Fu
    Xuemin Lin
    Ho-Fung Leung
    [J]. The VLDB Journal, 2009, 18 : 809 - 835
  • [39] Top-k typicality queries and efficient query answering methods on large databases
    Hua, Ming
    Pei, Jian
    Fu, Ada W. C.
    Lin, Xuemin
    Leung, Ho-Fung
    [J]. VLDB JOURNAL, 2009, 18 (03): : 809 - 835
  • [40] Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations
    Yi, Ke
    Li, Feifei
    Kollios, George
    Srivastava, Divesh
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2008, 20 (12) : 1669 - 1682