{"created":"2025-01-18T23:22:21.343372+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00059618","sets":["5471:5474:5477"]},"path":["5477"],"owner":"1","recid":"59618","title":["On Query Transformation for Non-First-Normal-Form Relational Databases"],"pubdate":{"attribute_name":"公開日","attribute_value":"1992-11-30"},"_buckets":{"deposit":"1f1854a5-572b-4cf4-98ae-b1419c18a924"},"_deposit":{"id":"59618","pid":{"type":"depid","value":"59618","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"On Query Transformation for Non-First-Normal-Form Relational Databases","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"On Query Transformation for Non-First-Normal-Form Relational Databases"},{"subitem_title":"On Query Transformation for Non-First-Normal-Form Relational Databases","subitem_title_language":"en"}]},"item_type_id":"5","publish_date":"1992-11-30","item_5_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"C & C Systems Research Laboratories  NEC Corporation"}]},"item_5_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"C & C Systems Research Laboratories, NEC Corporation","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/59618/files/IPSJ-JIP1503006.pdf"},"date":[{"dateType":"Available","dateValue":"1994-11-30"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JIP1503006.pdf","filesize":[{"value":"1.0 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"c5cf66ec-d04e-4aae-a343-591b4d76f708","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1992 by the Information Processing Society of Japan"}]},"item_5_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kunitoshi, Tsuruoka"}],"nameIdentifiers":[{}]}]},"item_5_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kunitoshi, Tsuruoka","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_5_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA00700121","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_5_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-6652","subitem_source_identifier_type":"ISSN"}]},"item_5_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Simple extended tuple relational calculus is proposed for non-first-normal-form (NF2) relational databases  as a way of facilitating the understanding of query representation. In order to allow NF2 queries over first-normal-form (1NF) relational databases  a query transformation algorithm is a1so proposed. This transforms a query for a nested relation into one for an unnested relation. Additionally  the equivalence of transformed queries is proved in the sense that SELECT and UNNEST are commutable. The proposed extended tuple relational calculus and query transformation algorithm can serve as a basis for the safe implementation of NF2 relations over 1NF relations.","subitem_description_type":"Other"}]},"item_5_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Simple extended tuple relational calculus is proposed for non-first-normal-form (NF2) relational databases, as a way of facilitating the understanding of query representation. In order to allow NF2 queries over first-normal-form (1NF) relational databases, a query transformation algorithm is a1so proposed. This transforms a query for a nested relation into one for an unnested relation. Additionally, the equivalence of transformed queries is proved in the sense that SELECT and UNNEST are commutable. The proposed extended tuple relational calculus and query transformation algorithm can serve as a basis for the safe implementation of NF2 relations over 1NF relations.","subitem_description_type":"Other"}]},"item_5_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"393","bibliographic_titles":[{"bibliographic_title":"Journal of Information Processing "}],"bibliographicPageStart":"386","bibliographicIssueDates":{"bibliographicIssueDate":"1992-11-30","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"15"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":59618,"updated":"2025-01-22T03:29:52.851659+00:00","links":{}}