• Spatial Information Research
• /
• v.18 no.1
• /
• pp.77-87
• /
• 2010

Spatio-temporal join operators are essential to the management of spatio-temporal data such as moving objects. For example, the join operators are parts of processing to analyze movement of objects and search similar patterns of moving objects. Various studies on spatio-temporal join queries in outdoor space have been done. Recently with advance of indoor positioning techniques, location based services are required in indoor space as well as outdoor space. Nevertheless there is no one about processing of spatio-temporal join query in indoor space. In this paper, we introduce continuous spatio-temporal self-join queries in indoor space and propose a method of processing of the join queries over stream data of moving objects. The continuous spatio-temporal self-join query is to update the joined result set satisfying spatio-temporal predicates continuously. We assume that positions of moving objects are represented by symbols such as a room or corridor. This paper proposes a data structure, called Candidate Pairs Buffer, to filter and maintain massive stream data efficiently and we also investigate performance of proposed method in experimental study.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.10
• /
• pp.2224-2229
• /
• 2012

Since sensor data are inserted into a data set continuously, continuous queries should be evaluated for searching data. To processing the continuous queries, it is required to build a query index on each sensor node and to transmit result data appropriate for query predicates. However, if query predicates are transferred to all sensor nodes, massive messages are required. In this paper, we propose the node decision scheme using the sensor node decision tree in order to diminish messages. The entry of a leaf node in the node decision tree represents a sensor node and defines the data region of the sensor node. When a user query is issued, sensor nodes are decided by intersecting between data regions of the tree with the query predicates of the user query, and then the query predicates are transmitted to the selected sensor nodes. We also implement the proposed sensor node decision tree and evaluate the experiments for the tree.

• The Journal of Korean Association of Computer Education
• /
• v.17 no.6
• /
• pp.103-113
• /
• 2014

This study designed and implemented a query model for consecutive analyses of dynamic multivariate graph data. First, the query model consists of two procedures; setting the discriminant function, and determining an alteration method. Second, the query model was implemented as a query system that consists of a query panel, a graph visualization panel, and a property panel. A Node-Link Diagram and the Force-Directed Graph Drawing algorithm were used for the visualization of the graph. The results of the queries are visually presented through the graph visualization panel. Finally, this study used the data of worldwide import & export data of small arms to verify our model. The significance of this research is in the fact that, through the model which is able to conduct consecutive analyses on dynamic graph data, it helps overcome the limitations of previous models which can only perform discrete analysis on dynamic data. This research is expected to contribute to future studies such as online decision making and complex network analysis, that use dynamic graph models.

• Journal of KIISE:Databases
• /
• v.37 no.5
• /
• pp.250-257
• /
• 2010

As the variant of skyline query processing, reverse skyline Queries have been studied. However, the existing methods for processing reverse skyline Queries have the limitation of service domains and spend high costs to provide various location-based services. In this paper, we propose a new reverse skyline Query processing method that efficiently processes a query with the objects in metric spaces. In addition, the proposed method also processes continuous reverse skyline queries efficiently. In order to show the superiority of the proposed scheme, we compare it with the previous reverse skyline 벼ery processing scheme in various environments. As a result, the proposed method achieves better performance than the existing method.

• Journal of KIISE:Databases
• /
• v.28 no.2
• /
• pp.253-265
• /
• 2001

본 논문은 이동 컴퓨팅 환경에서 연속 부분 질의의 효과적인 처리를 위한 캐시 관리 방안을 제안한다. 연속 부분 부합 질의란 질의의 결과가 클라이언트의 메모리에 일관성을 유지하면서 지속되는 부분 부합 질의이다. 기존의 이동 환경을 위한 캐시 관리 기법은 레코드 식별자를 기반으로 하는 방법들이다. 하지만, 부분 부합 질의는 데이터의 내용을 기반으로 탐색하는 질의이기 때문에 이러한 레코드 식별자를 기반으로 하는 방법들은 캐시 관리를 효율적으로 할 수 없다. 제안하는 캐시 관리 방안에서는, 이동 클라이언트의 캐시 상태를 프레디킷(predicate)으로 기술하고, 서버가 캐시 관리를 위해 클라이언트에게 방송하는 캐시 무효화 정보, 즉 Cache Invalidation Reports(CIR)을 프레디킷으로 구성한다. 이러한 프레디킷 표현을 사용하여, 일련의 캐시 관리 기법-억지 방법(the brute-force method), 빼기 방법(the subtraction method), 교차 방법(the intersection method)-들을 제안한다. 그리고, 제안하는 방법의 계산 복잡도를 계산한다.

