Decomposable Programs Revised

• Item type: Journal(1)
• 公開日: 1997-01-15
• タイトル: Decomposable Programs Revised
• タイトル / 言語: en
• タイトル: Decomposable Programs Revised
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 論文
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• その他タイトル / その他のタイトル: データベース
• 著者所属: Department of Intelligence and Computer Science Nagoya Institute of Technology
• 著者所属: Department of Intelligence and Computer Science Nagoya Institute of Technology
• 著者所属: Department of Intelligence and Computer Science Nagoya Institute of Technology
• 著者所属(英): en
• 著者所属(英): Department of Intelligence and Computer Science, Nagoya Institute of Technology
• 著者所属(英): en
• 著者所属(英): Department of Intelligence and Computer Science, Nagoya Institute of Technology
• 著者所属(英): en
• 著者所属(英): Department of Intelligence and Computer Science, Nagoya Institute of Technology
• 著者名: Xiaoyong, Du; Zhibin, Liu; Naohtro, Isilut
• 著者名(英): Xiaoyong, Du; Zhibin, Liu; Naohtro, Isilut
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Program decomposition is a program optimization technique for multiple linearly recursive programs in deductive databases. It decomposes an original program into a set of subprograms that have small arities and share no recursive predicates. 2D-decomposable programs generalize some previously proposed decomposable programs including one-sided recursions ;separable recursions ; right- left- and mixed-linear recursions ; and generalized separable recursions. This paper revises the concept of 2D-decomposability and proposes two larger program classes based on detailed analysis and classification of the arguments of the recursive predicate. We prove that the proposed program classes are decomposable to some extent.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Program decomposition is a program optimization technique for multiple linearly recursive programs in deductive databases. It decomposes an original program into a set of subprograms that have small arities and share no recursive predicates. 2D-decomposable programs generalize some previously proposed decomposable programs, including one-sided recursions ;separable recursions ; right-, left-, and mixed-linear recursions ; and generalized separable recursions. This paper revises the concept of 2D-decomposability, and proposes two larger program classes based on detailed analysis and classification of the arguments of the recursive predicate. We prove that the proposed program classes are decomposable to some extent.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 38, 号 1, p. 81-89, 発行日 1997-01-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764