• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.2845-2862
• /
• 1999

As the technical advances in portable computers and wireless communication technologies, mobile computing environment has been rapidly expanded. The mobile users on mobile host can access information via wireless communication from the distributed heterogeneous multidatabase system in which pre-existing independent local information systems are integrated into one logical system to support mobile applications. Hence, mobile transaction model should include not only the features for heterogeneous multidatabase systems but also the ones for mobile computing environment. In this paper, we proposed a mobile flex transaction model which extends the flexible transaction model that previously proposed for heterogeneous multidatabase systems is extended to support the requirements of mobile heterogeneous multidatabase systems. We also presented the execution control mechanism of the mobile flex transaction model. The proposed mobile flex transaction model allows the definition of location-dependent subtransactions, the effective support of hand-over, and the flexibility of transaction executions. Hence, the proposed mobile flex transaction model can be suit to mobile heterogeneous multidatabase systems that have low power capability, low bandwidth, and high communication failure possibility.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.4
• /
• pp.99-108
• /
• 2009

In the security environments of heterogeneous multidatabase systems, not only the existing local autonomy but also the security autonomy as a new constraint are required. From global aspects, transactions maintain consistent data value when they assure serializability. Also, secure properties must protect these transactions and data values to prevent direct or indirect information effluence. This paper proposes scheduling algorithm for global transactions to ensure multilevel secure one-copy quasi-serializability (MLS/1QSR) in security environments of multidatabase systems with replicated data and proves its correctness. The proposed algorithm does not violate security autonomy and globally guarantees MLS/1QSR without indirect information effluence in multidatabase systems.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.41-48
• /
• 2005

In this thesis, we propose a concurrency control scheme which schedules global transactions in multidatabase systems Unlike other scheme which commit global transactions as soon as they have finished their execution, this scheme has attempted to delay them if their exist another global transactions that should be proceeded. Owing to the deferred commitment, the number of global restarts could be greatly reduced. This scheme's performance gain increased through simulations in case more than one LDBS employ timestamp ordering(TO) as a local concurrency control scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.2889-2899
• /
• 1999

To maintain the traditional notion of global serializability in multidatabase systems has been recognized as one of difficult problems due to the autonomy of participating local database systems. In this paper, we propose a global concurrency control algorithm based on the relaxed concurrency control criterion in distributed MDBs, which can be applied to applications in which the database integration has no effect on the integrity constraints. In the proposed algorithm, the process to determine whether a global transaction can be executed or not consists of intra-validation phase and inter-validation phase.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.775-782
• /
• 2004

Recently, most of global enterprises have geographically distributed organization, thus have distributed information systems which have distributed database systems. So, it is difficult for these systems to provide common views for the application programs of end users. One of solutions to solve these difficulties is an MDBS(Multidatabase System) A method to effectively implement MDBS is a schema integration. This paper proposes a methodology for a schema integration through extraction of common similar subschemas Our methodology is consisted of 5 phases : affinity analysis, extraction of similar subschemas, decision of imtegration order, resolution of semantic conflict, and schema integration. To verify the usability of our methodology, a case study is implemented with an object of MDBS. At a result, our approach can effectively be applied to the extraction of common similar subschemas and schema integration.

• Journal of KIISE:Databases
• /
• v.28 no.2
• /
• pp.188-203
• /
• 2001

멀티데이터베이스 시스템(multidatabase system)에서 여러 요소 데이터베이스(component database)에 대한 통합된 접근을 제공하기 위해서는 의미 이질성(semantic heterogeneity)이 탐색되고 해결되어져야 한다. 즉, 멀티데이터베이스 시스템은 각 요소 데이터베이스가 가지고 있는 정보의 의미를 이해하고 의미적으로 동등한 또는 유사한 정보들을 식별할 수 있어야 한다. 또한, 멀티데이터베이스 시스템은 사용자로 하여금 실세계의 동일한 정보를 가지고 있는 여러 다른 데이터베이스로부터 원하는 정보를 용이하게 획득할 수 있도록 해야 한다. 본 논문에서는, 요소 데이터베이스간의 의미 이질성을 탐색하고 해결하기 위하여 정보가 갖고 있는 개념간 의미관계에 기반한 의미망(semantic network)을 구축한다. 또한 의미질의어(semantic query language)를 제공하여 사용자가 스키마에 대한 사전 지식이 없이도 여로 자율적인 데이터베이스로부터 원하는 정보를 용이하게 획득 할 수 있도록 한다.

• The Journal of Information Technology and Database
• /
• v.4 no.2
• /
• pp.79-95
• /
• 1998

Useful data being distributed over several systems, we have a problem in accessing and utilizing them. Recognizing this problem, researchers have proposed two concepts as solutions to the problem, multidatabase and data warehouse. The one provides a virtual view over the distributed data, and the latter is a materialized view of it. Recently, more attention has been paid to the latter, which is a single of distributed database, collected along a time dimension. So, the major issues in building a data warehouse are 1) how to define a global schema for the data warehouse, 2) how to capture changes from local databases, and 3) how to represent time-varying values of data item. This paper presents an integrated approach to these issues, borrowing the research results from such areas as multidatabase, active databases and temporal databases.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.69-71
• /
• 1998

다중 데이터베이스 시스템에서 전역 트랜잭션을 순차적으로 실행하여도 전역 직렬가능성 보장을 위한 동시성 제어 방법의 개발에서 가장 중요한 고려 요소가 되는 간접충돌은 발생한다. 본 논문에서는, 간접충돌과 전역 직렬가능성의 관계를 분석하여 순차실행은 전역 직렬가능성에 영향을 주지 않음을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5B
• /
• pp.520-530
• /
• 2004

A multidatabase system (MDBS) is designed to provide universal access to distributed data across multiple autonomous, heterogeneous local database systems (LDBSs). In this paper, we propose a global concurrency control (GCC) algorithm in MDBS. The proposed GCC algorithm adopts the idea of message ordering in group communication messaging system. A necessary condition of GCC algorithm is that global transactions are serialized in the same order at all LDBSs that they execute. n all operations of a transaction are bundled in a single message and the message arrives at LDBSs in the same order using message ordering property, each LDBS can perform subtransactions in the same order. As a result, message ordering allows to determine easily the relative serialization order of global transactions, and then it can support a local autonomy without any information about the serialization order of transactions executing locally.

• Journal of KIISE:Software and Applications
• /
• v.26 no.4
• /
• pp.500-507
• /
• 1999

다중 데이터베이스 시스템에서 지역 사이트의 자치성을 유지하면서 전통적인 전역 직렬가능성을 보장하는 일은 지역 트랜잭션에 의한 간접 충돌로 인하여 전역 트랜잭션의 동시 실행 정도의 저하를 초래하게 된다. 본 논문에서는 동시성 정도를 향상시킬수 있도록 전역 직렬가능성 기준을 완화하고 이를 기초로하는 전역 동시성 알고리즘을 제안한다. 제안된 알고리즘은 트랜잭션의 연산 유형을 이용하고 있으므로 특히 읽지 전용 트랜잭션의 경우 동시성 정도의 향상을 기대할 수 있다.