• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.585-594
• /
• 2008

The issues that we should consider in the process of providing mobile web service using a mobile device are seamless service and QoS-guaranteed service. HMIPv6 has MAP because of improving packet loss and transmission delay due to disconnection. However, a load is concentrated on HMIPv6 because of receiving and delivering packet for MN. Owing to this, real time data fails to be processed quickly, and also adaptive mobile service is required for QoS guaranteed service. However, this method demands the response time cost of contents service owing to the hardware differences of various devices. Therefore, we improve the process performance of real time data by applying a queue in MAP for seamless service in this paper. For decreasing response time cost, we propose mobile web service method which has reusable cache of contents using the elements of contents. The result of a numerical formula and simulation shows that our proposed method is superior under various system conditions.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1067-1076
• /
• 2003

Database sharing system (DSS) refers to a system for high performance transaction processing. In DSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. In this paper, we propose a dynamic transaction routing algorithm to balance the load of each node in the DSS. The proposed algorithm is novel in the sense that it can support node-specific locality of reference by utilizing the primary copy authority assigned to each node; hence, it can achieve better cache hit ratios and thus fewer disk I/Os. Furthermore, the proposed algorithm avoids a specific node being overloaded by considering the current workload of each node. To evaluate the performance of the proposed algorithm, we develop a simulation model of the DSS, and then analyze the simulation results. The results show that the proposed algorithm outperforms the existing algorithms in the transaction processing rate. Especially the proposed algorithm shows better performance when the number of concurrently executed transactions is high and the data page access patterns of the transactions are not equally distributed.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.44-57
• /
• 2002

Multiple spatial queries are defined as two or more spatial range queries to be executed at the same time. The primary processing of internet-based map services is to simultaneously execute multiple spatial queries. To improve the throughput of multiple queries, the time of disk I/O in processing spatial queries significantly should be reduced. The declustering scheme of a spatial dataset of the MIMD architecture cannot decrease the disk I/O time because of random seeks for processing multiple queries. This thesis presents query scheduling strategies to ease the problem of inter-query random seeks. Query scheduling is achieved by dynamically re-ordering the priority of the queued spatial queries. The re-ordering of multiple queries is based on the inter-query spatial relationship and the latency of query processing. The performance test shows that the time of multiple query processing with query scheduling can be significantly reduced by easing inter-query random seeks as a consequence of enhanced hit ratio of disk cache.