{"links":{},"id":20751,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00020751","sets":["1164:1165:1274:1280"]},"path":["1280"],"owner":"1","recid":"20751","title":["集約関数まで拡張した関係論理／関係代数変換法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1987-01-19"},"_buckets":{"deposit":"3677405e-666d-4c38-ad19-e92622b90fca"},"_deposit":{"id":"20751","pid":{"type":"depid","value":"20751","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"集約関数まで拡張した関係論理／関係代数変換法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"集約関数まで拡張した関係論理／関係代数変換法"},{"subitem_title":"Reduction of Aggregate Functions in Relational Calculus to Optimal Algebraic Expressions","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1987-01-19","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTT電気通信研究所"},{"subitem_text_value":"NTT電気通信研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Electrical Communications Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Electrical Communications Laboratories","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/20751/files/IPSJ-DBS86057003.pdf"},"date":[{"dateType":"Available","dateValue":"1989-01-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DBS86057003.pdf","filesize":[{"value":"837.0 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"13"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"f30cdc34-c808-4fa4-9992-7bb59d983591","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1987 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"中野, 良平"},{"creatorName":"斉藤, 和巳"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ryohei, Nakano","creatorNameLang":"en"},{"creatorName":"Kazumi, Saito","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10112482","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"集約関数(aggregate function)が入って来ると、一般にアルファが閉じなくなるので、関係論理から関係代数への変換は簡単でなくなる。本稿は関係論理中の集約関数を最適な関係代数表現に変換する体系を述べたものである。また、集約関数に関するKlugの補正に効率良く対処するため、新らたな集約演算を考案し導入する。新変換法は、代数表現への変換が容易な標準集約形を中継地点とし、それの生成と解決という2フェーズの変換体系を採る。同変換体系は4つの基本変換則と3種の発見的(heuristic)変換則から構成される。新変換法の目的は、集約関数を含んだ関係論理表現を人間が考え出すような最適な関係代数表現に変換することにある。変換プログラムを作成し、考えられる様々な複雑な検索に適用して、極めて満足すべき結果が得られることを確認した。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The advent or aggregate functions makes alphas of relational calculus open; hence reduction from alphas to relational algebraic expressions becomes difficult. This paper describes reduction of aggregate functions in relational calculus to optimal algebraic expressions. We introduce a new aggregate operation to cope with Klug's correction. The present algorithm runs two-phase processing: creation of standard aggregate form and resolution of it. The reduction consists of 4 basic rules and 3 kinds of heuristic rules. Its goal is to produce such optimal algebraic expressions as a man may think of. Reduction program turns out to produce satisfactory results.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"26","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告データベースシステム（DBS）"}],"bibliographicPageStart":"19","bibliographicIssueDates":{"bibliographicIssueDate":"1987-01-19","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4(1986-DBS-057)","bibliographicVolumeNumber":"1987"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:52:52.457943+00:00","updated":"2025-01-22T21:37:55.364450+00:00"}