• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 34
  • 8
  • 4
  • 1
  • 1
  • 1
  • Tagged with
  • 61
  • 61
  • 61
  • 26
  • 17
  • 17
  • 15
  • 12
  • 11
  • 9
  • 8
  • 8
  • 7
  • 6
  • 6
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

Inference engine in objectbase: a mean towards metasystems.

January 1995 (has links)
Yu-shan Chan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1995. / Includes bibliographical references (leaves 95-99). / Chapter 1. --- INTRODUCTION --- p.1 / Chapter 1.1 --- "Expert System, Expert System Shell, and ""MetaSystem""" --- p.2 / Chapter 1.2 --- Adopting OBJECTBASE In EXPERT SYSTEM SHELL(ESS) --- p.4 / Chapter 2. --- SURVEY ON EXISTING SYSTEMS --- p.7 / Chapter 2.1 --- Review of inference models --- p.7 / Chapter 2.1.1 --- The Classical Period --- p.9 / Chapter 2.1.2 --- The modern period --- p.11 / Chapter 2.2 --- Rules in Objectbase vs. other Representations --- p.12 / Chapter 2.2.1 --- Rule-based systems --- p.13 / Chapter 2.2.2 --- Object-oriented systems --- p.13 / Chapter 2.2.3 --- Other systems --- p.13 / Chapter 2.2.4 --- Rules embedded in object-- the Objectbase approach --- p.14 / Chapter 2.3 --- Conclusion --- p.15 / Chapter 3. --- DESIGN OF ESS FOR AN OBJECTBASE SYSTEM --- p.16 / Chapter 3.1 --- Introducing ESS in Objectbase --- p.18 / Chapter 3.1.1 --- The Concept of Object Modeling --- p.19 / Chapter 3.1.2 --- Why Objectbase? --- p.20 / Chapter 3.1.3 --- ESS : a higher layer on Objectbase --- p.22 / Chapter 3.1.4 --- Schema Objects and Shell Objects --- p.23 / Chapter 3.2 --- Module design of ESS --- p.24 / Chapter 3.2.1 --- Knowledge Representation Module --- p.25 / Chapter 3.2.2 --- Objectbase inference module --- p.27 / Chapter 3.2.3 --- The Rule一Inference Module --- p.28 / Chapter 3.3 --- Knowledge Representation --- p.29 / Chapter 3.3.1 --- Schema Knowledge & the Rulebase --- p.30 / Chapter 3.3.2 --- Rule Structure --- p.31 / Chapter 3.4 --- Inference Engine --- p.35 / Chapter 3.4.1 --- The Two Levels of Inference --- p.35 / Chapter 3.5 --- Rule一Inference (RI) --- p.37 / Chapter 3.5.1 --- Structural design of RI --- p.38 / Chapter 3.5.2 --- Drawing Inference --- p.39 / Chapter 3.5.3 --- Query Processor and RI --- p.42 / Chapter 3.5.4 --- RI and the Inference Engine(IE) --- p.43 / Chapter 3.6 --- Conclusion --- p.43 / Chapter 4. --- IMPLEMENTATION --- p.45 / Chapter 4.1 --- Rulelnference: a comprehensive structure --- p.46 / Chapter 4.1.1 --- Class Rule --- p.46 / Chapter 4.1.2 --- Class RuleList --- p.47 / Chapter 4.1.3 --- Accompany data structures for inference --- p.48 / Chapter 4.1.4 --- Class Rulelnference --- p.49 / Chapter 4.2 --- Rule Setting --- p.51 / Chapter 4.2.1 --- Rule Construction --- p.51 / Chapter 4.2.2 --- Rule Parsing and the Rule Definition Language (RDL) --- p.52 / Chapter 4.3 --- How Inference is done in ESS --- p.53 / Chapter 4.3.1 --- Reset and Load system --- p.53 / Chapter 4.3.2 --- Inference making --- p.54 / Chapter 4.4 --- Using RuleInference in the Rule Constructor --- p.58 / Chapter 4.4.1 --- The Rule Constructor --- p.59 / Chapter 4.5 --- Using Rulelnference in the Application Constructor --- p.60 / Chapter 4.5.1 --- The RiNode --- p.61 / Chapter 4.5.2 --- Schema and Rule Set Handling --- p.63 / Chapter 4.6 --- Conclusion --- p.64 / Chapter 5. --- CASE STUDY --- p.66 / Chapter 5.1 --- Background on Statement analysis --- p.66 / Chapter 5.1.1 --- Ratios for decision making --- p.68 / Chapter 5.2 --- Sample System: Financial Data Analysis System --- p.70 / Chapter 5.2.1 --- The FINANCE schema --- p.71 / Chapter 5.2.2 --- Rules --- p.73 / Chapter 5.2.3 --- Results --- p.75 / Chapter 5.3 --- Evaluation --- p.81 / Chapter 5.4 --- Conclusion --- p.82 / Chapter 6. --- RESULT AND DISCUSSION --- p.84 / Chapter 6.1 --- An Expert System Shell on Objectbase --- p.84 / Chapter 6.2 --- The ESS on MOBILE --- p.85 / Chapter 6.3 --- Pros and cons for the ESS --- p.86 / Chapter 6.4 --- MOBILE: how it has been improved --- p.87 / Chapter 7. --- CONCLUSION --- p.89 / Chapter 7.1 --- Comparison --- p.91 / Chapter 7.2 --- Appraisal --- p.92 / Chapter 8. --- REFERENCES --- p.95 / Table of Content for Appendixes / APPENDIX 1. RULE DEFINITION LANGUAGE --- p.100 / APPENDIX 2. THE CLASS RULEINFERENCE --- p.103 / APPENDIX 3. THE RINODE --- p.104 / APPENDIX 4. FINANCIAL STATEMENT ANALYSIS --- p.108 / APPENDIX 5. DATA STRUCTURE OF RULE AND RULELIST --- p.117 / APPENDIX 6. DATA STRUCTURE OF VARLIST AND ACTLIST --- p.118 / APPENDIX 7. DATA STRUCTURE OF RULEINFERENCE --- p.121
12

