Object-relational Database Research Articles

Implementation of Object Relational Data Base Management on Depreciation System Using ORACL

This research implements concept of Object Relational DataBases Management System ORDBMS on depreciation system because it’s considered as a complex model. ORDBMS abstracts the level of writing system by adding data types defined by user (user define type UDT) which represents business objects, these objects are stored in database as a column on table or object table which can be accessed by using methods defined by user (user define function UDF). Object reference REFs is used instead of multiple relational between tables. Multiple data are implemented using collection data type (Varray, Nested table) without the need for extra tables. The application is programmed using oracle8 software because it has the propriety of an object relational database.

Evaluating the Dynamic Behavior of Database Applications

This paper explores the effect that changing access patterns has on the performance of database management systems. Changes in access patterns play an important role in determining the efficiency of key performance optimization techniques, such as dynamic clustering, prefetching, and buffer replacement. However, all existing benchmarks or evaluation frameworks produce static access patterns in which objects are always accessed in the same order repeatedly. Hence, we have proposed the Dynamic Evaluation Framework (DEF) that simulates access pattern changes using configurable styles of change. DEF has been designed to be open and fully extensible (e.g., new access pattern change models can be added easily). In this paper, we instantiate DEF into the Dynamic Object Evaluation Framework (DoEF) which is designed for object databases, that is, object-oriented or object-relational databases, such as multimedia databases or most XML databases. The capabilities of DoEF have been evaluated by simulating the execution of four different dynamic clustering algorithms. The results confirm our analysis that flexible conservative reclustering is the key in determining a clustering algorithm’s ability to adapt to changes in access pattern. These results show the effectiveness of DoEF at determining the adaptability of each dynamic clustering algorithm to changes in access pattern in a simulation environment. In a second set of experiments, we have used DoEF to compare the performance of two real-life object stores: Platypus and SHORE. DoEF has helped to reveal the poor swapping performance of Platypus.

Stonebraker receives IEEE John von Neumann Medal

In December 2004, Michael Stonebraker was selected to receive the 2005 IEEE John von Neumann Medal for his "contributions to the design, implementation, and commercialization of relational and object-relational database systems." Mike is the first person from the database field selected to receive this award. He joins an illustrious group of former recipients, including Barbara Liskov (2004), Alfred Aho (2003), Ole-Johan Dahl and Kristen Nygaard (2002), Butler Lampson (2001), John Hennessy and David Patterson (2000), Douglas Engelbart (1999), Ivan Sutherland (1998), Maurice Wilkes (1997), Carver Mead (1996), Donald Knuth (1995), John Cocke (1994), Fred Brooks (1993), and Gordon Bell (1992).

Coordinate Systems Integration for Craniofacial Database from Multimodal Devices

This study presents a data registration method for craniofacial spatial data of different modalities. The data consists of three dimensional (3D) vector and raster data models. The data is stored in object relational database. The data capture devices are Laser scanner, CT (Computed Tomography) scan and CR (Close Range) Photogrammetry. The objective of the registration is to transform the data from various coordinate systems into a single 3-D Cartesian coordinate system. The standard error of the registration obtained from multimodal imaging devices using 3D affine transformation is in the ranged of 1-2 mm. This study is a step forward for storing the craniofacial spatial data in one reference system in database.

A Theory of Local Set Queries

A relational database can be considered as a finite structure for a finite relational signature in first-order logic. This allows finite model theory to be used for investigating database theory. However, database research in the last decade has shifted its emphasis from the relational datamodel to higher-order datamodels including object oriented databases, object-relational databases, and most recently the model of semi-structured data and XML. A common characteristic of these new datamodels of interest is their richness in structure. In order to find a suitable generalisation of database theory that can cope with this structural richness a suitable logical ground is needed. In this paper local set theory, which can be considered as a version of higher-order intuitionistic logic, is investigated for this purpose. The central notions of database schema and instance for a slighly restricted class of higher-order datamodels are re-defined in local languages using a finite set interpretation. Terms of “set type” define simple queries, which provide the analogue of relational calculus queries in the relational model. Then the work on computable queries can be generalised as well. An analogue of the reflective relational machine model called LQ machine is defined and proven to be complete, i.e., able to express exactly the computable queries over local languages. Finally, fixed-point operators are added to simple queries. However, adding fixed-points will not increase expressiveness.

