Efficient Continual Top-<i>k</i> Keyword Search in Relational Databases

• Item type: Journal(1)
• 公開日: 2011-12-15
• タイトル: Efficient Continual Top-<i>k</i> Keyword Search in Relational Databases
• タイトル / 言語: en
• タイトル: Efficient Continual Top-<i>k</i> Keyword Search in Relational Databases
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 特集：情報爆発時代におけるIT基盤技術
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Department of Computer Science and Technology, Tongji University
• 著者所属: Information Technology Center, Nagoya University／Graduate School of Information Science, Nagoya University／National Institute of Informatics
• 著者所属: Department of Computer Science and Technology, Tongji University
• 著者所属(英): en
• 著者所属(英): Department of Computer Science and Technology, Tongji University
• 著者所属(英): en
• 著者所属(英): Information Technology Center, Nagoya University / Graduate School of Information Science, Nagoya University / National Institute of Informatics
• 著者所属(英): en
• 著者所属(英): Department of Computer Science and Technology, Tongji University
• 著者名: Yanwei, Xu; Yoshiharu, Ishikawa; Jihong, Guan
• 著者名(英): Yanwei, Xu; Yoshiharu, Ishikawa; Jihong, Guan
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Keyword search in relational databases has been widely studied in recent years because it requires users neither to master a certain structured query language nor to know the complex underlying database schemas. Most existing methods focus on answering snapshot keyword queries in static databases. In practice, however, databases are updated frequently, and users may have long-term interests on specific topics. To deal with such situations, it is necessary to build effective and efficient facilities in a database system to support continual keyword queries. In this paper, we propose an efficient method for answering continual keyword queries over relational databases. The proposed method consists of two core algorithms. The first one computes a set of potential top-k results by evaluating the range of the future relevance score for every query result and creates a light-weight state for each keyword query. The second one uses these states to maintain the top-k results of keyword queries while the database is continually being updated. Experimental results validate the effectiveness and efficiency of the proposed method.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.20(2012) No.1 (online); DOI http://dx.doi.org/10.2197/ipsjjip.20.114; ------------------------------
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Keyword search in relational databases has been widely studied in recent years because it requires users neither to master a certain structured query language nor to know the complex underlying database schemas. Most existing methods focus on answering snapshot keyword queries in static databases. In practice, however, databases are updated frequently, and users may have long-term interests on specific topics. To deal with such situations, it is necessary to build effective and efficient facilities in a database system to support continual keyword queries. In this paper, we propose an efficient method for answering continual keyword queries over relational databases. The proposed method consists of two core algorithms. The first one computes a set of potential top-k results by evaluating the range of the future relevance score for every query result and creates a light-weight state for each keyword query. The second one uses these states to maintain the top-k results of keyword queries while the database is continually being updated. Experimental results validate the effectiveness and efficiency of the proposed method.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.20(2012) No.1 (online); DOI http://dx.doi.org/10.2197/ipsjjip.20.114; ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 52, 号 12, 発行日 2011-12-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764