Indexing techniques for object-oriented databases.

January 1996 (has links)
by Frank Hing-Wah Luk. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 92-95). / Abstract --- p.ii / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.1 / Chapter 1.2 --- The Problem in Object-Oriented Database Indexing --- p.2 / Chapter 1.3 --- Contributions --- p.3 / Chapter 1.4 --- Thesis Organization --- p.4 / Chapter 2 --- Object-oriented Data Model --- p.5 / Chapter 2.1 --- Object-oriented Data Model --- p.5 / Chapter 2.2 --- Object and Object Identifiers --- p.6 / Chapter 2.3 --- Complex Attributes and Methods --- p.6 / Chapter 2.4 --- Class --- p.8 / Chapter 2.4.1 --- Inheritance Hierarchy --- p.8 / Chapter 2.4.2 --- Aggregation Hierarchy --- p.8 / Chapter 2.5 --- Sample Object-Oriented Database Schema --- p.9 / Chapter 3 --- Indexing in Object-Oriented Databases --- p.10 / Chapter 3.1 --- Introduction --- p.10 / Chapter 3.2 --- Indexing on Inheritance Hierarchy --- p.10 / Chapter 3.3 --- Indexing on Aggregation Hierarchy --- p.13 / Chapter 3.4 --- Indexing on Integrated Support --- p.16 / Chapter 3.5 --- Indexing on Method Invocation --- p.18 / Chapter 3.6 --- Indexing on Overlapping Path Expressions --- p.19 / Chapter 4 --- Triple Node Hierarchy --- p.23 / Chapter 4.1 --- Introduction --- p.23 / Chapter 4.2 --- Triple Node --- p.25 / Chapter 4.3 --- Triple Node Hierarchy --- p.26 / Chapter 4.3.1 --- Construction of the Triple Node Hierarchy --- p.26 / Chapter 4.3.2 --- Updates in the Triple Node Hierarchy --- p.31 / Chapter 4.4 --- Cost Model --- p.33 / Chapter 4.4.1 --- Storage --- p.33 / Chapter 4.4.2 --- Query Cost --- p.35 / Chapter 4.4.3 --- Update Cost --- p.35 / Chapter 4.5 --- Evaluation --- p.37 / Chapter 4.6 --- Summary --- p.42 / Chapter 5 --- Triple Node Hierarchy in Both Aggregation and Inheritance Hierarchies --- p.43 / Chapter 5.1 --- Introduction --- p.43 / Chapter 5.2 --- Preliminaries --- p.44 / Chapter 5.3 --- Class-Hierarchy Tree --- p.45 / Chapter 5.4 --- The Nested CH-tree --- p.47 / Chapter 5.4.1 --- Construction --- p.47 / Chapter 5.4.2 --- Retrieval --- p.48 / Chapter 5.4.3 --- Update --- p.48 / Chapter 5.5 --- Cost Model --- p.49 / Chapter 5.5.1 --- Assumptions --- p.51 / Chapter 5.5.2 --- Storage --- p.52 / Chapter 5.5.3 --- Query Cost --- p.52 / Chapter 5.5.4 --- Update Cost --- p.53 / Chapter 5.6 --- Evaluation --- p.55 / Chapter 5.6.1 --- Storage Cost --- p.55 / Chapter 5.6.2 --- Query Cost --- p.57 / Chapter 5.6.3 --- Update Cost --- p.62 / Chapter 5.7 --- Summary --- p.63 / Chapter 6 --- Decomposition of Path Expressions --- p.65 / Chapter 6.1 --- Introduction --- p.65 / Chapter 6.2 --- Configuration on Path Expressions --- p.67 / Chapter 6.2.1 --- Single Path Expression --- p.67 / Chapter 6.2.2 --- Overlapping Path Expressions --- p.68 / Chapter 6.3 --- New Algorithm --- p.70 / Chapter 6.3.1 --- Example --- p.72 / Chapter 6.4 --- Evaluation --- p.75 / Chapter 6.5 --- Summary --- p.76 / Chapter 7 --- Conclusion and Future Research --- p.77 / Chapter 7.1 --- Conclusion --- p.77 / Chapter 7.2 --- Future Research --- p.78 / Chapter A --- Evaluation of some Parameters in Chapter5 --- p.79 / Chapter B --- Cost Model for Nested-Inherited Index --- p.82 / Chapter B.1 --- Storage --- p.82 / Chapter B.2 --- Query Cost --- p.84 / Chapter B.3 --- Update --- p.84 / Chapter C --- Algorithm constructing a minimum auxiliary set of J Is --- p.87 / Chapter D --- Estimation on the number of possible combinations --- p.89 / Bibliography --- p.92
13

