• Proceedings of the Korea Contents Association Conference
• /
• 2019.05a
• /
• pp.11-12
• /
• 2019

IoT 및 SNS의 발달로 인해 관계를 표현하는 그래프 모델링 기법이 활용되고 있다. 실시간 스트림 그래프에서 유사한 모형의 그래프를 탐색하기 위한 근사 Top-k 서브 그래프 매칭에 대한 요구가 증가하고 있다. 본 논문에서는 그래프 스트림에서 간선의 유형 및 구조적 차이를 고려한 효율적인 근사 Top-k 서브 그래프 매칭 기법을 제안한다. 임계값 기반의 필터링과 스트림 환경에 맞는 연속 서브 그래프 매칭 구조를 제안함으로써 그래프 스트림에 적합한 질의 처리를 수행한다.

• Spatial Information Research
• /
• v.21 no.2
• /
• pp.23-33
• /
• 2013

W ith the recent advancement of IoT (Internet of Things) technology, there has been much interest in the spatial query processing which energy-efficiently acquires sensor readings from sensor nodes inside specified geographical area of interests. Therefore, various kinds of spatial query processing algorithms and distributed spatial indexing methods have been proposed. They can minimize energy consumption of sensor nodes by reducing wireless communication among them using in-network spatial filtering technology. However, they cannot optimize multiple spatial queries which w ill be w idely used in IoT, because most of them have focused on a single spatial query optimization. Therefore, we propose a new multiple spatial query optimization algorithm which can energy-efficiently process multiple spatial queries in a sensor network. The algorithm uses a concept of 'query merging' that performs the merged set after merging multiple spatial queries located at adjacent area. Here, our algorithm makes a decision on which is better between the merged and the separate execution of queries. For such the decision making, we additionally propose the cost estimation method on the spatial query execution. Finally, we analyze and clarify our algorithm's distinguished features using the spatial indexing methods of GR-tree, SPIX, CPS.

• Journal of KIISE
• /
• v.43 no.12
• /
• pp.1437-1457
• /
• 2016

In outsourced databases, the cloud provides an authorized user with querying services on the outsourced database. However, sensitive data, such as financial or medical records, should be encrypted before being outsourced to the cloud. Meanwhile, k-Nearest Neighbor (kNN) query is the typical query type which is widely used in many fields and the result of the kNN query is closely related to the interest and preference of the user. Therefore, studies on secure kNN query processing algorithms that preserve both the data privacy and the query privacy have been proposed. However, existing algorithms either suffer from high computation cost or leak data access patterns because retrieved index nodes and query results are disclosed. To solve these problems, in this paper we propose a new kNN query processing algorithm on the encrypted database. Our algorithm preserves both data privacy and query privacy. It also hides data access patterns while supporting efficient query processing. To achieve this, we devise an encrypted index search scheme which can perform data filtering without revealing data access patterns. Through the performance analysis, we verify that our proposed algorithm shows better performance than the existing algorithms in terms of query processing times.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.463-466
• /
• 2007

현재 웹 서비스에서 주로 사용하고 있는 키워드 기반 검색은 사용자의 의도와는 상관없는 정보까지 검색하는 경우가 많아서, 실제로 원하는 정보를 찾는데 많은 시간과 노력을 요구한다는 단점이 있다. 이러한 단점을 보완하기 위해서 최근 시맨틱 웹이라는 개념이 등장하였으며, 본 논문에서는 검색 결과의 신뢰성을 향상시키기 위해 온톨로지를 기반으로 시맨틱 검색시스템을 설계하였다. 본 논문에서 설계한 온톨로지 기반의 시맨틱 검색 시스템은 기능적으로 크게 두 부분으로 구성되어 있다. 즉, 자료 수집을 하는 로봇 에이전트와 온톨로지를 기반으로 자료를 검색하는 시맨틱 검색 엔진으로 구성된다. 로봇 에이전트는 자율적으로 웹을 순회하면서 자료를 수집하고 필터링하여 메타데이터 저장소로 가져오는 역할을 한다. 시맨틱 검색 엔진은 사용자의 검색 폼으로부터 전달된 정보 검색 요구사항을 기초로 시맨틱 질의어로 변환한 후, 온톨로지 저장소를 활용하여 검색한다. 시맨틱 검색 엔진은 사용자가 입력한 검색어를 시맨틱 질의어로 변환해 주는 질의처리 모듈과 사용자의 의도를 추론하여 보다 향상된 검색을 가능하게 해주는 추론(Inference) 모듈, 온톨로지를 보관해주는 온톨로지 저장소 등으로 구성된다. 본 논문에서 설계한 온톨로지 기반의 시맨틱 검색 시스템은 키워드 기반 검색에 비해 사용자가 원하는 정보를 찾는데 소요되는 시간과 노력을 줄여 주고, 사용자의 의도에 적합한 정보를 제공할 것으로 기대된다.

• Spatial Information Research
• /
• v.19 no.3
• /
• pp.95-106
• /
• 2011

