• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.3
• /
• pp.248-253
• /
• 2008

This paper presents a sensing system for smart home which can detect an location transition events such as entrance/exit of a member and identify the user in a group at the same time. The proposed system is compose of two sub-systems; a wireless sensor network system and a database server system. The wireless sensing system is designed as a star network where each of sensing modules with ultrasonic sensors and a Bluetooth RF module connect to a central receiver called Bluetooth access point. We propose a method to discriminate a user by measuring the height of the user. The differences in the height of users is a key feature for discrimination. At the same time, the each sensing module can recognize whether the user goes into or out a room by using two ultrasonic sensors. The server subsystem is a sort of data logging system which read the detected event from the access point and then write it into a database system. The database system could provide the location transition information to wide range of context-aware applications for smart home easily and conveniently. We evaluate the developed method with experiments for three subjects in a family with the installation of the developed system into a real house.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.13 no.1
• /
• pp.157-165
• /
• 2002

The purpose of this study is to achieve two goals. One is to construct knowledge database which could read and analyse electronic documents in place of researchers for the purpose of improvement of research productivity, and the other is to develop automated patent application engine which is connected to the knowledge database. This study discusses the possibilities and appropriateness of two systems mentioned earlier, and provides elements necessary to system developments and technical problems through model development.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.317-323
• /
• 2005

Broadcast disks are suited for disseminating information to a large number of clients in mobile computing environments. In broadcast disks, the server continuously and repeatedly broadcasts all data items in the database to clients without specific requests. The clients monitor the broadcast channel and retrieve data items as they arrive on the broadcast channel. The broadcast channel then becomes a disk from which clients can retrieve data items. This paper proposes a Timestamp based Concurrency Control (TCC) scheme to preserve the consistency of read-only client transactions, when the values of broadcast data items are updated at the server. Previous schemes tried to reduce transaction aborts by consuming considerable amount of downlink communication from the server to clients for transferring control information. On the other hand, the TCC uses a timestamp field of each data item to describe execution order of server transactions. Clients can allow more transaction executions by checking consistency of their read-only transactions with timestamps of data items. As a result, the TCC can reduce the abort ratio of client transactions with minimal control information to be broadcast from the server.

• Journal of Korea Spatial Information System Society
• /
• v.5 no.2 s.10
• /
• pp.69-82
• /
• 2003

Mobile transactions updating spatial objects are long transactions that update local objects of mobile clients during disconnection. Since a recovered transaction cannot read the write sets of other transactions committed before the recovery due to disconnection, the recovered transaction may conflicts with them. However, aborting of the recovered long transaction leads to the cancellation of all updates including the recovered updates. It is definitely unsuitable to cancel the recovered updates due to the conflicts. In this paper, we propose the recovery scheme to retrieve foreign conflictive objects from the write sets of other transactions for reducing aborting of a recovered transaction. The foreign conflictive objects are part of the data committed by other transactions and may conflict with the objects updated by the recovered transaction. In the scheme, since the recovered transaction can read both the foreign conflictive objects and the recently checkpoint read set, it is possible to reupdate properly the potentially conflicted objects.

• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.374-385
• /
• 2009

Flash memory becomes increasingly popular as data storage for various devices because of its versatile features such as non-volatility, light weight, low power consumption, and shock resistance. Flash memory, however, has some distinct characteristics that make today's disk-based database technology unsuitable, such as no in-place update and the asymmetric speed of read and write operations. As a result, most traditional disk-based database systems may not provide the best attainable performance on flash memory. To maximize the database performance on flash memory, some approaches have been proposed where only the changes made to the database, i.e., logs, are written to another empty place that has born erased in advance. In this paper, we propose an efficient log management scheme for flash-based database systems. Unlike the previous approaches, the proposed approach stores logs in specially allocated blocks, called log blocks. By evenly distributing logs across log blocks, the proposed approach can significantly reduce the number of write and erase operations. Our performance evaluation shows that the proposed approaches can improve the overall system performance by reducing the number of write and erase operation compared to the previous ones.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.209-224
• /
• 2003

