• Digital Contents
• /
• no.5 s.48
• /
• pp.52-56
• /
• 1997

오라클7.3 유니버설 서버는 개방형 환경하에서 기업의 트랜잭션 처리 시스템은 물론 전략적 의사결정을 위한 데이터 웨어하우스, 그리고 인트라넷과 인터넷에 이르는 기업 전반에 걸친 정보관리 솔루션을 제공하는 DBMS 서버이다.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.129-136
• /
• 2007

The domain model pattern which belongs to enterprise architecture patterns has reusability, scalability and maintainability. To use the domain model pattern, mapping with persistency layer, transaction management and various services are needed. This paper proposes that relationship management service to solve a consistency error which arises in case of removing domain objects. The proposed relationship management service monitors methods of domain objects and intercepts the flow of control to solve the reference errors. This service is implemented by using AOP(Aspect-Oriented Programming), so it can provide the service without modifications of domain objects and other services.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.2
• /
• pp.79-92
• /
• 2000

기업환경에서 정보의 무결성은 중요한 보안 요구사항이다 의무분리 정책의 목적은 정보의 무결성을 필요로 하는 연산들을 여러 역할이나 사용자에게 분산시킴으로써 조직 내에서 관리하는 무결성 침해 가능성을 최소화하는 것이며 이것은 상업적 응용분야에서 중요하다. 전통적인 임의적 접근제어와 강제적 접근제어 정책의 대안인 역할 기반의 접근제어 기법은 응용에 따라 보호 객체들에 대한 접근을 역할들로 분류하여 단순한 권한 관리를 제공하며 의무분리 정책을 시행하기에 적합하다. 본 논문에서는 역할 기반의 접근제어에서 기존의 의무분리 안전성 조건의 취약성을 보완하여 응용 프로그램의 실행단위인 클래스에 기반한 개선된 동적 의무분리 기법을 제안하고 상호 배타적인 부트랜잭션들을 포함하고 있는 중첩-트랜잭션을 대상으로 이를 적용한다. 또한 여러 작업들이 동시에 실행되는 환경에서 감염된 트로이언 목마에 의해 발생될수 있는 정보의 유출 문제를 해결하고자 작업간 정보의 비밀성을 보장하는 동적의무분리 모델을 제시한다. 제안한 모델은 기존의 무결성 보장을 위해 제시되었던 Clark-Wilson 모델과 다른 의무분리 모델에 비해 관리가 용이하며, 동적으로 유지 관리되어야 하는 데이터의 양이 적고 객체 접근 확인 절차가 단순하여 구현방법이 용이한 장점이 있다 그리고 기존 의무분리 모델에서 고려되지 않은 병렬 수행 환경에서 작업 사이의 정보 유출 문제를 해결한다.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.69-85
• /
• 2006

Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile clients over a single or multiple channels. Conventional concurrency control protocols for mobile transactions are not suitable for the wireless broadcast environments due to the limited bandwidth of the up-link communication channel. In wireless broadcast environments, the server often broadcast different data items with different frequency to incorporate the data access patterns of mobile transactions. The previously proposed concurrency control protocols for mobile transactions in wireless broadcast environments are focused on the mobile transactions with uniform data access patterns. However, these protocols perform poorly when the data access pattern of update mobile transaction are not uniform but skewed. The update mobile transactions with skewed data access patterns will be frequently aborted and restarted due 4o the update conflict of the same data items with a high access frequency. In this paper, we propose an energy-efficient concurrence control protocol for mobile transactions with skewed data access as well as uniform data access patterns. Our protocol use a random back-off technique to avoid the frequent abort and restart of update mobile transactions. We present in-depth experimental analysis of our method by comparing it with existing concurrency control protocols. Our performance analysis show that it significantly decrease the average response time, the amount of upstream and downstream bandwidth usage over existing protocols.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.230-245
• /
• 2002

Database systems for real-time applications must satisfy timing constraints associated with transactions. Typically, a timing constraint is expressed in the form of a deadline and is represented as a priority to be used by schedulers. Recently, security has become another important issue in many real-time applications. In many systems, sensitive information is shared by multiple users with different levees of security clearance. As more advanced database systems are being used in applications that need to support timeliness while managing sensitive information, there is an urgent need to develop concurrency control protocols in transaction management that satisfy both timing and security requirements. In this paper, we propose two concurrence control protocols that ensure both security and real-time requirements. The proposed protocols are primarily based on multiversion locking. However, in order to satisfy timing constraint and security requirements, a new method, called the FREEZE, is proposed. In addition, we show that our protocols work correctly and they provide a higher degree of concurrency than existing multiversion protocols. We Present several examples to illustrate the behavior of our protocols, along with performance comparisons with other protocols. The simulation results show that the proposed protocols can achieve significant performance improvement.

