• Journal of Internet Computing and Services
• /
• v.15 no.1
• /
• pp.63-71
• /
• 2014

Currently many non-traditional application areas such as artificial intelligence and web databases require advanced modeling power than the existing relational data model. In those application areas, object-oriented database (OODB) is better data model since an OODB can providemodeling power as grouping similar objects into class, and organizing all classes into a hierarchy where a subclass inherits all definitions from its superclasses. The purpose of this paper is to develop an OODB concurrency control scheme dealing with multiple inheritance. The proposed scheme, called Multiple Inheritance Implicit Locking (MIIL), is based on so-called implicit locking. In the proposed scheme, we eliminate redundant locks that are necessary in the existing implicit locking scheme. Intention locks are required as the existing implicit locking scheme. In this paper, it is shown that MIIL has less locking overhead than implicit locking does. We use only OODB inheritance hierarchies, single inheritance and multiple inheritance so that no additional overhead is necessary for reducing locking overhead.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.6
• /
• pp.537-542
• /
• 2002

We propose new metrics for understandability and modifiability of class inheritance structures based on the object-oriented metrics suggested by Chidamber and Kemerer. The metrics are evaluated using the results of Gursaran s experiments which validated the empirical relation of DIT(Depth of Inheritance Tree) and NOC(Number of Children) metrics of Chidamber and Kemerer.

• International Journal of Computer Science & Network Security
• /
• v.21 no.7
• /
• pp.284-296
• /
• 2021

Quality Models are important element of the software industry to develop and implement the best quality product in the market. This type of model provides aid in describing quality measures, which directly enhance the user satisfaction and software quality. In software development, the inheritance technique is an important mechanism used in object-oriented programming that allows the developers to define new classes having all the properties of super class. This technique supports the hierarchy design for classes and makes an "is-a" association among the super and subclasses. This paper describes a standard procedure for validating the inheritance metric in Quality Model for Object-Oriented Design (QMOOD) by using a set of nine properties established by Weyuker. These properties commonly using for investigating the effectiveness of the metric. The integration of two measuring methods (i.e. QMOOD and Weyuker) will provide new way for evaluating the software quality based on the inheritance context. The output of this research shows the extent of satisfaction of the inheritance metric in QMOOD against Weyuker nine properties. Further results proved that Weyker's property number nine could not fulfilled by any inheritance metrics. This research introduces a way for measuring software that developed using object-oriented approach. The theoretical validation of the inheritance metric presented in this paper is a small step taken towards producing quality software and in providing assistance to the software industry.

• Proceedings of the Korean Society for Cognitive Science Conference
• /
• 2000.05a
• /
• pp.226-231
• /
• 2000

객체지향 패러다임의 상속성은 코드 재사용 및 확장을 용이하게 하여 소프트웨어 생산성을 높여준다. 그러나 상속을 남용하여 상속 계층구조(class inheritance hierarchy)의 상속 깊이가 깊게 되면 프로그램을 이해하는데 어려움을 준다. 이러한 관점에서 볼 때 상속성의 이용에 제한을 둘 필요가 있다. 본 논문은 상속 계층구조의 상속 깊이에 대한 기준을 세우기 위하여 인지실험을 행하고 그 결과를 보고한다. 본 논문의 목적은 객체지향의 특성 중 상속성의 장점을 잘 이용하면서 이해하기 쉬운 객체지향 소프트웨어 개발을 돕는 것이다.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.164-172
• /
• 1996

The partitioning of related objects should be performed before clustering for an efficient access in object-oriented databases. In this paper, a horizontal partition of related objects in object-oriented databases is presented. All subclass nodes in a class inheritance hierarchy of a schema graph are shrunk to a class node in the graph that is called condensed schema graph because the aggregation hierarchy has more influence on the partition than the class inheritance hierarchy. A set function and an accessibility function are defined to find a maximal subset of related objects among the set of objects in a class. A set function maps a subset of the domain class objects to a subset of the range class objects. An accessibility function maps a subset of the objects of a class into a subset of the objects of the same class through a composition of set functions. The algorithm derived in this paper is to find the related objects of a condensed schema graph using accessibility functions and set functions. The existence of a maximal subset of the related objects in a class is proved to show the validity of the partition algorithm using the accessibility function.

• Journal of Korea Multimedia Society
• /
• v.15 no.9
• /
• pp.1133-1148
• /
• 2012

