• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.163-166
• /
• 2005

The latest wireless communications technology bring about the rapid developments of Global Position System and Location-Based Service. It is very important for the moving object database to deal with database queries related to the trajectories of a moving objects and the valid time of the query results as well. In this paper, we propose how to get not only the current result of query but also the valid time and the result after the time when a query point and objects are moving at the same time. We would like to predict the valid time by formula because the current results will be incorrect due to the characteristic of the continuous movements of the moving objects and the future results can not be calculated by iterative computations.

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.171-175
• /
• 2010

This paper analyzes the tag data inconsistency problem caused by incomplete execution of the tag access operation to the RFID tag's memory and proposes a protocol to control consistent tag data accesses with finalizing the incomplete operation. Passive RFID tag cannot guarantee complete execution of the tag access operations because of uncertainty and unexpected disconnection of RF communications. This leads to the tag data inconsistency problem. To handle this, we propose a concurrency control protocol which defines incomplete tag operations as continuous queries and monitors the tags're-observation continuously. The protocol finalizes the incomplete operation when the tag is re-observed while it blocks inconsistent data accesses from other operations. We justify the proposed protocol by analyzing the completeness and consistency. The experiments show that the protocol shows better performance than the traditional lock-based concurrency control protocol.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.4
• /
• pp.289-293
• /
• 2009

In sensor networks, many methods have been proposed to process in-network aggregation effectively. Contrary to normal aggregation queries, skyline query processing that compare multi-dimension data for producing result is very hard. It is important to filter unnecessary data for energy-efficient skyline query processing. Existing approach like MFTAC restricts unnecessary data transitions by deploying filters to whole sensors. However, network lifetime is reduced by energy consumption for filters transmission. In this paper, we propose a lazy filtering-based skyline query processing algorithm of in-network for reducing energy consumption by filters transmission. The proposed algorithm creates the skyline filter table (SFT) in the data gathering process which sends from sensor nodes to the base station and filters out unnecessary transmissions using it. The experimental results show that the proposed algorithm reduces false positive by 53% and improves network lifetime by 44% on average over MFTAC.

• Journal of KIISE:Databases
• /
• v.37 no.1
• /
• pp.1-11
• /
• 2010

Recently, there has been a growing interest in the processing of continuous queries over multiple data streams. When the arrival rates of tuples exceed the memory capacity of the system, a load shedding technique is used to avoid the system becoming overloaded by dropping some subset of input tuples. In this paper, we propose an effective load shedding algorithm for multi-way windowed joins over multiple data streams. Most previous load shedding algorithms estimate the productivity of each tuple, i.e., the number of join output tuples produced by the tuple, based on its "join attribute value" and drop tuples with the lowest productivity. However, the productivity of a tuple cannot be accurately estimated from its join attribute value when the join attribute values are unique and do not repeat, or the distribution of the join attribute values changes over time. For these cases, we estimate the productivity of a tuple based on its "arrival order" on data streams, rather than its join attribute value. The proposed method can effectively estimate the productivity of a tuple even when the productivity of a tuple cannot be accurately estimated from its join attribute value. Through extensive experiments and analysis, we show that our proposed method outperforms the previous methods in terms of effectiveness and efficiency.

• Spatial Information Research
• /
• v.21 no.4
• /
• pp.83-89
• /
• 2013

Recently various contents have been produced using the techniques that require high-performance computing process. A lot of services have been being producted as AR(Augmented Reality) service being combined with mobile information service that a moving user search various information based on one's location with. Mobile information service has a characteristic that it needs to get new information according to the location an user moves to. The characteristic requires a lot of communications when user search information moving to a different location. In order to make up for this drawback, we propose a prefetching technique based on speed and viewing angle in this paper. Existing prefetching techniques retrieve the following location of users considering moving speed and direction of the users. The data showed on the screen in AR is limited by the viewing angle of the mobile device. Due to the problems we discussed above, existing prefetching techniques have a demerit that they retrieve a lot more data than needed actually. We propose more efficient way of retrieving data with AR using the viewing angle of the mobile device. The method we propose reduces retrieval of unnecessary location using the users' speed, direction and viewing angle. This method is more efficient than the existing ways of retrieval because we don't need as many data.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.425-438
• /
• 1999

In recent days network computing technologies have bee developed rapidly and the extended use of Internet applications for enterprises such as internet/extarnet in and between enterprises has been increased enormously. Therefore the business in the future will be executed by virtual enterprise. Virtual enterprises which is based on information sharing between enterprises are composed of work processes related to information exchange between virtual enterprises, the team members who are representatives of the organizations that are participated in the actual business of virtual enterprises, and members who are representatives of the organizations that are participated in the actual business of virtual enterprises, and environment that are provided by supporting CALS(continuous Acquisition and Life cycle Support or commerce At light Speed). Supporting system of IDE(Integrated Data Environment)for CALS implementation that is provided as an environment of virtual enterprises has to ensure the autonomies of local data and to provide the accessibility of heterogeneous database of enterprises on network transparently for giving user a single global view of data. This paper introduce the design and implementation of the database broker system that can be accessed data transparently by the suers of participated enterprises in the integrated data environment supporting virtual enterprises. The system uses java/CORBA technology in Web environment and Object Query language (OQL) to process the queries of relational database system, object-oriented database system, and file information.