Recent development of electronic commerce enables the use of Electronic Stock Trading Systems(ESTS) to be expanded. In ESTS, information with various sensitivity levels is shared by multiple users with mutually different clearance levels. Therefore, it is necessary to use Multilevel Secure Database Management Systems(MLS/DBMSs) in controlling concurrent execution among multiple transactions. In ESTS, not only analytical OLAP transactions, but also mission critical OLTP transactions are executed concurrently, which causes it difficult to adapt traditional secure transaction management schemes to ESTS environments. In this paper, we propose Secure One Snapshot(SOS) protocol that is devised for Secure Transaction Management in ESTS. By maintaining additional one snapshot as well as working database SOS blocks covert-channel efficiently, enables various real-time transaction management schemes to be adapted with ease, and reduces the length of waiting queue being managed to maintain freshness of data by utilizing the characteristics of less strict correctness criteria. In this paper, we introduce the process of SOS protocol with some examples, and then analyze correctness of devised protocol.

• The KIPS Transactions:PartD
• /
• v.16D no.6
• /
• pp.835-844
• /
• 2009

Today, most of all the query processors in the world generally use the 'Pipelining' method to acquire fast response time (first record latency) and less memory usage. Each of the operator nodes in the Query Execution Plan (QEP) provides Open(), Next(), and Close() functions for their interface to facilitate the iterator mechanism. However, the embedded database systems for the mobile devices, based on the FLASH memory, usually require a function like Previous(), which returns the previous records from current position. It is because that, in the embedded environment, the mobile devices cannot fully provide it main memory to store all the query results. So, whenever needed the previously read records the user (program) should re-fetch the previous records using the Previous() function: the BACKWARD data fetch. In this paper, I introduce the 'Direction Switching Problem' caused by the Previous() function and suggest 'Block-wise Skipping' method to fully utilize the benefits of the block-based data transfer mechanism, which is widely accepted by most of the today's relational database management systems.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1655-1673
• /
• 2018

Mobile computing environment is subject to the constraints of bounded network bandwidth, frequently encountered disconnections, insufficient battery power, and system asymmetry. To meet these constraints and to gain high scalability, data broadcasting has been proposed on data transmission techniques. However, updates made to the database in any broadcast cycle are deferred to the next cycle in order to appear to mobile clients with lower data currency. The main goal of this paper is to enhance the transaction performance processing and database currency. The main approach involves decomposing the main broadcast cycle into a number of sub-cycles, where data items are broadcasted as they were originally sequenced in the main cycle while appearing in the most current versions. A concurrency control method AOCCRBSC is proposed to cope well with the cycle decomposition. The proposed method exploits predeclaration and adapts the AOCCRB method by customizing prefetching, back-off, and partial backward and forward validation techniques. As a result, more than one of the conflicting transactions is allowed to commit at the server in the same broadcast cycle which empowers the processing of both update and read-only transactions and improves data currency.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.571-574
• /
• 2003

This research is aimed to automate the generating process of the database from paper based table forms like this work. The registration table has so complicate table structures, ana in this research we used the registration tables as an example of general table structure understanding. We propose a table structure understanding system for some table types, and it has some steps. The first step is that the document images on paper are read from the image scanner. The second step is that a document image segments into some tables. In the third step, the character strings is extracted using image processing technology and the property of the character strings is determined. And the structured database is generated automatically. The proposed system consists of two systems. "Master document generation system" is used for the table form definition, and it doesn′t include the handwritten characters. "Structure analysis system for complete d table" is used for the written form, and it analyzes the table form filled in the handwritten character. We implemented the system using MS Visual C＋＋ on Windows, and it can get the correct extraction rate 98％ among 51 registration tables written by the different students.