• Title/Summary/Keyword: Object-relational Databases

Search Result 51, Processing Time 0.021 seconds

Object Views in the ODYSSEUS Object-Relational DBMS (오디세우스 객체관계형 DBMS를 위한 오브젝트 뷰)

  • 이재길;한욱신;이민재;이종학;황규영
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.1
    • /
    • pp.14-24
    • /
    • 2004
  • Views are essential in providing logical data independence for database systems. Object views in object-oriented/object-relational databases have requirements quite different from those of relational databases due to support for object-oriented concepts. Although many commercial object-oriented/object-relational database systems support object views, implementation techniques have not been discussed sufficiently in the literature. In this paper, we devise a technique for implementing views in object-oriented/object-relational databases and apply it to the ODYSSEUS object-relational database system. We first analyze the requirements of object views. Next, to implement object views, we extend the existing query modification algorithm that has been proposed for implementing views in relational databases. Next, we compare the features of the proposed object view with those of object views in commercial object-relational database systems. It is shown that the proposed object view supports all object-oriented concepts such as object identifiers, inheritance, methods, and composite objects, while existing object views support part of them. Last, we propose detailed techniques for implementing the extended query modification algorithm in the ODYSSEUS object-relational database system.

ValueRank: Keyword Search of Object Summaries Considering Values

  • Zhi, Cai;Xu, Lan;Xing, Su;Kun, Lang;Yang, Cao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.5888-5903
    • /
    • 2019
  • The Relational ranking method applies authority-based ranking in relational dataset that can be modeled as graphs considering also their tuples' values. Authority directions from tuples that contain the given keywords and transfer to their corresponding neighboring nodes in accordance with their values and semantic connections. From our previous work, ObjectRank extends to ValueRank that also takes into account the value of tuples in authority transfer flows. In a maked difference from ObjectRank, which only considers authority flows through relationships, it is only valid in the bibliographic databases e.g. DBLP dataset, ValueRank facilitates the estimation of importance for any databases, e.g. trading databases, etc. A relational keyword search paradigm Object Summary (denote as OS) is proposed recently, given a set of keywords, a group of Object Summaries as its query result. An OS is a multilevel-tree data structure, in which node (namely the tuple with keywords) is OS's root node, and the surrounding nodes are the summary of all data on the graph. But, some of these trees have a very large in total number of tuples, size-l OSs are the OS snippets, have also been investigated using ValueRank.We evaluated the real bibliographical dataset and Microsoft business databases to verify of our proposed approach.

An XML Data Management System Using an Object-Relational Database

  • Nam, S.H.;Jung, T.S.;Kim, T.K.;Kim, K.R.;Zahng, H.K.;Yoo, J.S.;Cho, W.S.
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2007.02a
    • /
    • pp.163-167
    • /
    • 2007
  • We propose an XML document storage system, called XDMS (XML Document Management System), by using an object-relational DBMS. XDMS generates object database schema from XML Schema and stores the XML documents in an object-relational database. SAX parser is used for understanding the structure of the XML documents, and XDMS transforms the documents into objects in the database. Experiment shows that object-relational databases provide more efficient storage and query model compared with relational databases.

  • PDF

A New Benchmark for Object-relational DBMSs (객체-관계형 데이터베이스 시스템을 위한 새로운 성능 평가 방법론)

  • Kim, Seong-Jin;Lee, Sang-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.7
    • /
    • pp.1997-2007
    • /
    • 2000
  • This paper presents a new benchmark for object-relational database systems, which are regarded as the next-generation database system. This benchmark has been developed to evaluate system performance peculiar to object-relational database systems. The design philosophy, test databases, an test queries of the benchmark are presented. This benchmark features scaleability, use of a synthesized database only, and a query-oriented evaluation. We have implemented his benchmark with two commerical object-relational database systems and the experimental results are also reported.

  • PDF

RDB-based XML Access Control Model with XML Tree Levels (XML 트리 레벨을 고려한 관계형 데이터베이스 기반의 XML 접근 제어 모델)

  • Kim, Jin-Hyung;Jeong, Dong-Won;Baik, Doo-Kwon
    • Journal of Digital Contents Society
    • /
    • v.10 no.1
    • /
    • pp.129-145
    • /
    • 2009
  • As the secure distribution and sharing of information over the World Wide Web becomes increasingly important, the needs for flexible and efficient support of access control systems naturally arise. Since the eXtensible Markup Language (XML) is emerging as the de-facto standard format of the Internet era for storing and exchanging information, there have been recently, many proposals to extend the XML model to incorporate security aspects. To the lesser or greater extent, however, such proposals neglect the fact that the data for XML documents will most likely reside in relational databases, and consequently do not utilize various security models proposed for and implemented in relational databases. In this paper, we take a rather different approach. We explore how to support security models for XML documents by leveraging on techniques developed for relational databases considering object perspective. More specifically, in our approach, (1) Users make XML queries against the given XML view/schema, (2) Access controls for XML data are specified in the relational database, (3) Data are stored in relational databases, (4) Security check and query evaluation are also done in relational databases, and (5) Controlling access control is executed considering XML tree levels

  • PDF