Development of applications with fuzzy objects in modern programming platforms

Most of the applications that are currently being developed use object-oriented programming technology, as is the case of those applications built with the Java or C♯ languages. Data management has not kept out of this trend, and object-oriented and object-relational database management systems have arisen as a result. Soft-computing applications need to manage imperfect data and Fuzzy Sets Theory has proven to be a good choice for accomplishing the task of imperfect data management. In this article we present a framework that allows the programmers of soft-computing applications to deal with fuzzy objects in a transparent and intuitive way. This framework can be used to develop an object-oriented code in those systems that conform with current hip object-oriented languages, so that imperfect information can be managed. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 1117–1136, 2005.

Querying web metadata

In this article, we discuss the issues involved in adding a native score management system to object-relational databases, to be used in querying Web metadata (that describes the semantic content of Web resources). The Web metadata model is based on topics (representing entities), relationships among topics (called metalinks ), and importance scores (sideway values) of topics and metalinks. We extend database relations with scoring functions and importance scores. We add to SQL score-management clauses with well-defined semantics, and propose the sideway-value algebra (SVA), to evaluate the extended SQL queries. SQL extensions and the SVA algebra are illustrated through two Web resources, namely, the DBLP Bibliography and the SIGMOD Anthology.SQL extensions include clauses for propagating input tuple importance scores to output tuples during query processing, clauses that specify query stopping conditions, threshold predicates (a type of approximate similarity predicates for text comparisons), and user-defined-function-based predicates. The propagated importance scores are then used to rank and return a small number of output tuples. The query stopping conditions are propagated to SVA operators during query processing. We show that our SQL extensions are well-defined, meaning that, given a database and a query Q, under any query processing scheme, the output tuples of Q and their importance scores stay the same.To process the SQL extensions, we discuss two sideway value algebra operators, namely, sideway value algebra join and topic closure, give their implementation algorithms, and report their experimental evaluations.

Genlight: Interactive high-throughput sequence analysis and comparative genomics

