{"created":"2025-01-18T23:07:53.840961+00:00","updated":"2025-01-22T12:12:18.609498+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00040896","sets":["1164:3500:3596:3598"]},"path":["3598"],"owner":"1","recid":"40896","title":["関数型データモデルに基づく問い合わせ言語の並列処理方式"],"pubdate":{"attribute_name":"公開日","attribute_value":"1989-10-06"},"_buckets":{"deposit":"81012e79-1398-4a9c-b2e9-e03a514b6cab"},"_deposit":{"id":"40896","pid":{"type":"depid","value":"40896","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":"A PARALLEL PROCESSING SCHEME FOR A QUERY - LANGUAGE BASED ON THE FUNCTIONAL DATA MODEL","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1989-10-06","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"筑波大学電子・情報工学系"},{"subitem_text_value":"筑波大学電子・情報工学系"},{"subitem_text_value":"東京大学理学部情報科学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Institute of Information Sciences and Electronics, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Institute of Information Sciences and Electronics, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Science, Faculty of Science, University of Tokyo","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/40896/files/IPSJ-FI89015005.pdf"},"date":[{"dateType":"Available","dateValue":"1991-10-06"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-FI89015005.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"39"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"51d8dda5-faf0-44a1-beae-a44ed121232f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1989 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"朱振元"},{"creatorName":"清木康"},{"creatorName":"益田, 隆司"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Z., Zhu","creatorNameLang":"en"},{"creatorName":"Y., Kiyoki","creatorNameLang":"en"},{"creatorName":"T., Masuda","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10114171","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":"本稿では，関数型データモデルによって表現されるデータベースを対象とする問い合わせの並列処理方式について述べる．本処理方式では，一つの問い合わせは実体型名，フィルタ条件，組合せ型式という3要素により構成され，それらを対象とする基本操作を解釈・実行することによって問い合わせが処理される．問い合わせの処理時には，インタプリタは．基本操作をノードとし，データの流れをアークとする木構造を生成し，それぞれのノードを異なるプロセッサ上で実行させることによって並列に処理を行う．本稿では，2種類のデータ構造に対応する実現方式を考察し，その特徴を比較する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we propose a parallel processing scheme for a query-language based on the functional data model. In our schem, a query is represented as a three-dimensional tuple which is composed of three elements, the type-name of entity, the filter-condition and the combination-pattern. It is evaluated by executing several basic operations. When the query is evaluated, the interpreter produces a tree consisting of nodes and arcs. Those nodes and arcs correspond to basic operations and data flows, respectively. By allocating those basic operations to different processers, the query can be carried out in parallel. In this paper, we discuss two kinds of data structures and their implementing metheds, and then compare their characteristics.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告情報学基礎（FI）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"1989-10-06","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"85(1989-FI-015)","bibliographicVolumeNumber":"1989"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":40896,"links":{}}