Return to search

Enhance DBMS capabilities using semantic data modelling approach.

by Yip Wai Man. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1990. / Bibliography: leaves 132-135. / ABSTRACT / ACKNOWLEDGEMENTS / PART I / Chapter 1 --- OVERVIEW ON SEMANTIC DATA MODELLING APPROACH … --- p.1 / Chapter 2 --- SCOPE OF RESEARCH --- p.4 / Chapter 3 --- CONCEPTUAL STRUCTURE OF SAM* --- p.7 / Chapter 3.1 --- Concepts and Associations --- p.7 / Chapter 3.1.1 --- Membership Association --- p.8 / Chapter 3.1.2 --- Aggregation Association --- p.8 / Chapter 3.1.3 --- Generalization Association --- p.9 / Chapter 3.1.4 --- Interaction Association --- p.10 / Chapter 3.1.5 --- Composition Association --- p.11 / Chapter 3.1.6 --- Cross-Product Association --- p.12 / Chapter 3.1.7 --- Summary Association --- p.13 / Chapter 3.2 --- An Example --- p.14 / Chapter 3.3 --- Occurrences --- p.15 / PART II / Chapter 4 --- SYSTEM OVERVIEW --- p.17 / Chapter 4.1 --- System Objectives --- p.17 / Chapter 4.1.1 --- Data Level --- p.17 / Chapter 4.1.2 --- Meta-Data Level --- p.18 / Chapter 4.2 --- System Characteristics --- p.19 / Chapter 4.3 --- Design Considerations --- p.20 / Chapter 5 --- IMPLEMENTATION CONSIDERATIONS --- p.23 / Chapter 5.1 --- Introduction --- p.23 / Chapter 5.2 --- Data Definition Language for Schema --- p.24 / Chapter 5.3 --- Construction of Directed Acyclic Graph --- p.27 / Chapter 5.4 --- Query Manipulation Language --- p.28 / Chapter 5.4.1 --- Semantic Manipulation Language --- p.29 / Chapter 5.4.1.1 --- Locate Concepts --- p.30 / Chapter 5.4.1.2 --- Retrieve Information About Concepts --- p.30 / Chapter 5.4.1.3 --- Find a Path Between Two Concepts --- p.31 / Chapter 5.4.2 --- Occurrence Manipulation Language --- p.32 / Chapter 5.5 --- Examples --- p.35 / Chapter 6 --- RESULTS AND DISCUSSIONS --- p.41 / Chapter 6.1 --- Allow Non-Homogeneity of Facts about Entities --- p.41 / Chapter 6.2 --- Field Name is Information --- p.42 / Chapter 6.3 --- Description of Group of Information --- p.43 / Chapter 6.4 --- Explicitly Description of Interaction --- p.43 / Chapter 6.5 --- Information about Entities --- p.44 / Chapter 6.6 --- Automatically Joining Tables --- p.45 / Chapter 6.7 --- Automatically Union Tables --- p.45 / Chapter 6.8 --- Automatically Select Tables --- p.46 / Chapter 6.9 --- Ambiguity --- p.47 / Chapter 6.10 --- Normalization --- p.47 / Chapter 6.11 --- Update --- p.50 / PART III / Chapter 7 --- SCHEMA VERIFICATION --- p.55 / Chapter 7.1 --- Introduction --- p.55 / Chapter 7.2 --- Need of Schema Verification --- p.57 / Chapter 7.3 --- Integrity Constraint Handling Vs Schema Verification --- p.58 / Chapter 8 --- AUTOMATIC THEOREM PROVING --- p.60 / Chapter 8.1 --- Overview --- p.60 / Chapter 8.2 --- A Discussion on Some Automatic Theorem Proving Methods --- p.61 / Chapter 8.2.1 --- Resolution --- p.61 / Chapter 8.2.2 --- Natural Deduction --- p.63 / Chapter 8.2.3 --- Tableau Proof Methods --- p.65 / Chapter 8.2.4 --- Connection Method --- p.67 / Chapter 8.3 --- Comparison of Automatic Theorem Proving Methods --- p.70 / Chapter 8.3.1 --- Proof Procedure --- p.70 / Chapter 8.3.2 --- Overhead --- p.70 / Chapter 8.3.3 --- Unification --- p.71 / Chapter 8.3.4 --- Heuristics --- p.72 / Chapter 8.3.5 --- Getting Lost --- p.73 / Chapter 8.4 --- The Choice of Tool for Schema Verification --- p.73 / Chapter 9 --- IMPROVEMENT OF CONNECTION METHOD --- p.77 / Chapter 9.1 --- Motivation of Improving Connection Method --- p.77 / Chapter 9.2 --- Redundancy Handled by the Original Algorithm --- p.78 / Chapter 9.3 --- Design Philosophy of the Improved Version --- p.82 / Chapter 9.4 --- Primary Connection Method Algorithm --- p.83 / Chapter 9.5 --- AND/OR Connection Graph --- p.89 / Chapter 9.6 --- Graph Traversal Procedure --- p.91 / Chapter 9.7 --- Elimination Redundancy Using AND/OR Connection Graph --- p.94 / Chapter 9.8 --- Further Improvement on Graph Traversal --- p.96 / Chapter 9.9 --- Comparison with Original Connection Method Algorithm --- p.97 / Chapter 9.10 --- Application of Connection Method to Schema Verification --- p.98 / Chapter 9.10.1 --- Express Constraint in Well Formed Formula --- p.98 / Chapter 9.10.2 --- Convert Formula into Negation Normal Form --- p.101 / Chapter 9.10.3 --- Verification --- p.101 / PART IV / Chapter 10 --- FURTHER DEVELOPMENT --- p.103 / Chapter 10.1 --- Intelligent Front-End --- p.103 / Chapter 10.2 --- On Connection Method --- p.104 / Chapter 10.3 --- Many-Sorted Calculus --- p.104 / Chapter 11 --- CONCLUSION --- p.107 / APPENDICES / Chapter A --- COMPARISON OF SEMANTIC DATA MODELS --- p.110 / Chapter B --- CONSTRUCTION OP OCCURRENCES --- p.111 / Chapter C --- SYNTAX OF DDL FOR THE SCHEMA --- p.113 / Chapter D --- SYNTAX OF SEMANTIC MANIPULATION LANGUAGE --- p.116 / Chapter E --- TESTING SCHEMA FOR FUND INVESTMENT DBMS --- p.118 / Chapter F --- TESTING SCHEMA FOR STOCK INVESTMENT DBMS --- p.121 / Chapter G --- CONNECTION METHOD --- p.124 / Chapter H --- COMPARISON BETWEEN RESOLUTION AND CONNECTION METHOD --- p.128 / REFERENCES --- p.132

Identiferoai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_318567
Date January 1990
ContributorsYip, Wai Man., Chinese University of Hong Kong Graduate School. Division of Computer Science.
PublisherChinese University of Hong Kong
Source SetsThe Chinese University of Hong Kong
LanguageEnglish
Detected LanguageEnglish
TypeText, bibliography
Formatprint, 135 leaves : ill. ; 30 cm.
RightsUse of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Page generated in 0.0021 seconds