• Composites Research
• /
• v.19 no.6
• /
• pp.32-37
• /
• 2006

This paper summarizes the processing inorganic continuous fibers from Korean minerals. Continuous filament fibers have been produced from two rocks, basalt and quartz diorite porphyry(QDP), by melting method. The essence of the method is that the vitrified materials was placed into the bushing, platinum/rhodium alloy crucible with a nozzle, and heated electrically to a temperature which allowed fiber spinning. Vitrified basalt without additive was suitable for producing continuous filament fiber. However doping quartz diorite porphyry with boric oxide yielded a material which could be pulled continuously.

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.166-178
• /
• 2007

The ALE specification of EPCglobal is leading the development of RFID standards, includes the Event Cycle Specification (ECSpec) describing how long a cycle is, how to filter RFID tag data and which reader is interested in. The ECSpec is a specification for filtering and collecting RFID tag data. It is registered to a middleware for long time and is evaluated to return results satisfying the requirements included in it. Thus, it is quite similar to the continuous query. It can be transformed into a continuous query as its predicate in WHERE clause is characterized by the long interval. Long intervals cause problems deteriorating insertion and search performance of existing query indices. In this paper, we propose a TLC-index as a new query index structure for long interval data. The TLC-index has hybrid structure that uses the cell construct of CQI-index with the virtual construct of VCR-index for partitioning long intervals. The TLC-index can reduce the storage cost and improve the insertion performance through decomposing long intervals into one or more cell constructs that have long size. It can also improve the search performance through decomposing short intervals into one or more virtual constructs that have short size enough to fit into those intervals.

• The Journal of the Korea Contents Association
• /
• v.12 no.8
• /
• pp.47-58
• /
• 2012

In this paper, we propose a continuous k-nearest neighborhood query processing method for updating the query results in real-time over mobile peer-to-peer environments. The proposed method disseminates a monitoring region to efficiently monitor the k-nearest neighbor peers. The Monitoring Region is created to assure at least k peers as the result of the query within the time range using the vector of neighbor peers. In the propose method, the monitoring region is valid for a long time because it is calculated by the vector of neighbor peers of the query peer. Therefore, the proposed method decreases the cost of re-processing by monitoring region invalidation. In order to show the superiority of the proposed method, we compare it with the previous schemes through performance evaluation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11B
• /
• pp.685-692
• /
• 2007

Recent advances in wireless communications and electronics have enabled the development of low-cost, low-power, multi-functional sensors. A typical wireless sensor network (WSN) consists of a large number of sensor nodes that can measure and process data while communicating through wireless channels. In this paper, we propose a hybrid query processing (HQP) algorithm for user queries submitted to the WSN. Unlike previous algorithms that consider continuous queries only, HQP supports both continuous queries and ad-hoc queries. Specially. HQP tries to reduce energy consumption of ad-hoc queries by using query results cached at each sensor node which are created during the execution of the previous continuous query. HQP can also exploit a trade-off between energy consumption and data accuracy. We evaluate the performance of HQP under a variety of WSN configurations.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.07a
• /
• pp.103-104
• /
• 2016

본 논문에서는 GPS의 보급과 무선 통신의 발달로 급격하게 성장 중인 위치 기반 서비스에 대한 연구를 진행하였다. 위치 기반 서비스를 효율적으로 활용하기 위해서 연속 범위 질의(continuous range query)에 비공간적 특성과 K-최근접 질의를 결합한 안전 영역 할당 기법에 대해서 연구를 진행했다. 기존의 안전 영역은 객체간의 거리만으로 할당을 했지만, 본 논문에서는 객체간의 속성이 다르면 안전 영역을 할당하지 않는 기법을 제안했다. 실험결과 기존의 알고리즘 보다 통신 비용이 감소함을 확인할 수 있었지만 K 값에 따른 오차가 발생함을 확인했고 향후, 연구를 지속할 필요가 있다.