Signature caching in parallel object database systems

In many application areas, the access pattern is navigational and a large fraction of the accesses are perfect match accesses/queries on one or more words in text strings in the objects. One example of such an application area is XML data stored in object database systems. Such systems will frequently store large amounts of data, and in order to provide the necessary computing power and data bandwidth, a parallel system based on a shared-nothing architecture can be necessary. In this paper, we describe how the signature cache approach can significantly reduce the average object access cost in parallel object database systems.     

PostgreSQL数据库运行状态数据的统计收集机制分析

对象关系数据库是新一代的数据库管理系统,它将关系数据库系统与面向对象数据库系统两方面的特征相结合,不仅能很好地支持对象管理和规则管理,而且能更好地支持原有的关系数据管理.要维护一个对象关系数据库管理系统长期正常有效地运行,其中一个不可忽略的机制就是数据库的清理机制.PostgreSQL是一个面向公众的、开放源代码的对象关系数据库管理系统,受到了人们的普遍认可和欢迎.对该系统数据清理机制的一个重要组成部分--数据库运行状态的数据统计收集机制进行了全面分析,给出了统计收集信息的种类、主要函数、数据结构和实现算法,这将有助于维护和完善该数据库系统.     

A CAD Model Based System for Object Recognition

3D object recognition is a difficult and yet an important problem in computer vision. A 3D object recognition system has two major components, namely: an object modeller and a system that performs the matching of stored representations to those derived from the sensed image. The performance of systems wherein the construction of object models is done by training from one or more images of the objects, has not been very satisfactory. Although objects used in a robotic workcell or in assembly processes have been designed using a CAD system, the vision systems used for recognition of these objects are independent of the CAD database. This paper proposes a scheme for interfacing the CAD database of objects and the computer vision processes used for recognising these objects. CAD models of objects are processed to generate vision oriented features that appear in the different views of the object and the same features are extracted from images of the object to identify the object and its pose.     

A database approach for information communication in a peer‐to‐peer collaborative CAD environment

Timely and efficient information communication is a key factor in ensuring successful collaboration in engineering collaborative design. This work proposes a database approach to support information communication between distributed and autonomous CAD systems. It provides the designer with an easy and flexible way, a project‐based propagation meta‐table, to specify what parts of a CAD information model should be communicated to other collaborating designers. A CAD peer manager, containing a peer database that stores information to be exchanged with the other collaborators, wraps each participating CAD system. The peer manager identifies changes made to the CAD model by using stored procedures and active rules in the peer database that are automatically generated based on the propagation meta‐table. The identified updates are propagated in a timely manner to other peers via inter‐database message passing, thereby minimizing the volume of necessary information to be exchanged. Furthermore, remote peer designers can flexibly incorporate, filter, or delete received updates by using a propagation control interface, which is also used to issue user's commands to download the data from the CAD system to the peer database and lookup the received messages in the peer database. The approach is applicable on any CAD system having a CORBA interface and can also be applied to other kinds of object‐oriented interfaces. Copyright © 2007 John Wiley & Sons, Ltd.     

A conceptual schema-based temporal meta database schemas generation technique for 3D objects

In this paper, a temporal meta database for three-dimensional (3D) objects whose properties and relationships are supported by valid time is introduced. Based on our proposed temporal object-oriented conceptual schema model, a conceptual schema of the temporal meta database can be generated from a 3D graphical data source and other particular application requirements. Based on our proposed temporal object relational data model with attribute timestamping, logical schemas of the temporal meta database can be systematically and automatically generated from the conceptual schema. From the temporal meta database, non-temporal/temporal metadata about temporal 3D objects are available for temporal information system users. Convenient access using database languages such as SQL can be performed. Queries over 3D objects using a temporal object relational SQL are demonstrated.     

The Relationlog system prototype

The Relationlog system is a novel persistent deductive database system for advanced data and knowledge‐based applications. It directly supports the storage and inference of data with complex structures, especially data supported in nested relational and complex‐object models. The Relationlog system supports the Relationlog query language, which is a typed extension of Datalog with tuples and sets and stands in the same relationship to the nested relational and complex‐object models as Datalog stands to the relational model. It also supports an SQL‐like data definition language and a declarative data manipulation language. This article introduces the Relationlog language, discusses the system architecture, the design decisions incorporated within its implementation, and our experience in developing the system. Copyright © 2001 John Wiley & Sons, Ltd.     

