• Journal of KIISE:Software and Applications
• /
• v.26 no.6
• /
• pp.735-751
• /
• 1999

클라이언트-서버 DBMS에 대한 기존의 연구는 클라이언트 데이터 캐슁이 캐쉬 일관성 유지에 드는 오버헤드에도 불구하고 시스템의 성능향상에 유용함을 보여주었다 본 논문에서는 시간적 제약을 가지는 실시간 트랜잭션을 처리하는데 있어서도 클라이언트 데이터 캐슁이 실시간 트랜잭션의 마감시간 충족률을 높이는데 유용하다는 것을 보였다. 기존실시간 데이터베이스 시스템에서 동시성 제어 기법과 실시간 트랜잭션 스케쥴링 기법을 통합한 것처럼 , 캐쉬 일관성 유지 및 동시성 제어 기법과 실시간 트랜잭션 스케쥴링 기법을 통합한 낙관적 알고리즘을 제시하고 클라이너트 데이터 캐슁을 지원하지 않는 경우와 그 성능을 비교하였다. 성능 평가 결과데이타의 지역성이 낮은 작업부하에서는 , 클라이언트 캐쉬의 이용으로 인해 마감시간을 어긴 실시간 트랜잭션의 비율 감소가 크지 않았지만(10%이하), 데이터의 지역성이 높은 작업부하에서는 그 감소폭이 컸다. HOTCOLD 작업부하의 경우 클라이언트의 수가 50, 트랜잭션의 데이터 변경률이 20% 일 때 마감시간을 어긴 실시간 트랜잭션의 비율이 약 47%감소하였다.

• Journal of Internet Computing and Services
• /
• v.11 no.2
• /
• pp.31-40
• /
• 2010

In this paper, we propose a service component based on active model for supporting a variety of u-healthcare application services. It implemented that component as a classification of function for developing healthcare application services. Especially we focus on the adaptive information service in integrated environment using a distributed object technologies of the various healthcare home service based on distributed object group framework. And we shows the service component applying to Healthcare application services such as healthcare home monitoring, mobile monitoring and web based monitoring. Also, we show the performance evaluation results such as response time, system load and network load.

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

As the areas of computer application are expanded, the real-time applicition enviroments that must process as many transactions as possible within their deadlines have been increased recently. Conventional disk based databaes system is not appropriate in real-time transaction processing due to delying time for disk I/O processing. When the system is overloaede, the performance of transaction scheduling technique using earliest deadline first deteriorates rapidly because it can assign the highest priority ot a transaction that has already missed or is about to miss tis deadline. Therfore, the performance of suggested transaction secheduling technique is made to improved by propos-ing the doule locking mechanism based on priority. Finally, in order to evaluate the performance of the proposed priority-based double locking techniques under single proessor and main memory database system environments, the simulation model was developed using the SLAM II language.

• Spatial Information Research
• /
• v.20 no.3
• /
• pp.67-81
• /
• 2012

Due to the recent advancement of cloud computing, the research on database outsourcing has been actively done. Moreover, the number of users who utilize Location-based Services(LBS) has been increasing with the development in w ireless communication technology and mobile devices. Therefore, LBS providers attempt to outsource their spatial database to service provider, in order to reduce costs for data storage and management. However, because unauthorized access to sensitive data is possible in spatial database outsourcing, it is necessary to study on the preservation of a user's privacy. Thus, we, in this paper, propose a spatial data encryption scheme to produce outsourced database from an original database. We also propose a k-Nearest Neighbor(k-NN) query processing algorithm that efficiently performs k-NN by using the outsourced database. Finally, we show from performance analysis that our algorithm outperforms the existing one.

• Journal of Environmental Policy
• /
• v.13 no.4
• /
• pp.51-78
• /
• 2014

Unlike traditional environmental problems, current environmental problems occur due to by complex reasons. These complexities highlight the importance of precise spatial based analysis and expeditive use of environmental information when an environmental problem arises. However, the traditional environmental information has many problems because they are mainly numerical based and scattered in various systems. To overcome these problems, providing integrated environmental spatial information is important. Thus, a research was conducted on establishing national environment atlas system and its implications for policies. Firstly, this study selects 275 out of 2,701 materials and information from Ministry of Environment and related organizations. Secondly, total 64 thematic maps specific business support are Produced to support establishment and implementation of environmental policies. In addition, the produced thematic maps are privatized. Thirdly, the study analyzes total 17 systems and environmental thematic maps of Ministry of Environment and relevant organizations to connect the information on the business support thematic maps. As a result, 1,314 applicable spatial information and 39,331 applicable database based on spatial information based are selected, and a standardization plan is established. Fourthly, the study suggests a stepwise implementation plan for developing a national environment atlas system. The development of national environment atlas system will help establishing an environmental policy based on more relevant and accurale information.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.484-493
• /
• 2001