• Journal of Internet Computing and Services
• /
• v.15 no.4
• /
• pp.125-133
• /
• 2014

The column-oriented database storage is a very advanced model for large-volume data analysis systems because of its superior I/O performance. Traditional data storages exploit row-oriented storage where the attributes of a record are placed contiguously in hard disk for fast write operations. However, for search-mostly datawarehouse systems, column-oriented storage has become a more proper model because of its superior read performance. Recently, solid state drive using MLC flash memory is largely recognized as the preferred storage media for high-speed data analysis systems. The features of non-volatility, low power consumption, and fast access time for read operations are sufficient grounds to support flash memory as major storage components of modern database servers. However, we need to improve traditional transaction management scheme due to the relatively slow characteristics of column compression and flash operation as compared to RAM memory. In this research, we propose a new scheme called Column-aware Multi-Version Locking (CaMVL) scheme for efficient transaction processing. CaMVL improves transaction performance by using compression lock and multi version reads for efficiently handling slow flash write/erase operation in lock management process. We also propose a simulation model to show the performance of CaMVL. Based on the results of the performance evaluation, we conclude that CaMVL scheme outperforms the traditional scheme.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.973-986
• /
• 2004

Reports have a significant meaning In large transaction environments, such as advanced the information technology and online environment. This is due to the necessity of generating reports within a giventime limit without restraining the operation performance of large transaction environments. In order to generate reports in large transaction environments while sa!isfying time-constrained requirements, this paper proposes a model which combines the incremental operation mechanism and materialized view mechanism using triggers and stored procedures. Further, the implementation and evaluation of the proposed model provides the identification of the characteristics of the proposed model.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2783-2796
• /
• 2000

In electronic commerce systems, for the purchase of package goods to be processed in realtime, the stock of their components has to be

• Journal of KIISE:Databases
• /
• v.28 no.1
• /
• pp.42-47
• /
• 2001

실체뷰는 대량의 데이터웨어하우스에서 질의처리를 효과적으로 수행하기위한 대안으로서, 그 핵심은 각 데이터 원천에서의 데이터변화에 대응한 복합적인 뷰의 효과적인 관리 문제이다. 본 연구에서는 우선 실체뷰 관리에 관한 기존의 연구들을 일별함에 있어서 즉, 갱신의 주체문제, 갱신객체, 및 갱신시간 문제의 세가지 관점에서 본 연구의 위치를 결정한 다음, 대수적 접근법으로 복합뷰 갱신문제가 복잡해지는 원인을 규명하였다. 그 해법으로서 참조무결성을 활용한 복합 조인뷰의 갱신 알고리즘을 제안하면서, 여러 가지 참조무결성 제약조건과 트랜잭션과 관련된 자체갱신적 새로운 해법을 제시했다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.5
• /
• pp.533-542
• /
• 1999

웹은 지금까지의 문자 위주의 응용에서 벗어나, 그림, 동영상과 같은 멀티미디어 자료를 브라우저를 통해 접근할 수 있도록 하여, 점차 많은 응용분야에서 사용되고 있다. 최근에 들어서는 데이타베이스와 웹의 연동을 통해, 보다 다양하고, 양질의 웹 서비스를 지원하고자 하는 노력으로, 많은 연구자들이 웹 통로에 대한 많은 연구로 좋은 결과를 내고 있다. 그러나 웹과 데이타베이스의 연동에 있어 필요한 웹 트랜잭션 처리시 발생하는 문제에 있어서는 아직까지 만족할 만한 연구결과가 제시되지 않고 있다.본 논문에서는 웹 통로에서 웹 트랜잭션 처리를 위한 시스템인 WebTP를 제안하고, 이를 구현하였다. WebTP는 워크, 워크-전역변수 등을 도입하여, 웹 응용 단위에서의 저장점 설치와 부분 철회와 트랜잭션 상태 관리 기법을 제공하여, 시스템의 가용성과 안정성을 높이며, 구조적인 웹 응용작성이 가능토록 하여, 복잡한 웹 응용 개발을 돕는다.Abstract Enabling users to access multi-media data like images and motion pictures, in addition to the traditional text-based data, Web becomes a popular platform for various applications. Recently, many researchers have paid a large amount of works on integrating Web and databases to improve the quality of Web services, and have produced many noticeable results on this area. However, no enough research results have been presented on processing Web transactions that are essential in integrating Web and databases.In this paper, we have designed and implemented WebTP, which is a Web transaction processing system for Web gateways to databases. WebTP, by introducing work and work-global-variables, provides a more robust state management, supports application-level savepoints and partial rollbacks. It also nhances productity by providing a modular way to develop Web applications.