Design and Implementation of Spatiotemporal Query Extension on ORDBMS (ORDBMS 기반 시공간 질의 확장의 설계 및 구현)

  • Yun, Sung Hyun;Nam, Kwang Woo
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.6 no.4
    • /
    • pp.37-50
    • /
    • 2003
  • In the paper, we describe the query extension techniques for spatiotemporal query functionalities on object-relational DBMS. The spatial objects in real world change the shapes over time. Spatiotemporal databases support to manage a temporal dimension as well as a spatial dimension for history of the objects. The proposed techniques can make conventional object-relational databases to support spatiotemporal databases system by the implementation and inheritance of abstract data types. We define and implement spatial and temporal classes as superclass. And, spatiotemporal classes inherits and extends the classes. The proposed extensions make it easy that conventional database systems not only are transformed into the spatiotemporal database systems, but also do not need to be changed to support spatiotemporal applications.

  • PDF

Visualization of Path Expressions with Set Attributes and Methods in Graphical Object Query Languages (그래픽 객체 질의어에서 집합 속성과 메소드를 포함한 경로식의 시각화)

  • 조완섭
    • Journal of KIISE:Databases
    • /
    • v.30 no.2
    • /
    • pp.109-124
    • /
    • 2003
  • Although most commercial relational DBMSs Provide a graphical query language for the user friendly interfaces of the databases, few research has been done for graphical query languages in object databases. Expressing complex query conditions in a concise and intuitive way has been an important issue in the design of graphical query languages. Since the object data model and object query languages are more complex than those of the relational ones, the graphical object query language should have a concise and intuitive representation method. We propose a graphical object query language called GOQL (Graphical Object Query Language) for object databases. By employing simple graphical notations, advanced features of the object queries such as path expressions including set attributes, quantifiers, and/or methods can be represented in a simple graphical notation. GOQL has an excellent expressive power compared with previous graphical object query languages. We show that path expressions in XSQL(1,2) can be represented by the simple graphical notations in GOQL. We also propose an algorithm that translates a graphical query in GOQL into the textual object query with the same semantics. We finally describe implementation results of GOQL in the Internet environments.

The EBORD Benchmark for Database Systems (데이터베이스 시스템을 위한 EBORD 성능 평가 방법론)

  • Jeong, Hoe-Jin;Lee, Sang-Ho
    • Journal of Information Technology Applications and Management
    • /
    • v.12 no.2
    • /
    • pp.29-43
    • /
    • 2005
  • The paper presents the EBORD (Extended Benchmark for Object-Relational Databases) benchmark, which is an extension of the BORD benchmark for object-relational databases. The EBORD benchmark is developed to evaluate the database common functions that should be supported in modern database systems. Besides the 36 test queries already defined in the BORD benchmark, totally 22 test queries in five categories are newly defined in order to measure the index-relevant performance issues and database import capabilities. The EBORD benchmark also features scalability, use of a synthesized database, and a query-oriented evaluation. In order to show the feasibility of the proposed benchmark, we implement it with two commercial database systems. The experimental results and analyses are also reported.

  • PDF

A Formal Specification of Fuzzy Object Inference Model for Supporting Disjunctive Fuzzy Information (이접적 퍼지 정보를 지원하는 퍼지 객체 추론 모델의 정형화)

  • 양형정;양재동
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2001.05a
    • /
    • pp.184-197
    • /
    • 2001
  • In this paper, we provide the formal specification of a fuzzy object inference language and propose ICOT(Integrated C-Object Tool) as its implementation for knowledge-based programming with the disjunctive fuzzy information. The novelty of our model is that it seamlessly combines object inference and fuzzy reasoning into a unified framework without compromising a compatibility with extant databases, especially object-relational ones. In this model most of the object-oriented paradigm is successfully expressed in terms of relational constructs, tailoring fuzzy reasoning style to be well suited to the framework of the databases. It turns out to be useful in preserving its conceptual simplicity as well, since simple-to-use is one of important criteria in designing the databases. Additionally this model considerably enhanced the semantic expressiveness of data allowing disjunctive fuzzy information.

  • PDF

Developing an XML Schema Design Methodology for Object-Relational Database Applications (객체-관계형 데이터베이스 응용을 위한 XML Schema 설계방법론 개발)

  • Choi Mun-Young;Joo Kyung-Soo
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.9
    • /
    • pp.1208-1218
    • /
    • 2004
  • Nowadays the information exchange based on XML such as B2B electronic commerce is spreading. Therefore a systematic and stable management mechanism for storing the exchanged information is needed. For this goal there are many research activities for centering on relational databases the connection between XML application and databases. But when XML data which has hierarchical structure is stored as relational databases which are expressed as relational information, a set of 2-dimensional table, there is a limitation essentially. Accordingly the modeling methodology for storing such structured information in the form of object-relational databases is needed. In order to build good quality application systems, modeling is an important first step. In 1997, the OMG adopted the UML as its standard modeling language. Since industry has warmly embraced UML, its popularity should become more important in the future. So a design methodology based on UML is needed to develop efficient XML applications. In this paper, we propose a unified design methodology for XML applications based on object-relational database using UML. To reach these goals, first we propose a systematic three step methodology to extract UML, second we introduce a XML modeling methodology to design W3C XML schema using UML and third we propose a data modeling methodology for object-relational database schema to store exchanging XML data efficiently.

  • PDF