• 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.

• Journal of Intelligence and Information Systems
• /
• v.9 no.1
• /
• pp.251-267
• /
• 2003

In order to satisfy the needs of an intelligent information system, it is necessary to have more intelligent query processing in an object-oriented database. In this paper, we present a method to apply intelligent query processing in object-oriented databases using deductive approach. Using this method, we generate intelligent answers to represent the answer-set abstractly for a given query in object-oriented databases. Our approach consists of few stages: rule representation, rule reformation pre-resolution, and resolution. In rule representation, a set of deductive rules is generated based on an object-oriented database schema. In rule reformation, we eliminate the recursion in rules. In pre-resolution, rule transformation is done to get unique intensional literals. In resolution, we use SLD-resolution to generate intensional answers.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.170-176
• /
• 1999

This paper addresses the design of object distribution in distributed object-oriented databases. The proposed strategy of object distribution consists of two-step design of fragments. One step is class fragmentation and the other is allocation of fragments. We define partitioning algorithms to reflect the characteristics of object-oriented databases in the class fragmentation and define expressions to reduce the amount of data transfer by allocating fragments of other classes referred together to one site in the allocation of fragments

• The KIPS Transactions:PartB
• /
• v.11B no.5
• /
• pp.611-618
• /
• 2004

This paper addresses the design and implementation of class distribution in distributed object-oriented databases. The proposed strategy of distribution consists of two-step design of fragments. One is class fragmentation and the other is allocation of fragments. In step of class fragmentation, we have defined partitioning algorithms to reflect the characteristics of object-oriented databases such as method, inheritance and composite-object. In step of allocation, we have defined the objective function for allocation considering system operating cost including storage, query processing and communication and implemented it using Genetic Algorithm.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.1-10
• /
• 1995

A graphic user interface for effectively browsing object-oriented databases in complex applications is designed and implemented. The rationale behind our design lies in enabling the users of various levels and needs to investigate the database according to their respective interests and desired depths. A novel idea in our design is the introduction of zooming techniques from a logical view, which vidualize the backbone abstraction concepts of the object-oriented data model. These objectives are verified by evaluating the results of its implementation.

• Proceedings of the Korea Database Society Conference
• /
• 1997.10a
• /
• pp.483-503
• /
• 1997

One important question that arises when dealing with temporal databases in context of object-oriented systems is the method that associates time with attributes relationship semantics. Results of previous work about attribute versioning, particularity extending flat(First Normal Form: FNF) or nested(Non-First Normal Form: NFNF) relational models. are not applicable to temporal object-oriented databases. This is because object-oriented models provide more powerful constructs than traditional models for structuring complex objects. Therefore, this paper presents an formal approach for incorporating temporal extension to object-oriented databases. Our goal in this paper is to study temporal object-oriented database representation according to generalization, aggregation and association among objects. We define tile concepts of attribute versioning in temporal object-oriented model, and we concentrate on the representation of temporal relationship among objects. Another contribution of this paper is to specify time constraints on relationship semantics and analyze our model based on representation criteria. By means of formalizing tile temporal object oriented model, this paper can not only provide tile robust operating functions that design algebraic operators, but also entrance the reuse of modules.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.11-23
• /
• 1998

In very large databases, the problem of searching for interesting information effectively is very important in terms of efficiency and flexibility. A multiple layered database approach based on AOG(attribute-oriented generalization) method is one of the useful approaches for knowledge discovery under various situations. In this paper, we propose a multiple layered database design methodology based on AOG method in object-oriented databases. In addition, we propose a dynamic schema evolution model and implementation strategy in order to continue providing information effectively in multiple layered databases.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.11-20
• /
• 1993

In the new database applications such as office information systems, CAD/CAM, and AI, it is required to support not only fixed Is-A and Part-Of relationships but also various user-defined dynamic relationships including complicate constraints. However, existing object-oriented systems have many weaknesses in managing those complex relationships. This paper presents the Object-Oriented Relationship data Model (OORM) which is designed to provide facilities for modeling complex relationships into object oriented databases using abstraction concept. In the model, various integrity and consistency constraints related to the relationships can be also represented. And this paper presents a query language, ORSQL(Object Relationship SQL). ORSQL is a nonprocedural query language having similiar syntax to the standard SQL and supporting OORM's operations.

• The Journal of Korean Association of Computer Education
• /
• v.10 no.2
• /
• pp.101-113
• /
• 2007

In this paper, we present an object-based modeling and language for an object-oriented spatio-temporal database system. For handling the structure of spatio-temporal objects and the spatio-temporal operators, we propose the two layers of data modeling: a spatio-temporal object model (STOM) and an spatio_temporal internal description model (STIM). We then propose STOQL, a spatio-temporal object-oriented query language. STOQL provides an integrated mechanism for the graphical display of spatial objects and the retrieval of spatio-temporal and aspatial objects.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.215-224
• /
• 1997

This paper addresses the vertical class fragmentation in distributed object-oriented databases. In the proposed vertical fragmentation, after producing the attribute fragment by partitioning attributes, then the method fragment is produced by gathering methods referring the attribute in each fragment. For partitioning attributes, we define query access matrix(QAM) and method access matrix(MAM) to express attributes that method refers, and extend QAM, MAM and attribute usage matrix(AUM) to universal class environment for representing relationship among other classes through class hierarchy and class composite hierarchy.