• Journal of Information Technology Applications and Management
• /
• v.12 no.3
• /
• pp.27-39
• /
• 2005

The Semantic Web has increased the interest in ontologies recently Ontology is an essential component of the semantic web and continues to change and evolve. We consider versions management schemes in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. Our change specification is represented by a set of changes. A set of changes consists of instance data change, structural change, and identifier change. In order to support a query in ontology versions, we consider temporal dimension includes valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the ontology versions management schemes that are 1) storing all the change sets, 2) storing the aggregation of change sets periodically, and 3) storing the aggregation of change sets using an adaptive criterion. We conduct a set of experiments to compare the performance of each versions management schemes. We present the experimental results for evaluating the performance of the three version management schemes from scheme 1 to scheme 3. Scheme 1 has the least storage usage. The average response time in Scheme 1 is extremely large, those of Scheme 3 is smaller than Scheme 2. Scheme 3 shows a good performance relatively.

• Journal of information and communication convergence engineering
• /
• v.2 no.1
• /
• pp.26-31
• /
• 2004

In the last few years, The Semantic Web has increased the interest in ontologies. Ontology is an essential component of the semantic web. Ontologies continue to change and evolve. We consider the management of versions in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. In many cases, we want to be able to search in historical versions, query changes in versions, retrieve versions on the temporal dimension. In order to support an ontology query language that supports temporal operations, we consider temporal dimension includes transaction time and valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the storage policies that are storing all the versions, all the sequence of changed element, all the change sets, the aggregation of change sets periodically, and the aggregation of change sets using a criterion. We conduct a set of experiments to compare the performance of each storage policies. We present the experimental results for evaluating the performance of different storage policies from scheme 1 to scheme 5.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1257-1265
• /
• 2004

In this paper, We describe a change set that is to manage historical information and to maintain ontologies during long term. We propose several storage policies of ontology using a change set. A change set includes a change operation set and temporal dimensions. A change operation set is composed with schema change operations and data change operations. We propose three storage policies that are storing all the change sets and storing the change sets and versions periodically, storing the change sets and the versions using sum of change operations. Also, we present the experimental results for evaluating the performance of different storage policies.

• Journal of Korea Multimedia Society
• /
• v.4 no.6
• /
• pp.543-553
• /
• 2001

In this paper, we proposed management strategy of medical image data in order to solve the problem in traditional medical images migration method. As management strategy of medical image data we proposed EAT(Expanded Average Transaction time) data migration method and data storing method based on temporal interrelation. In EAT data migration strategy, we define the dividing criterion which distinguish entity versions to be stored in each storage and also define entity versions to be stored in each storage. We defined degree of overlap and degree of difference for any two entity versions, and integrated those values and described method which place entity versions to storage. In order to compare the number of cluster references when we change rate of temporal queries, the number of cluster references of proposed method is smaller than that of traditional method.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.1
• /
• pp.27-35
• /
• 2004

Software documents consist of a number of objects and relationships between them, and structure of documents can be changed frequently. In the existing software version management models, changes in one object may be propagated to other objects unnecessarily. In this paper, we propose an efficient version management model for software objects based on history of operations applied to software objects. Operations applied to objects are recorded in the operation history, and those are used to retrieve versions of a document. Because versions of objects are stored and retrieved using the operation delta, it is not required to compare versions of a document to extract delta during check-in process. In addition, it can manage changes of structure of objects efficiently because it supports not only object creation, deletion, and update operation but also object move operation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.363-365
• /
• 2004

Ontology is an essential component of the semantic web and it continue to change and evolve. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and time dimension. Ontology versioning brings about massive amount of versions to be stored and maintained. We present several storage policies and conduct a set of experiments to compare the performance of each storage policies.

• International conference on construction engineering and project management
• /
• 2007.03a
• /
• pp.440-449
• /
• 2007

This paper describes the efforts in developing several versions of bridge management system (BMS) in Taiwan. There were several versions of stand-alone BMS developed in Taiwan prior to the Ji-Ji earthquake that occurred in year 1999. Since many bridges were seriously damaged by this earthquake, the Ministry of Transportation and Communication determined to develop a nationwide BMS to have a better by control on the status of bridge maintenance. Implemented in year 2000, the Taiwan Bridge Management system (T-BMS) is now the dominating and mandatory system used by all the government agencies that are responsible for bridge maintenance. Having more then 25,000 bridges in its inventory, T-BMS has thousands of logins per month to update data in the relevant database. The experiences and difficulties of using such a nationwide bridge management system are discussed. Finally, future plans for BMS development are also proposed in this paper.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.421-421
• /
• 1994

• Journal of Information Technology and Architecture
• /
• v.10 no.3
• /
• pp.295-303
• /
• 2013

This paper presents a new approach to managing dynamic business process changes based on business process change patterns. We identify and categorize business process change patterns that occur recurrently in a dynamic business environment. Several issues regarding management of process versions are discussed, and a pattern-based version management method for handling process changes more flexibly is explained in detail. We propose a mechanism for abstract process execution with runtime encapsulation of a business process, which can maximize the flexibility of process execution using multiple process versions. In addition, we propose a concept of process promotion and demotion that can dynamically choose an actual version of the process at run-time. With our pattern-based process change management and versioning approach, it is expected that the flexibility and efficiency of BPM systems can be enhanced significantly.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.659-669
• /
• 1997

Security as weel as consistency of data is very important issue in databaed security.This the serializability of transactions must be maintained and particularly covert channel not caesed between a high-level transaction and a low- level one.In this paper, we propose a secure transaction management algorithm using synamic version control] method that can slove disk space overhead to maintain multiversion and the problem that reansactions read too old versions when two versions are maintained.Disk space overhead can be sloved by properly cerating versions and synamically maintaining the number of versions and the problem for reading too old version can be solved by having transactions read versions as recent as possible.