Query processing over object views of relational data

This paper presents an approach to object view management for relational databases. Such a view mechanism makes it possible for users to transparently work with data in a relational database as if it was stored in an object-oriented (OO) database. A query against the object view is translated to one or several queries against the relational database. The results of these queries are then processed to form an answer to the initial query. The approach is not restricted to a ‘pure’ object view mechanism for the relational data, since the object view can also store its own data and methods. Therefore it must be possible to process queries that combine local data residing in the object view with data retrieved from the relational database. We discuss the key issues when object views of relational databases are developed, namely: how to map relational structures to sub-type/supertype hierarchies in the view, how to represent relational database access in OO query plans, how to provide the concept of object identity in the view, how to handle the fact that the extension of types in the view depends on the state of the relational database, and how to process and optimize queries against the object view. The results are based on experiences from a running prototype implementation. Edited by: M.T. ?zsu. Received April 12, 1995 / Accepted April 22, 1996     

基于MTM的服装大批量定制集成平台研究

针对服装企业各信息化系统相互独立、交互性差等现状,提出基于MTM的服装大批量定制平台构建理论,三维人体测量系统获得顾客个性化体型数据并存入客户订单数据库,由客户订单系统将此数据导出至服装CAD系统,通过MTM变形,得到衣片变更样板,存入PDM系统,为服装CAM系统提供数据源。由此将三维人体测量系统、客户订单系统、服装PDM系统、服装CAD系统和服装CAM系统有机集成,减少企业信息孤岛,形成一个面向服装大批量定制的设计、加工、销售、管理集成平台。     

一个开放可扩展的SDAI实现系统

STEP标准数据存取界面－SDAI为应用程序提供了独立于数据存储的STEP数据访问界面，SDAI允许访问不同的数据存储系统，有不同的实现语言联编方式，如果对每一种实用语言和数据存储系统单独实现SDAI，其工作量将是巨大的，该文选择系数据库作为SDAI数据存储系统，C语言作为实现语言，实现系统独立于不同的关系数据库系统，并且为不同语言的联编提供了一个统一的开发平台，提高了系统的开放性和可扩展性，为STEP在企业信息集成中的应用提供了核心操作，STEP建模语言EXPRESS，关系数据库，SDAI实现语言在模式表示上的不匹配是系统实现要解决的主要问题，该文从数据字典，STEP数据的字储与访问等方面阐明了系统实现时没模式之间的匹配过程。     

Modelling test data for performance evaluation of large parallel database machines

Parallel servers offer improved processing power for relational database systems and provide system scalability. In order to support the users of these systems, new ways of assessing the performance of such machines are required. If these assessments are to show how the machines perform under commercial workloads they need to be based upon models which have a real commercial basis. This paper shows how a realistic model of a financial application has been developed and how a set of tools has been created which allow the implementation of the model on any commercial database system. The tools allow the generation of large quantities of test data in a manner which renders it amenable to subsequent independent analysis. The test data thus generated forms the basis for the performance tuning of parallel database machines.Recommended by: Patrick Valduriez     

对象模式到关系模式转换的软件框架研究

数据在信息系统中的使用面临着这样一个困难，即数据存储是以关系模型为基础，而软件开发以对象模型来进行，造成了软件开发中数据访问技术的不和谐。在软件实现上陷入两种模式的转换工作，破坏面向对象语言的面向对象性，造成开发效率低下，代码重用率变低。提出并建立了一个软件框架，利用它提供的处于关系数据库和客户端之间的API来进行基于对象的数据库访问，充分发挥两种不同模式的优点，以提高软件开发的效率。     

通用映射模式下GML关系数据库存储研究*

提出了一种将GML文档存储到关系数据库的存储映射模型G2RDB,通过解析GML文档,提取文档的要素信息、空间对象信息和嵌套关系等,根据预先定义的映射规则和要素模型的映射关系表,形成GML数据文档与关系数据库之间的关系模式映射表：要素信息表、要素模型映射表、同类要素属性信息表和空间对象信息表,将文档数据存储到RDBMS中,实现了GML文档的关系数据库存储,同时生成了同样可用于其他GML实例数据的通用映射关系表模式。在关系数据库存储方式下,应用SQL和自开发的空间操作算子函数可以实现GML数据的查询,依据映射     

对象模式到关系模式转换的软件框架研究