This paper presents a hierarchical structuring method for the multidimensional type inheritance indices (MD-TIXs) that support the processing of XML queries in XML databases. MD-TIX uses a multidimensional index structure for efficiently supporting ancestor-descendant explorations that involve both nested element and type inheritance hierarchies. However, In the case of a long Xpath, the building and maintenance of MD-TIX are very difficult because of index entry construction problem. So, we propose a type inheritance index hierarchy method for solving this difficulty. We first construct base indices that support direct relationship explorations between adjacent two types on a given Xpath, and then, based on these base indices, we construct hierarchically the derived indices that support indirect relationship explorations between any two types of Xpath until constructing one target index for supporting the full Xpath. And we also present an algorithm that efficiently constructs a partial index hierarchy for supporting given a set of sub-pathes explorations.

• Journal of the Korean Society for information Management
• /
• v.31 no.2
• /
• pp.41-56
• /
• 2014

The necessity of the raw data management and reuse is issued by diffusion of the recognition that research data is a national asset. In this paper, a metadata design model by schema class inheritance and a metadata integrated search model by schema objects are suggested for a structural management of the data. A data architecture in which an schema object has an 1 : 1 relation to the data collection was designed. A suggested model was testified by creation of a virtual schema class and objects which inherit the schema class. It showed the possibility of implement systematically. A suggested model can be used to manage the data which are produced by government agencies because schema inheritance and integrated search model present way to overcome the weak points of the 'Top-dow Hierarchy model' which is being used to design the metadata schema.

• Journal of KIISE:Software and Applications
• /
• v.28 no.9
• /
• pp.612-628
• /
• 2001

This paper presents a methodology to extract classes and inheritance relations from procedural software. The methodology is based on the idea of generating all groups of class candidates, based on the combinatorial groups of object candidates, and their inheritance with all possible combinations and selecting a group of object candidates, and their inheritance with all possible combinations and selecting a group with the best or optimal combination of candidates with respect to the degree of relativity and similarity between class candidates in the group and classes in a domain model. The methodology has innovative features in class candidates in the group and classes in a domain model. The methodology has innovative features in class and inheritance extraction: a clustering method based on both static (attribute) and dynamic (method) clustering, the combinatorial cases of grouping class candidate cases based on abstraction, a signature similarity measurement for inheritance relations among n class candidates or m classes, two-dimensional similarity measurement for inheritance relations among n class candidates or m classes, two-dimensional similarity measurement, that is, the horizontal measurement for overall group similarity between n class candidates and m classes, and the vertical measurement for specific similarity between a set of classes in a group of class candidates and a set of classes with the same class hierarchy in a domain model, etc. This methodology provides reengineering experts with a comprehensive and integrated environment to select the best or optimal group of class candidates.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.853-860
• /
• 2001

In the object-oriented software development, redesigning of classes and reorganizing of class hierarchy structures should be necessary to reduce many of the headaches of object-oriented software design and maintenance. To support this task, in this paper, we propose a theoretical foundation for class hierarchy reorganizations that is relatively complete, correct, formal and easy to understand and use. We introduce the flattened class hierarchy that characterizes the class hierarchy structures in object-oriented software evolution. And we also present an algorithm which transforms a given class hierarchy into the normalized form. The flattened class hierarchy helps us map the inheritance and aggregation paths in a class hierarchy to paths in an object hierarchy that is an instance of the class hierarchy. By applying the algorithm into a given class hierarchy, we can make a new, object-preserved, and flattened class hierarchy that is the cornerstone for reorganization of class hierarchy structure and plays an important role as a bridge on the incremental evolutionary changes and reuse of object-oriented software to reorganize class hierarchies.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.1
• /
• pp.112-120
• /
• 2003

We propose a graphical object query language called OGPL (Odysseus Graphical Query Language) for Odysseus object databases. By employing simple graphical notations, OGQL provides a user friendly database interface for object databases. OGQL provides a simple graphical notation for advanced features of the object queries such as path expressions including cycles (cyclic queries). Cyclic queries have not been handled in the previous graphical query languages because of their complexity and ambiguity in devising appropriate graphical notations. GOQL also provides a graphical notation for inheritance hierarchy. Since OGQL has been implemented in Java and JDBC standard interface, users can access the remote databases in a web environment and the system has platform-independent architecture.