84 research outputs found

    Query processing in temporal object-oriented databases

    Get PDF
    This PhD thesis is concerned with historical data management in the context of objectoriented databases. An extensible approach has been explored to processing temporal object queries within a uniform query framework. By the uniform framework, we mean temporal queries can be processed within the existing object-oriented framework that is extended from relational framework, by extending the existing query processing techniques and strategies developed for OODBs and RDBs. The unified model of OODBs and RDBs in UmSQL/X has been adopted as a basis for this purpose. A temporal object data model is thereby defined by incorporating a time dimension into this unified model of OODBs and RDBs to form temporal relational-like cubes but with the addition of aggregation and inheritance hierarchies. A query algebra, that accesses objects through these associations of aggregation, inheritance and timereference, is then defined as a general query model /language. Due to the extensive features of our data model and reducibility of the algebra, a layered structure of query processor is presented that provides a uniforrn framework for processing temporal object queries. Within the uniform framework, query transformation is carried out based on a set of transformation rules identified that includes the known relational and object rules plus those pertaining to the time dimension. To evaluate a temporal query involving a path with timereference, a strategy of decomposition is proposed. That is, evaluation of an enhanced path, which is defined to extend a path with time-reference, is decomposed by initially dividing the path into two sub-paths: one containing the time-stamped class that can be optimized by making use of the ordering information of temporal data and another an ordinary sub-path (without time-stamped classes) which can be further decomposed and evaluated using different algorithms. The intermediate results of traversing the two sub-paths are then joined together to create the query output. Algorithms for processing the decomposed query components, i. e., time-related operation algorithms, four join algorithms (nested-loop forward join, sort-merge forward join, nested-loop reverse join and sort-merge reverse join) and their modifications, have been presented with cost analysis and implemented with stream processing techniques using C++. Simulation results are also provided. Both cost analysis and simulation show the effects of time on the query processing algorithms: the join time cost is linearly increased with the expansion in the number of time-epochs (time-dimension in the case of a regular TS). It is also shown that using heuristics that make use of time information can lead to a significant time cost saving. Query processing with incomplete temporal data has also been discussed

    A feature-based approach to the Computer-Aided Design of sculptured products

    Get PDF
    Computer-Aided Design systems offer considerable potential for improving design process efficiency. To reduce the 'ease of use' barrier hindering full realisation of this potential amongst general mechanical engineering industries, many commercial systems are adopting a Feature-Based Design (FBD) metaphor. Typically the user is allowed to define and manipulate the design model using interface elements that introduce and control parametric geometry clusters, with engineering meaning, representing specific product features (such as threaded holes, slots, pockets and bosses). Sculptured products, such as golf club heads, shoe lasts, crockery and sanitary ware, are poorly supported by current FBD systems and previous research, because their complex shapes cannot be accurately defined using the geometrically primitive feature sets implemented. Where sculptured surface regions are allowed for, the system interface, data model and functionality are little different from that already provided in many commercial surface modelling systems, and so offer very little improvement in ease of use, quality or efficiency. This thesis presents research to propose and develop an FBD methodology and system suitable for sculptured products. [Continues.

    Fundamentals of object-oriented languages, systems, and methods : Seminar 9434, August 22-26, 1994

    Get PDF

    Fundamentals of object-oriented languages, systems, and methods : Seminar 9434, August 22-26, 1994

    Get PDF

    A comprehensive part model and graphical schema representation for object-oriented databases

    Get PDF
    Part-whole modeling plays an important role in the development of database schemata in data-intensive application domains such as manufacturing, design, computer graphics. text document processing, and so on. Object-oriented databases (OODBs) have been targeted for use in such areas. Thus, it is essential that OODBs incorporate a part relationship as one of their modeling primitives. In this dissertation, we present a comprehensive OODB part model which expands the boundaries of OODB part-whole modeling along three fronts. First, it identifies and codifies new semantics for the OODB part relationship. Second, it provides two novel realizations for part relationships and their associated modeling constructs in the context of OODB data models. Third. it, provides an extensive graphical notation for the development of OODB schemata. The heart of the part model is a part relationship that imposes part-whole interaction on the instances of an OODB. The part relationship is divided into four characteristic dimensions: (1) exclusive/shared. (2) cardinality/ordinality, (3) dependency. and (A) value propagation. The latter forms the basis for the definition of derived attributes in a part hierarchy. To demonstrate the viability of our part model, we present two novel realizations for it in the context of existing OODBs. The first realizes the part relationship as an object class and utilizes only a basic set of OODB constructs. The second realization, an implementation of which is described in this dissertation, uses the unique metaclass mechanism of the VODAK Model Language (VML). This implementation shows that our part model can be incorporated into an existing OODB without having to rewrite a substantial subsystem of the OODB, and it also shows that the VML metaclass facility can indeed support extensions in terms of new semantic relationships. To facilitate the creation of part-whole schemata, we introduce an extensive graphical notation for the part relationship and its associated constructs. This notation complements our more general OODB graphical schema representation which includes symbols for classes, attributes. methods. and a variety of relationships. OO-dini, a graphical schema editor that employs our notation and supports conversion of the graphical schema into textual formats, is also discussed
    corecore