数据在信息系统中的使用面临着这样一个困难,即数据存储是以关系模型为基础,而软件开发以对象模型来进行,造成了软件开发中数据访问技术的不和谐。在软件实现上陷入两种模式的转换工作,破坏面向对象语言的面向对象性,造成开发效率低下,代码重用率变低。提出并建立了一个软件框架,利用它提供的处于关系数据库和客户端之间的API来进行基于对象的数据库访问,充分发挥两种不同模式的优点,以提高软件开发的效率。     

Dynamic Multi-Resolution Spatial Object Derivation for Mobile and WWW Applications

Online geographic information systems provide the means to extract a subset of desired spatial information from a larger remote repository. Data retrieved representing real-world geographic phenomena are then manipulated to suit the specific needs of an end-user. Often this extraction requires the derivation of representations of objects specific to a particular resolution or scale from a single original stored version. Currently standard spatial data handling techniques cannot support the multi-resolution representation of such features in a database. In this paper a methodology to store and retrieve versions of spatial objects at different resolutions with respect to scale using standard database primitives and SQL is presented. The technique involves heavy fragmentation of spatial features that allows dynamic simplification into scale-specific object representations customised to the display resolution of the end-user's device. Experimental results comparing the new approach to traditional R-Tree indexing and external object simplification reveal the former performs notably better for mobile and WWW applications where client-side resources are limited and retrieved data loads are kept relatively small.     

Algorithms for asynchronous parallel processing of object-orienteddatabases

Management of large quantities of complex data is essential in many advanced application areas. Object-oriented (OO) database management system have been developed to effectively model and process the complex domain knowledge. They have been shown to outperform some existing relational systems. The existing implementations of OO database management systems attempt to improve the efficiency of OO queries by explicitly capturing the relationships among objects. However, the execution of complex queries involving the retrieval of objects from many classes and relationships among them causes the existing system to operate inefficiently. In this paper, we present parallel algorithms for the processing of queries against a large OO database. The algorithms are based on a closed model of query processing pattern-based access instead of the conventional value-based access. During processing, the algorithms avoid the execution of time-consuming join operations by making use of the explicitly stored object associations. Generation of large quantities of temporary data is avoided by marking objects using their identifiers and by employing a two-phase query processing strategy. A query is processed by concurrent multiple waves, thereby improving parallelism avoiding the complexities introduced in their sequential implementation. The correctness and the performance of the parallel algorithms have been tested and analyzed by running parallel programs on a 32-node transputer based parallel machine designed and developed at the IBM Research Center at Yorktown Heights, New York. Benchmark queries of different semantic complexities are generated, and their performance is analyzed for various data and query parameters     

Magnetic bubble memory structures for relational database management systems

Recently the concept of using magnetic bubble technology to store data and to perform logical operations has received considerable attention. By exploiting this hardware approach for relational database management systems, we introduce an efficient support for records permutation, sorting and searching for data. Actually these are substantial operations in relational data models.The organization of a relational data model in a magnetic bubbie memory is straightforward. In such systems the memory consists of loops, where each loop is capable of holding one record. Under the control of a switch, a loop can circulate the records or can hold them in position. However, as the number of switches in the memory system increases, the number of control lines becomes large and the model structure may lose its practical significance.In this investigation three different models of bubble memories are applied to a simple relational database example. The two basic operations of permuting records and searching for data are emphasized. For these models, some theoretical features, the essential characteristics and their applicability are pointed out.     

Introduction

We describe an SQL relational database schema for representing the objects in HyperCard, along with a technique for automatically populating this schema from a HyperCard stack using the facilities in HyperTalk with calls to the database manager. The standard relational database query language SQL can then be used to perform more general hypertext searches than are possible with the string search feature found in most hypertext browsing environments. Semiautomatic updates of the content of a hypertext are also possible using SQL updates on the object representations in the database to trigger corresponding HyperCard updates on the objects themselves. We describe a prototype implementation and present several example queries and updates to motivate this approach. These techniques, although demonstrated here specifically using HyperCard and Oracle for Macintosh, are generally applicable to a wide range of hypertext systems and relational databases.     

城镇管网信息系统UPNIS

提出了城镇管网信息系统的总体设计与实现方案。该系统使用广义关系数据库存储和管理各类管线的属性信息和管线的图形信息;基于二维和三维固定划分的和面向类对象的四叉树空间索引机制,有效地实现的空间信息的查询和图形编辑。