Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartD
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 8D, Issue 6 - Oct 2001
Volume 8D, Issue 5 - Oct 2001
Volume 8D, Issue 4 - Aug 2001
Volume 8D, Issue 3 - Jun 2001
Volume 8D, Issue 2 - Apr 2001
Volume 8D, Issue 1 - Feb 2001
Selecting the target year
Extending SQL CLI for Large Object Caching
The KIPS Transactions:PartD, volume 8D, issue 1, 2001, Pages 1~9
The SQL CLl (Call Level Interface) is a database application programming interface (API) that fits the client-server environment, and its de facto standards such as ODBC and JDBC are widely employed in various applications. The current SQL CLl standards, however, do not specify enough features for efficient retrieval of large objects (LOBs) that constitute the multimedia data. In this paper, we propose the LOB caching through the SQL CLl and describe the extension of the SQL eLl to achieve such a goal. We implement our proposal by extending the SQL CLl library for BADA - II DBMS developed at ETRI, and evaluate the performance of LOB retrieval through the cache compared to that of LOB retrieval conducted solely with the functions specified in the current SQL CLl standards.
Concurrency Control Based on Triggering Relationship for Real-Time Active Database
The KIPS Transactions:PartD, volume 8D, issue 1, 2001, Pages 10~23
Transactions in real-time active databases have the notion of activeness where transactions are generated by external effects and another transaction. In this paper, we propose the multi version concurrency control algorithm for real-time active transactions. A real-time active transaction has a timing constraint in the form of a deadline until which the user wants to complete the transaction, and is characterized by triggering relationships which mean that association between a transaction that triggers the execution of another transaction and the triggered transaction. The triggering relationship is an important factor to resolve data conflicts among real-time active transactions. The proposed concurrency control mechanism resolves data conflicts by considering triggering relationships between conflicting transactions as well as priorities and precedence relationships. The conflict resolution mechanism considers association types of the triggering relationship such as abort and commit dependency, and then resolves data conflicts in favor of higher priority transactions. We also present the experimental results of our algorithm comparing other real-time active concurrency control algorithms.
A Two-way Donation Locking Protocol for Concurrency Control in Multilevel Secure Database
The KIPS Transactions:PartD, volume 8D, issue 1, 2001, Pages 24~31
In this paper, we present an advanced transaction scheduling protocol to improve the degree of concurrency and satisfy the security requirements for multilevel secure database. We adapted two-phase locking protocol, namely traditional syntax-oriented serializability notions, to multilevel secure database. Altruistic locking, as an advanced protocol, has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed for extended altruistic locking OffiLl. This is in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. We also adapted XAL to multilevel secure database and we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature for multilevel secure database. Our protocol is based on extended altruistic locking for multilevel secure database (XAL/MLS), but a new method, namely two-way donation locking for multilevel secure database (2DL!/-MLS), is additionally used in order to satisfy security requirements and concurrency. The efficiency of the proposed protocol was verified by experimental results.
Update Semantic Preserving Object-Oriented View
The KIPS Transactions:PartD, volume 8D, issue 1, 2001, Pages 32~43
Due to the limitation of data modeling power and the view update ambiguity, relational view is limitedly used for engineering applications. On the contrary, object-oriented database view would playa vital role in defining custom interface for engineering applications because the above two limitations of the relational view are overcome by the object-oriented view. Above all, engineering application data interface should fully support updates. More specifically, updates against the data interface needs to be unambiguously defined and its semantic behavior should be equal to base schema updates'. For this purpose, we define the notion of update semantic preserving which means that view updates displays the same semantics as base schema. Besides, in order to show the feasibility of this characteristics, specific and concrete algorithms for update preserving updates are presented for a CAD specialized object-oriented database view - MultiView. This paper finds that in order that virtual classes coudld form a schema with 'isa' relationships rather than just a group of classes, the update semantics on the virtual classes should be defined such that the implied meaning of 'isa' relationships between classes are not to be violated. Besides, as its sufficiency conditions, we derived the update semantics and schema constituable conditions of the virtual classes that make view schemas look like base schemas. To my best knowledge, this is the first research that presents the sufficiency conditions by which we could defined object-oriented views as integrated schemas rather than as separate classes.
Query Language Extension and Implementation of MM Presentation System using SMIL in MMDB
The KIPS Transactions:PartD, volume 8D, issue 1, 2001, Pages 44~53
It is very important how users query MM data and how the query results are presented in MMDB systems. Also, the query results are represented as the generalized form so as to be used in various applications. In this paper, we propose a generalized method for querying and presenting MM data by extending query language based on presentation elements of SMIUSMIL is W3C recommendation for synchronized MM presentation). Our system provides the query results for users as SMIL format in order to be used for various applications.
Software Architecture Restructuring for Reuse
The KIPS Transactions:PartD, volume 8D, issue 1, 2001, Pages 54~61
Software architectures can be restructured by modification and replacement during design processes, and appropriate software architectures for developments can be more than one. Therefore, developers are required to specify efficiently the modification elements of architectures, and manage different versions of an architecture designed for various aspects. In this paper, we propose a mechanism that can restructure legacy architecture and a new software architecture designed with reuse of it in integrated form, and define the specification elements and structure of the proposed architecture restructuring specification. It provides the method that can reference and reuse architectures designed with various aspects of developers in architecture design processes.
Description Techniques for Reusable Components and Interface using Formal Methods
The KIPS Transactions:PartD, volume 8D, issue 1, 2001, Pages 62~70
Correct descriptions for software component functions become a strong requirement in developing critical software especially on the area of real-time applications. In this paper, we introduce both formalization of software design using patterns and verification methods in order for the components to increase their understandability. In particular, the paper investigates into a means of formal description techniques based on VDM++ for the software components, and provides adequacy proof steps for a given functional descriptions.
Complexity Metrics for Analysis Classes in the Unified Software Development Process
The KIPS Transactions:PartD, volume 8D, issue 1, 2001, Pages 71~80
Object-Oriented (OO) methodology to use the concept like encapsulation, inheritance, polymorphism, and message passing demands metrics that are different from structured methodology. There are many studies for OO software metrics such as program complexity or design metrics. But the metrics for the analysis class need to decrease the complexity in the analysis phase so that greatly reduce the effort and the cost of system development. In this paper, we propose new metrics to measure the complexity of analysis classes which draw out in the analysis phase based on Unified Process. By the collaboration complexity, is denoted by CC, we mean the maximum number of the collaborations can be achieved with each of the collaborator and detennine the potential complexity. And the interface complexity, is denoted by IC, shows the difficulty related to understand the interface of collaborators each other. We prove mathematically that the suggested metrics satisfy OO characteristics such as class size and inheritance. And we verify it theoretically for Weyuker' s nine properties. Moreover, we show the computation results for analysis classes of the system which automatically respond to questions of the it's user using the text mining technique. As we compared CC and IC to CBO and WMC, the complexity can be represented by CC and IC more than CBO and WMC. We expect to develop the cost-effective OO software by reviewing the complexity of analysis classes in the first stage of SDLC (Software Development Life Cycle).
Automatic Test Data Generation for Mutation Testing Using Genetic Algorithms
The KIPS Transactions:PartD, volume 8D, issue 1, 2001, Pages 81~86
one key goal of software testing is to generate a 'good' test data set, which is consideres as the most difficult and time-consuming task. This paper discusses how genetic algorithns can be used for automatic generation of test data set for software testing. We employ mutation testing to show the effectiveness of genetic algorithms (GAs) in automatic test data generation. The approach presented in this paper is different from other in that test generation process requireas no lnowledge of implementation details of a program under test. In addition, we have conducted some experiments and compared our approach with random testing which is also regarded as a black-box test generation technique to show its effectiveness.
Construction of Design Pattern Retrieval System using Pattern Information
The KIPS Transactions:PartD, volume 8D, issue 1, 2001, Pages 88~98
in this paper, we imlemented design pattern retrieval system for efficient managemant and reusability of design patterns. Pattern is conssisted of property information and meta information id used for similarity measurement on classification and retrieval of patterns.Meta information od used for UML modeling of patterns. We classified design patterns with the empirical scope in addition to Gamma's basic classification. also we used E-SARM for retrieval represented UML diagram with pattern meta information, and simulated the environment so as to obtain best result on applying to retrieval of design pattern. This system is able ro resister new patterns through pattern viewer and manages these patterns with property informaiton and meta information. Thus this system supports efficient management of patterns, UML modeling, priority pattern retrieval, higher reusability and reduces pattern selection cost.
A Proposal for Component Formal Specification Activities Using Z
The KIPS Transactions:PartD, volume 8D, issue 1, 2001, Pages 99~104
As a plan to counteract solving software crisis, the technology that is called Component Based Software Engineering (CBSE or Componentware) is introsuced. Component Based Software Developement (CBSD) Processes as one of the technique among CBSE have been proposed. Component specification activities among CBSD Processed are necessary and important for generating feusable component. However, the existing CBSD processed can't ensure the correctness in requirements are reflected. In this paper, we propose that formal activities wgich specify component using formal specification language Z which is verified with the ability of analysis and logicality. The proposed activities are composed of 5 tasks and 12 subtasks. By presenting specific 19 products, it is also proposed that component specification activities which are the base of CBSD for reusing. The proposed activities are able to improve qualities of component through correctness and verification of requirements specification of users in the early step of component-based software process.