From entities to objects : reverse engineering a relational data model into an object-oriented design

Hines, Gary L. January 2000 (has links)
In many software applications, an object-oriented design (OOD) is generated first, then persistent storage is implemented by mapping the objects to a relational database. This thesis explores the "reverse engineering" of an OOD out of an existing relational data model. Findings from the current literature are presented, and a case study is undertaken using the model and research process published by GENTECH, a nonprofit organization promoting genealogical computing. The model is mapped into an OOD and captured in Unified Modeling Language (UML) class diagrams and object collaboration diagrams. The suitability of the example OOD is evaluated against the GENTECH research process using UML use cases and sequence diagrams. The mapping of relational database designs into OODs is found to be suitable in certain instances. / Department of Computer Science
14

Constructing highly-available distributed metainformation systems

Calsavara, Alcides January 1996 (has links)
This thesis demonstrates the adequacy of an object-oriented approach to the construction of distributed metainformation systems: systems that facilitate information use by maintaining some information about the information. Computer systems are increasingly being used to store information objects and make them accessible via network. This access, however, still relies on an adequate metainformation system: there must be an effective means of specifying relevant information objects. Moreover, distribution requires the metainformation system to cope well with intermittent availability of network resources. Typical metainformation systems developed to date permit information objects to be specified by expressing knowledge about their syntactic properties, such as keywords. Within this approach, however, query results are potentially too large to be transmitted, stored and treated, at reasonable cost and time. Users are therefore finding it difficult to navigate their way through the masses of information available. In contrast, this thesis is based on the principle that a metainformation system IS more effective if it permits information objects to be specified according to their semantic properties, and that this helps managing, filtering and navigating information. Of particular interest is object orientation because it is the stateof- the-art approach to both the representation of information semantics and the Abstract 11 design of reliable systems. The thesis presents the design and implementation of a programming toolkit for the construction of metainformation systems, where information objects can be any entity that contains information, the notion of views permits organising the information space, transactional access is employed to obtain consistency, and replication is employed to obtain high availability and scalability.
15

Neural network based shaped neighborhoods : a design retrieval system /

Holman, Frank S. January 1999 (has links)
Thesis (Ph. D.)--University of Washington, 1999. / Vita. Includes bibliographical references (leaves 90-92).
16

Object-oriented database management technology for feature-based geographic information systems

Wiegand, Nancy Kay. January 1900 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1994. / Typescript. Includes bibliographical references (leaves 133-141).
17

A Unifying Version Model for Objects and Schema in Object-Oriented Database System

Shin, Dongil 08 1900 (has links)
There have been a number of different versioning models proposed. The research in this area can be divided into two categories: object versioning and schema versioning. In this dissertation, both problem domains are considered as a single unit. This dissertation describes a unifying version model (UVM) for maintaining changes to both objects and schema. UVM handles schema versioning operations by using object versioning techniques. The result is that the UVM allows the OODBMS to be much smaller than previous systems. Also, programmers need know only one set of versioning operations; thus, reducing the learning time by half. This dissertation shows that UVM is a simple but semantically sound and powerful version model for both objects and schema.
18

The importance of abstraction in the development of distributed and cross-platform frameworks

Worrall, Basil Graeme. January 2009 (has links)
Thesis (M. Sc(Computer Science))--University of Pretoria, 2009. / Includes bibliographical references (leaves [180]-191).
19

Extensible object-oriented databases with dynamic schemas

Morsi, Magdi, M. A. 08 1900 (has links)
No description available.
20

The next generation of database : object-oriented database

Hon, Wing-Keung January 1994 (has links)
As some new computer applications, such as computer-aided design, multimedia systems, and knowledge-based systems, require more complex data structures, the traditional database system seems to be unable to support these new requirements. A recently developed database technology, object-oriented database, provides a solution to these problems.The purpose of this thesis is to investigate what is object-oriented database, especially in its internal organization such as object persistency. Two object-oriented database systems, EXODUS and ODE, are discussed in detail. In addition, a comparison between the relational databases and object-oriented databases is made. / Department of Computer Science

Page generated in 0.1048 seconds