As real-time database systems are extended to the distributed computing environment, the need to apply the existing real-time concurrency control schemes to the distributed computing environment has been made. In this paper we propose an efficient concurrency control scheme for distributed real-time database system. Our proposed scheme guarantees a transaction to commit at its maximum, reduces the restart of a transaction that is on the prepared commit phase, and minimizes the time of the lock holding. This is because it raises the priority of the transaction that is on the prepared commit phase in the distributed real-time computing environment. In addition, it reduces the waiting time of a transaction that owns borrowed data and improves the performance of the system, as a result of lending the data that the transaction with the raised priority holds. We compare the proposed scheme with DO2PL_PA(Distributed Optimistic Two-Phase Locking) and MIRROR(Managing Isolation in Replicated Real-time Object Repositories) protocol in terms of the arrival rate of transactions, the size of transactions, the write probability of transactions, and the replication degree of data in a firm-deadline real-time database system based on two-phase commit protocol. It is shown through the performance evaluation that our scheme outperforms the existing schemes.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.165-178
• /
• 2005

A product classification scheme is the foundation on which product databases are designed, and plays a central role in almost all aspects of management and use of product information. It needs to meet diverse user views to support efficient and convenient use of product information. It needs to be changed and evolved very often without breaking consistency in the cases of introduction of new products, extinction of existing products, class reorganization, and class specialization. It also needs to be merged and mapped with other classification schemes without information loss when B2B transactions occur. For these requirements, a classification scheme should be so dynamic that it takes in them within right time and cost. The existing classification schemes widely used today such as UNSPSC and eCl@ss, however, have a lot of limitations to meet these requirements for dynamic features of classification. Product information implies a plenty of semantics such as class attributes like material, time, place, etc., and integrity constraints. In this Paper, we analyze the dynamic features of product databases and the limitation of existing code based classification schemes, and describe the semantic classification model proposed in [1], which satisfies the requirements for dynamic features of product databases. It provides a means to explicitly and formally express more semantics for product classes and organizes class relationships into a graph.

• Proceedings of the KSRS Conference
• /
• 2001.03a
• /
• pp.49-55
• /
• 2001

본 연구에서는 GIS를 이용하여 산불관련 데이터베이스를 구축하고 효과적인 산불 현황정보 검색시스템을 개발하녀 산불 관리자에게 효율적인 공간분석 도구를 제공함으로서 산불에 관한 종합적인 공간정보를 빠른 시간 내에 분석하여 속성을 갱신·추출 할 수 있도록 하는 효과적인 GUI(Graphic User Interface)를 개발하였다. 이를 위하여 최근 10년간의 산불현황 통계자료를 이용한 전국 시·군단위의 공간분포도를 작성하여 전국 산불 발생현황을 시·공간적으로 분석하고 산불 발생에 미치는 다양한 요인들과의 상관성을 분석 가능하였다. 특히 최근 산불발생이 빈번한 삼척시의 지형도 및 임상도, 위성영상, 현지사진을 이용하여 GIS 데이터베이스를 구축함으로서 산불 발생위험지역에 대한 보다 상세한 정보를 얻을 수 있다. 본 시스템은 응용프로그램 개발을 위한 플랫폼은 IBM호환 PC에서 Windows 98을 운영체 제로 하여 DBMS는 Access 2000을 이용하였고 프로그래밍 언어로는 객체지향언어인 Visual Basic 6.0과 GIS 기능을 구현하기 위해서 Component GIS인 MapObjects 2.0을 사용 하였다. 그 결과 산불관리자는 진화에 필요한 관리구역내의 정보를 신속하게 제공받을 뿐만 아니라 산불방제사업에 대한 효과적인 의사결정지원과 함께 실무자 중심의 산불관리행정을 도모하 고 산림자원관리비가 효율적으로 이용될 것이다.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.59-75
• /
• 2006

One of the most challenging and encouraging applications of state-of-the-art technology is the field of traffic control systems. It combines techniques from the areas of telecommunications and computer science to establish traffic information and various assistance services. The support of the system requires a moving objects database system (MODB) that stores moving objects efficiently and performs spatial or temporal queries with time conditions. In this paper, we propose schemes to distribute an index nodes of trajectory based on spatio-temporal proximity and the characteristics of moving objects. The scheme predicts the extendible MBB of nodes of index through the prediction of moving object, and creates a parallel trajectory index. The experimental evaluation shows that the proposed schemes give us the performance improvement by 15%. This result makes an improvement of performance by 50% per one disk.

• Spatial Information Research
• /
• v.19 no.2
• /
• pp.57-64
• /
• 2011

This paper describes how to storing and querying trajectory information on PostgreSQL/PostGIS. Recently as technology of mobile devices is advancing, many researches for location-based services and moving object's trajectory have been studied. Trajectory is the set of information of the location by the time, and is one of the most im portant information for location-based services. Traditional spatial database systems do not support trajectory data types and functions. In this paper, we propose a trajectory data type and query functions for moving objects on PostgreSQL/PostGIS.