Recently as efficient processing of aggregate queries for fetching desired data from sensors has been recognized as a crucial part, in-network aggregate query processing techniques are studied intensively in wireless sensor networks. Existing representative in-network aggregate query processing techniques propose routing algorithms and data structures for processing aggregate queries. However, these aggregate query processing techniques have problems such as high energy consumption in sensor nodes, low accuracy of query processing results, and long query processing time. In order to solve these problems and to enhance the efficiency of aggregate query processing in wireless sensor networks, this paper proposes Bucket-based Parallel Aggregation(BPA). BPA divides a query region into several cells according to the distribution of sensor nodes and builds a Quad-tree, and then processes aggregate queries in parallel for each cell region according to routing. And it sends data in duplicate by removing redundant data, which, in turn, enhances the accuracy of query processing results. Also, BPA uses a bucket-based data structure in aggregate query processing, and divides and conquers the bucket data structure adaptively according to the number of data in the bucket. In addition, BPA compresses data in order to reduce the size of data in the bucket and performs data transmission filtering when each sensor node sends data. Finally, in this paper, we prove its superiority through various experiments using sensor data.

• Journal of Digital Convergence
• /
• v.13 no.10
• /
• pp.279-285
• /
• 2015

In this paper, we present the design and implementation of a realtime DNS Query Analysis System to detect and to protect from DNS attacks. The proposed system uses mirroring to collect data in DMZ, then analizes the collected data. As a result of the analysis, if the proposed system finds attack information, the information is used as a filtering information of firewall. statistic of the collected data is viewed as a realtime monitoring information on the web. To verify the effictiveness of the proposed system, we have built the proposed system and conducted some experiments. As the result, Our proposed system can be used effectively to defend DNS spoofing, DNS flooding attack, DNS amplification attack, can prevent interior network's attackers from attacking and provides realtime DNS query statistic information and geographic information for monitoring DNS query using GeoIP API and Google API. It can be useful information for ICT convergence and the future work.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.177-184
• /
• 2009

Environmental monitoring systems are widely developed for analyzing environment and understanding an ecosystem according to the advance of wireless communication and various sensing techniques. To extract useful information, it requires high cost for processing a query, because these systems have to handle huge volume of raw sensor data which is transmitted from a wide area in environmental monitoring applications. Besides, it is also hard to answer an user defined query which requests to check current and near future condition. In this paper, we propose the monitoring system structure for processing a user defined query for environmental monitoring. It also describes the utilization of sensor data filtering and abstraction model. The designed abstraction model which is based on the slope grid in GIS supports fast data access and update. To analyze condition, the extracted data from abstraction model of each sensor type is combined in a query processor. It is useful to provide meaningful information to users.

• Journal of The Korean Association of Information Education
• /
• v.15 no.2
• /
• pp.219-226
• /
• 2011

Web personalization has focused on extracting web pages interesting to users, to help users searching wanted information efficiently on the web. One of the main methods to achieve this is by using queries, links and users' preferred words in the pages. In this study, we surveyed from the web users the features of pages that are considered important to themselves in selecting web pages. The survey results showed that the content of the pages is the most important. However, images and readability of the page are rated as high as the content for some users. Based on this result, we present a method for maintaining relative weights of major page features differently in the profile for each user, which is used for personalizing web search results. Performance of the proposed personalization method is analyzed to prove its superiority such that it yields as much as 1.5 times higher rate than the system utilizing both queries and preferred words and about 2.3 times higher rate than a generic search engine.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.1-12
• /
• 2003

Recently, there have been many indexing schemes for multimedia data such as image, video data. But recent database applications, for example data mining and multimedia database, are required to support multi-user environment. In order for indexing schemes to be useful in multi-user environment, a concurrency control algorithm is required to handle it. So we propose a concurrency control algorithm that can be applied to CBF (cell-based filtering method), which uses the signature of the cell for alleviating the dimensional curse problem. In addition, we extend the SHORE storage system of Wisconsin university in order to handle high-dimensional data. This extended SHORE storage system provides conventional storage manager functions, guarantees the integrity of high-dimensional data and is flexible to the large scale of feature vectors for preventing the usage of large main memory. Finally, we implement the web-based image retrieval system by using the extended SHORE storage system. The key feature of this system is platform-independent access to the high-dimensional data as well as functionality of efficient content-based queries. Lastly. We evaluate an average response time of point query, range query and k-nearest query in terms of the number of threads.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.9
• /
• pp.243-250
• /
• 2021

Recently, with the development of cloud computing, interest in database outsourcing is increasing. However, when the database is outsourced, there is a problem in that the information of the data owner is exposed to internal and external attackers. Therefore, in this paper, we propose a parallel range query processing algorithm that supports privacy protection. The proposed algorithm uses the Paillier encryption system to support data protection, query protection, and access pattern protection. To reduce the operation cost of a checking protocol (SRO) for overlapping regions in the existing algorithm, the efficiency of the SRO protocol is improved through a garbled circuit. The proposed parallel range query processing algorithm is largely composed of two steps. It consists of a parallel kd-tree search step that searches the kd-tree in parallel and safely extracts the data of the leaf node including the query, and a parallel data search step through multiple threads for retrieving the data included in the query area. On the other hand, the proposed algorithm provides high query processing performance through parallelization of secure protocols and index search. We show that the performance of the proposed parallel range query processing algorithm increases in proportion to the number of threads and the proposed algorithm shows performance improvement by about 5 times compared with the existing algorithm.