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 条
  • [21] Top-k coupled keyword recommendation for relational keyword queries
    Meng, Xiangfu
    Cao, Longbing
    Zhang, Xiaoyan
    Shao, Jingyu
    [J]. KNOWLEDGE AND INFORMATION SYSTEMS, 2017, 50 (03) : 883 - 916
  • [22] Efficient Match-Based Candidate Network Generation for Keyword Queries Over Relational Databases
    de Oliveira, Pericles Silva
    da Silva, Altigran
    de Moura, Edleno
    de Freitas, Rosiane
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (04) : 1735 - 1750
  • [23] Evaluating Top-k queries over web-accessible Databases
    Bruno, N
    Gravano, L
    Marian, A
    [J]. 18TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2002, : 369 - +
  • [24] Distributed probabilistic top-k dominating queries over uncertain databases
    Niranjan Rai
    Xiang Lian
    [J]. Knowledge and Information Systems, 2023, 65 : 4939 - 4965
  • [25] Top-k Differential Queries in Graph Databases
    Vasilyeva, Elena
    Thiele, Maik
    Bornhoevd, Christof
    Lehner, Wolfgang
    [J]. ADVANCES IN DATABASES AND INFORMATION SYSTEMS (ADBIS 2014), 2014, 8716 : 112 - 125
  • [26] Evaluating top-k queries over web-accessible databases
    Marian, A
    Bruno, N
    Gravano, L
    [J]. ACM TRANSACTIONS ON DATABASE SYSTEMS, 2004, 29 (02): : 319 - 362
  • [27] Distributed probabilistic top-k dominating queries over uncertain databases
    Rai, Niranjan
    Lian, Xiang
    [J]. KNOWLEDGE AND INFORMATION SYSTEMS, 2023, 65 (11) : 4939 - 4965
  • [28] Efficient Reverse Top-k Boolean Spatial Keyword Queries on Road Networks
    Gao, Yunjun
    Qin, Xu
    Zheng, Baihua
    Chen, Gang
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (05) : 1205 - 1218
  • [29] Efficient Approach to Top-k Dominating Queries on Service Selection
    Zhang, Jinfang
    Zhong, Farong
    Yang, Zhenguo
    [J]. 2013 6TH JOINT IFIP WIRELESS AND MOBILE NETWORKING CONFERENCE (WMNC 2013), 2013,
  • [30] Authentication of Moving Top-k Spatial Keyword Queries
    Wu, Dingming
    Choi, Byron
    Xu, Jianliang
    Jensen, Christian S.
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (04) : 922 - 935