Abstract With rising numbers of fully sequenced genomes the importance of comparative genomics is constantly increasing. Although several software systems for genome comparison analyses do exist, their functionality and flexibility is still limited, compared to the manifold possible applications. Therefore, we developed Genlight(http://piranha.techfak.uni-bielefeld.de.), a Client/Server based program suite for large scale sequence analysis and comparative genomics. Genlight uses the object relational database system PostgreSQL together with a state of the art data representation and a distributed execution approach for large scale analysis tasks. The system includes a wide variety of comparison and sequence manipulation methods and supports the management of nucleotide sequences as well as protein sequences. The comparison methods are complemented by a large variety of visualization methods for the assessment of the generated results. In order to demonstrate the suitability of the system for the treatment of biological questions, Genlight was used to identify potential drug and vaccine targets of the pathogen Helicobacter pylori.

On design and implementation of an object-relational spatial database for activity/travel behaviour research

The development of micro level models of urban processes has partially been facilitated by increased availability of detailed activity/travel survey data. Managing and exploring these data can be resource intensive and time consuming. Researchers and municipal planning organizations increasingly face information management challenges. This paper reviews an experiment in design and implementation of an object-relational geographic database using the principles of object-orientation. A data model is specified using the Unified Modeling Language notation and a visual modeling tool, and then implemented as an object-relational spatial database. The resulting database acts as an information foundation capable of supporting empirical research and application development. The experience suggests that a formal approach to information management can enhance our understanding of complex activity/travel data contributing to informed application of these data to transportation research questions.

Computational database technology for component mode synthesis

The present work show how object relational database management system technology can be used to support an finite element analysis process that includes component mode synthesis using the Craig–Bampton method for calculating reduced mass and stiffness matrices. A general object-oriented model for accessing matrix data independent of matrix representation is presented. The model is used to express the calculations of the reduced stiffness and mass matrices in a declarative query language and thereby letting the database decide how to execute the operations and manage the memory.

A system for information management in simulation of manufacturing processes

A system has been developed to manage simulation information of manufacturing processes, such as mesh information, boundary conditions and process parameters. The goal is to enable information sharing and exchange to make it possible to simulate a whole chain of manufacturing processes, and thereby predict how a modification in one manufacturing process affects the characteristics of the final product. The system has been used to predict successful simulation of a cutting process using mesh information and process parameters. An object-relational database management system is embedded in the system that uses a conceptual EXPRESS schema as database schema. The database management system is lightweight main-memory resident and incorporates an extensible and object-oriented query language. Uniform storage using database technology enables information manipulation independently of any specific simulation tool.

PTGL--a web-based database application for protein topologies.

Protein Topology Graph Library (PTGL) is a database application for the representation and retrieval of protein topologies. Protein topologies are based on a graph-theoretical protein model at secondary structure level. Different views on protein topology are given by four linear notations for their characterization. Protein topologies can be derived at different description levels considering alpha- and beta-structures. The on-line search tool is based on an object-relational database and provides a query browser for data interrogation by string patterns, keyword queries and sequence similarity. Protein topologies are represented both as schematic diagrams and as three-dimensional images.

객체-관계형 데이터베이스에 의한 XML문헌의 검색성능 평가

본 연구의 목적은 객체-관계형 데이터베이스 접근에 의한 XML 문헌의 검색 성능을 평가하는 것이다. 본 논문에서는 INEX(Initiative for the Evaluation of XML retrieval)에서의 XML 문헌의 색인 및 검색 방법에 대하여, 그리고 실험 방법론들에 대하여 기술하고 있다. 대부분의 전통적인 정보검색 성능평가 실험에서와 같이 본 연구에서 사용된 테스트 콜렉션(test collection)은 문헌(즉, XML 문헌), 토픽, ad hoc 검색, 적합성 판단, 평가로 이루어졌다. 그리고 ORDBMS 기술들을 기반으로 개발된 전용 XML 데이터베이스의 일종인 EXIMATM Supply을 사용하여 INEX에서 제공한 대규모 XML 문헌들을 저장하고 검색하였다. 본 논문에서는 실험에서 사용한 시스템에 대한 개략적인 기능들과 색인 및 검색 과정 그리고 INEX 2002에서의 성능평가 결과에 대하여, 앞으로 개선되어야 할 기능에 대하여 논하고 있다.

Regression-Based Self-Tuning Modeling of Smooth User-Defined Function Costs for an Object-Relational Database Management System Query Optimizer

We present a new approach to modeling the execution costs of user-defined functions (UDFs) for the query optimizer of an object-relational DBMS (ORDBMS). Our approach self-tunes a cost model incrementally based on the costs of the recent executions of a UDF. The approach is centered on a feedback loop in which the feedback information comprises individual UDF execution records. Each execution record contains the cost variable values used in the execution and the resulting CPU and disk I/O costs. This feedback information is saved in the execution log and used in a batch to update the cost model. Furthermore, our approach handles nominal cost variables by maintaining separate cost models for recently used values of the variables. We have built a framework that implements the feedback loop in a commercial ORDBMS. Then, we have performed experiments using common database UDFs with smooth cost variations and incrementally modeling the data using multiple regression. The experimental results demonstrate the adaptive accuracy that makes the cost model stabilize quickly while incurring small errors in cost estimations. Our approach has the advantages of incurring little overhead while tuning the cost model continuously throughout the UDF executions.

A methodological approach for object-relational database design using UML

The most common way of designing databases is by means of a conceptual model, such as E/R, without taking into account other views of the system. New object-oriented design languages, such as UML (Unified Modelling Language), allow the whole system, including the database schema, to be modelled in a uniform way. Moreover, as UML is an extendable language, it allows for any necessary introduction of new stereotypes for specific applications. Proposals exist to extend UML with stereotypes for database design but, unfortunately, they are focused on relational databases. However, new applications require complex objects to be represented in complex relationships, object-relational databases being more appropriate for these requirements. The framework of this paper is an Object-Relational Database Design Methodology, which defines new UML stereotypes for Object-Relational Database Design and proposes some guidelines to translate a UML conceptual schema into an object-relational schema. The guidelines are based on the SQL: 1999 object-relational model and on Oracle8i as a product example.

XML 포함질의를 위한 확장형 인덱스

Containment queries for XML documents is one of the most important query types, and thus the efficient support for this type of query is crucial for XML databases. Recently, object-relational database management system (ORDBMS) vendors try to store and retrieve XML data in their products. In this paper, we propose an extensible index to support containment queries over the XML data stored as BLOB type in ORDBMSs. That is, we describe how to implement the index using the extensibility feature of an ORDBMS, and describe its usage.

객체-관계형 데이터베이스를 이용한 XML 문서 저장 기법

XML은 그 스키마가 비정규적이고 불완전한 특성을 가지고 있는 반구조적(semistructured) 데이터로써 인터넷 상의 데이터를 교환하기 위한 사실상의 표준이 되고 있다. 따라서 이러한 데이터를 효율적으로 다루기 위해서는 어떠한 저장장치에 어떠한 방식으로 저장하느냐가 중요한 요인이 된다. 본 연구에서는 기존의 객체-관계형 데이터베이스의 장점을 활용하면서도 DTD에 상관없이 XML 질의 언어에서 요구하는 다양한 질의 종류를 지원할 수 있는 저장 기법을 개발하였다. 이 기법은 XML 데이터 모델의 비정규적인 특성 때문에 발생할 수 있는 오버헤드를 최소화시키고 현존하는 데이터와 자연스럽게 연계할 수 있다. XML is becoming the de facto standard for data exchange over the Internet as a semistructured data which properties are irregular and incomplete. Therefore, to handle these data efficiently. what we use storage devices and storage techniques are Primary factors. In this paper, we developed storage techniques, which take the virtues of an object-relational database and support various query types needed for XML query languages without regard to the DTD. The techniques are capable with connecting naturally with conventional data and reducing overheads caused by the characteristics of an XML data model.

Une plate-forme dynamique pour l'évaluation des performances des bases de données à objets

In object-oriented or object-relational databases such as multimedia databases or most XML databases, access patterns are not static, i.e., applications do not always access the same objects in the same order repeatedly. However, this has been the way these databases and associated optimisation techniques such as clustering have been evaluated up to now. This paper opens up research regarding this issue by proposing a dynamic object evaluation framework (DOEF). DOEF accomplishes access pattern change by defining configurable styles of change. It is a preliminary prototype that has been designed to be open and fully extensible. Though originally designed for the object-oriented model, it can also be used within the object-relational model with few adaptations. Furthermore, new access pattern change models can be added too. To illustrate the capabilities of DOEF, we conducted two different sets of experiments. In the first set of experiments, we used DOEF to compare the performances of four state of the art dynamic clustering algorithms. The results show that DOEF is effective at determining the adaptability of each dynamic clustering algorithm to changes in access pattern. They also led us to conclude that dynamic clustering algorithms can cope with moderate levels of access pattern change, but that performance rapidly degrades to be worse than no clustering when vigorous styles of access pattern change are applied. In the second set of experiments, we used DOEF to compare the performance of two different object stores: Platypus and SHORE. The use of DOEF exposed the poor swapping performance of Platypus.

Network analysis modeling towards GIS based on object-relation database

This paper compares the differences between the mathematical model in graph theory and GIS network analysis model. Thus it claims that the GIS network analysis model needs to solve. Then this paper introduces the spatial data management methods in object-relation database for GIS and discusses its effects on the network analysis model. Finally it puts forward the GIS network analysis model based on the object-relation database. The structure of the model is introduced in detail and research is done to the internal and external memory data structure of the model. The results show that it performs well in practice.

The design of GSC Field Log: ontology-based software for computer aided geological field mapping

Databases containing geological field information are increasingly being constructed directly in the field. The design of such databases is often challenged by opposing needs: (1) the individual need to maintain flexibility of database structure and contents, to accommodate unexpected field situations; and (2) the corporate need to retain compatibility between distinct field databases, to accommodate their interoperability. The Field Log mapping software balances these needs by exploiting a domain ontology developed for field information, one that enables field database flexibility and facilitates compatibility. The ontology consists of cartographic, geospatial, geological and metadata objects that form a common basis for interoperability and that can be instantiated by users into customized field databases. The design of the Field Log software, its foundation on this ontology, and the resulting benefits to usability are presented in this paper. The discussion concentrates on satisfying the flexibility requirement by implementing the ontology as a generic data model within an object-relational database environment; issues of interoperability are not considered in detail. Benefits of this ontologic-driven approach are also developed within a description of the Field Log application, including (1) improved usability due to an user interface based on the geological components of the ontology, and (2) diminished technical prerequisites as users are shielded from the many database and GIS technicalities handled by the ontology.