Generating Nested SQL Queries for Documentation

• Item type: Journal(1)
• 公開日: 1994-02-15
• タイトル: Generating Nested SQL Queries for Documentation
• タイトル / 言語: en
• タイトル: Generating Nested SQL Queries for Documentation
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 論文
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• その他タイトル / その他のタイトル: データベース
• 著者所属: Department of Mathematics Faculty of Science Kuwait University
• 著者所属: Integrated Media Environment Experimental Laboratory Faculty of Engineering Kyoto University
• 著者所属(英): en
• 著者所属(英): Department of Mathematics, Faculty of Science, Kuwait University
• 著者所属(英): en
• 著者所属(英): Integrated Media Environment Experimental Laboratory, Faculty of Engineering, Kyoto University
• 著者名: MohamedE..El-Sharkawi; Yahiko, Kambayashi
• 著者名(英): Mohamed, E..El-Sharkawi; Yahiko, Kambayashi
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: In this paper we develop procedures to transform a user's query into a nested form suitable for query documentation editing and reusability purposes. We discuss generating nested form of the three query types : chain tree and cyclic. For tree and cyclic queries there may be more than one nested form. Thus we have to determine the order of writing query blocks we use the notion of join strength. Joins are classified by their strength of relationship. Strong joins are selected to connect adjacent query blocks. For a tree query the first blocks is selccted by the output attribute the second one is selected as that of strongest join with the previous block and so on. Chain queries are handled as a special case of tree queries. A cyclic query cannot be written in the nested form. A form which is in part nested and in part unnested called seminested form is used. This form is generated by first finding a minimum spanning tree of the cyclic query graph. This tree contains most strong joins. We discuss also the case when the query output is obtained from multiple blocks. Since it is not possible to write such a query in the nested form the query is converted into a modified nested query in which the output is obtained from only one block.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: In this paper, we develop procedures to transform a user's query into a nested form suitable for query documentation, editing, and reusability purposes. We discuss generating nested form of the three query types : chain, tree, and cyclic. For tree and cyclic queries, there may be more than one nested form. Thus, we have to determine the order of writing query blocks, we use the notion of join strength. Joins are classified by their strength of relationship. Strong joins are selected to connect adjacent query blocks. For a tree query, the first blocks is selccted by the output attribute, the second one is selected as that of strongest join with the previous block and so on. Chain queries are handled as a special case of tree queries. A cyclic query cannot be written in the nested form. A form which is in part nested and in part unnested, called seminested form is used. This form is generated by first finding a minimum spanning tree of the cyclic query graph. This tree contains most strong joins. We discuss also the case when the query output is obtained from multiple blocks. Since it is not possible to write such a query in the nested form, the query is converted into a modified nested query in which the output is obtained from only one block.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 35, 号 2, p. 253-266, 発行日 1994-02-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764