{"id":{"repo_id":"bu","oai_identifier":"oai:open.bu.edu:2144/38016"},"canonical_url":"https://search.ndltd.org/etd/bu/oai:open.bu.edu:2144/38016","repository":{"repo_id":"bu","name":"Boston University","base_url":"https://open.bu.edu/oai/request"},"display":{"title":"A universal relation data model with semantic constructs","abstract":"This thesis describes a modularized universal relation data model, called URMSC (Universal Relation Data Model with Semantic Constructs). This model incorporates concepts from the semantic data model, such as the notions of entities, aggregation abstractions and generalization/specialization abstractions, into the universal relation data model. These semantic constructs allow us to reduce multiple paths among relation and allow us to loosen some of the constraints that the URM imposes. Consequently, a larger class of queries can be interpreted unambiguously. Modules are defined by aggregation hierarchies. Each module must satisfy the local unique name and attr£bute correlat£on assumptions. The former requires the uniqueness of attribute names on each individual module instead of the entire database scheme, to reduce the number of attribute renamings. The latter is used to disambiguate a query interpretation when there are duplicate attribute names in a database. In a universal relation system, data retrieval queries are expressed by mentioning only the attribute names of interest and their values. We extend this idea to the notion of database update. By taking advantage of the semantic constructs of the model, we provide criteria that guarantee unambiguous interpretation of update requests.","abstract_html":"This thesis describes a modularized universal relation data model, called URMSC (Universal Relation Data Model with Semantic Constructs). This model incorporates concepts from the semantic data model, such as the notions of entities, aggregation abstractions and generalization/specialization abstractions, into the universal relation data model. These semantic constructs allow us to reduce multiple paths among relation and allow us to loosen some of the constraints that the URM imposes. Consequently, a larger class of queries can be interpreted unambiguously. Modules are defined by aggregation hierarchies. Each module must satisfy the local unique name and attr£bute correlat£on assumptions. The former requires the uniqueness of attribute names on each individual module instead of the entire database scheme, to reduce the number of attribute renamings. The latter is used to disambiguate a query interpretation when there are duplicate attribute names in a database. In a universal relation system, data retrieval queries are expressed by mentioning only the attribute names of interest and their values. We extend this idea to the notion of database update. By taking advantage of the semantic constructs of the model, we provide criteria that guarantee unambiguous interpretation of update requests.","abstract_has_math":false,"creators":["Chang, Tzy-hey H."],"institution":"Boston University","degree_name":"Doctor of Philosophy","degree_level":"doctoral","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1988,"date_issued":"1988","date_published":"1988","updated_at":"2026-11-19T02:41:25Z","subjects":["Universal relation data model","Databases","Computer science"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.barcode","label":"Dc Identifier Barcode","values":["11719014225397"],"render_values":[{"text":"11719014225397","href":null,"code":true}]},{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["99187742610001161"],"render_values":[{"text":"99187742610001161","href":null,"code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["b1610660x"],"render_values":[{"text":"b1610660x","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2144/38016","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/2144/38016","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":"embargoed","embargo_until":"2999-01-01","access_note":"Embargoed until 2999-01-01"},"source_record":{"url":"https://open.bu.edu/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopen.bu.edu%3A2144%2F38016","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Chang, Tzy-hey H."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-09-26T14:38:24Z"]},{"key":"dc:date.embargo","label":"Dc Date Embargo","values":["2999-01-01"]},{"key":"dc:date.issued","label":"Date","values":["1988"]},{"key":"dc:date.submitted","label":"Dc Date Submitted","values":["1988"]},{"key":"dc:publisher","label":"Institution","values":["Boston University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis/Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Boston University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Universal relation data model","Databases","Computer science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.barcode","label":"Dc Identifier Barcode","values":["11719014225397"]},{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["99187742610001161"]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["b1610660x"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/2144/38016"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph.D.)--Boston University","PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you."]},{"key":"dc:description.abstract","label":"Abstract","values":["This thesis describes a modularized universal relation data model, called URMSC (Universal Relation Data Model with Semantic Constructs). This model incorporates concepts from the semantic data model, such as the notions of entities, aggregation abstractions and generalization/specialization abstractions, into the universal relation data model. These semantic constructs allow us to reduce multiple paths among relation and allow us to loosen some of the constraints that the URM imposes. Consequently, a larger class of queries can be interpreted unambiguously. Modules are defined by aggregation hierarchies. Each module must satisfy the local unique name and attr£bute correlat£on assumptions. The former requires the uniqueness of attribute names on each individual module instead of the entire database scheme, to reduce the number of attribute renamings. The latter is used to disambiguate a query interpretation when there are duplicate attribute names in a database. In a universal relation system, data retrieval queries are expressed by mentioning only the attribute names of interest and their values. We extend this idea to the notion of database update. By taking advantage of the semantic constructs of the model, we provide criteria that guarantee unambiguous interpretation of update requests."]},{"key":"dc:title","label":"Title","values":["A universal relation data model with semantic constructs"]}]}],"canonical_facts":{"dc:creator":["Chang, Tzy-hey H."],"dc:date.accessioned":["2019-09-26T14:38:24Z"],"dc:date.embargo":["2999-01-01"],"dc:date.issued":["1988"],"dc:date.submitted":["1988"],"dc:description":["Thesis (Ph.D.)--Boston University","PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you."],"dc:description.abstract":["This thesis describes a modularized universal relation data model, called URMSC (Universal Relation Data Model with Semantic Constructs). This model incorporates concepts from the semantic data model, such as the notions of entities, aggregation abstractions and generalization/specialization abstractions, into the universal relation data model. These semantic constructs allow us to reduce multiple paths among relation and allow us to loosen some of the constraints that the URM imposes. Consequently, a larger class of queries can be interpreted unambiguously. Modules are defined by aggregation hierarchies. Each module must satisfy the local unique name and attr£bute correlat£on assumptions. The former requires the uniqueness of attribute names on each individual module instead of the entire database scheme, to reduce the number of attribute renamings. The latter is used to disambiguate a query interpretation when there are duplicate attribute names in a database. In a universal relation system, data retrieval queries are expressed by mentioning only the attribute names of interest and their values. We extend this idea to the notion of database update. By taking advantage of the semantic constructs of the model, we provide criteria that guarantee unambiguous interpretation of update requests."],"dc:identifier.barcode":["11719014225397"],"dc:identifier.bibid":["99187742610001161"],"dc:identifier.other":["b1610660x"],"dc:identifier.uri":["https://hdl.handle.net/2144/38016"],"dc:language.iso":["en_US"],"dc:publisher":["Boston University"],"dc:subject":["Universal relation data model","Databases","Computer science"],"dc:title":["A universal relation data model with semantic constructs"],"dc:type":["Thesis/Dissertation"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["doctoral"],"thesis:degree_name":["Doctor of Philosophy"],"thesis:institution_name":["Boston University"]},"updated_at":"2026-11-19T02:41:25Z"}