• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.306-313
• /
• 2009

Top-k queries are issued to find out the highest (or lowest) readings in many sensor applications. Many top-k query processing algorithms are proposed to reduce energy consumption; FILA installs a filter at each sensor node and suppress unnecessary sensor updates; PRIM allots priorities to sensor nodes and collects the minimal number of sensor reading according to the priorities. However, if many sensor reading converge into the same range of sensor values, it leads to a problem that many false positives are occurred. In this paper, we propose a cluster-based approach to reduce them effectively. Our proposed algorithm operates in two phases: top-k query processing in the cluster level and top-k query processing in the tree level. False positives are effectively filtered out in each level. Performance evaluations show that our proposed algorithm reduces about 70% false positives and achieves about 105% better performance than the existing top-k algorithms in terms of the network lifetime.

• The Journal of the Korea Contents Association
• /
• v.20 no.8
• /
• pp.42-53
• /
• 2020

With the development of social network services, graph structures have been utilized to represent relationships among objects in various applications. Recently, a demand of subgraph matching in real-time graph streams has been increased. Therefore, an efficient approximate Top-k subgraph matching scheme for low latency in real-time graph streams is required. In this paper, we propose an approximate Top-k subgraph matching scheme considering data reuse in graph stream environments. The proposed scheme utilizes the distributed stream processing platform, called Storm to handle a large amount of stream data. We also utilize an existing data reuse scheme to decrease stream processing costs. We propose a distance based summary indexing technique to generate Top-k subgraph matching results. The proposed summary indexing technique costs very low since it only stores distances among vertices that are selected in advance. Finally, we provide k subgraph matching results to users by performing an approximate Top-k matching on the summary indexing. In order to show the superiority of the proposed scheme, we conduct various performance evaluations in diverse real world datasets.

• Journal of KIISE:Databases
• /
• v.36 no.3
• /
• pp.189-197
• /
• 2009

Top-k queries are important to many wireless sensor applications. Conventional Top-k query processing algorithms install a filter at each sensor node and suppress unnecessary sensor updates. However, they have some drawbacks that the sensor nodes consume energy extremely to probe sensor reading or update filters. Especially, it becomes worse, when the variation ratio of top-k result is higher. In this paper, we propose a novel Top-k query processing algorithm for energy-efficiency. First, each sensor determines its priority as the order of data gathering. Next, sensor nodes that have higher priority transmit their sensor readings to the base station until gathering k sensor readings. In order to show the superiority of our query processing algorithm, we simulate the performance with the existing query processing algorithms. As a result, our experimental results show that the network lifetime of our method is prolonged largely over the existing method.

• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.76-81
• /
• 2015

Research on top-k query processing algorithms for analyzing big data have been spotlighted recently. However, because existing top-k query processing algorithms do not provide an efficient index structure, they incur high query processing costs and cannot support various types of queries. To solve these problems, we propose a top-k query processing algorithm using a view selection method based on a grid index. The proposed algorithm reduces the query processing time by retrieving the minimum number of grid cells for the query range, by using a grid index-based view selection method. Finally, we show from our performance analysis that the proposed scheme outperforms an existing scheme, in terms of both query processing time and query result accuracy.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.12
• /
• pp.543-548
• /
• 2015

Recently top-k query processing has been extremely important along with the explosion of data produced by a variety of applications. Top-k queries return the best k results ordered by a user-provided monotone scoring function. As cloud computing service has been getting more popular than ever, a hot attention has been paid to cloud-based data outsourcing in which clients' data are stored and managed by the cloud. The cloud-based data outsourcing, though, exposes a critical secuity concern of sensitive data, resulting in the misuse of unauthorized users. Hence it is essential to encrypt sensitive data before outsourcing the data to the cloud. However, there has been little attention to efficient top-k processing on the encrypted cloud data. In this paper we propose a novel top-k processing algorithm that can efficiently process a large amount of encrypted data in the cloud. The main idea of the algorithm is to prune unpromising intermediate results at the early phase without decrypting the encrypted data by leveraging an order-preserving encrypted technique. Experiment results show that the proposed top-k processing algorithm significantly reduces the overhead of client systems from 10X to 10000X.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.1162-1164
• /
• 2013

Top-k 질의 처리가 사용자가 원하는 데이터를 검색하는 방법인 반면에, Reverse Top-k 질의 처리는 데이터의 관점에서 특정 데이터를 가장 선호할 만한 사용자를 검색하는 방법으로 생산자의 입장에서 매우 중요한 연구이다. 본 논문에서는 Reverse Top-k 질의 처리 방법들을 소개하고 비교 및 문제점을 분석한다.

• The Korean Journal of Food And Nutrition
• /
• v.28 no.6
• /
• pp.1019-1025
• /
• 2015

The influence of aging on the flavor precursors and volatile compounds of top round beef was studied. The concentrations of free amino acids, nucleotides, creatine, dipeptides, and volatile compounds were measured after top round from Hanwoo was aged at $4^{\circ}C$ for 21 days. The amount of free amino acids in top round significantly increased with the increase of aging period. There was no effect of aging on the concentrations of adenosine monophosphate or inosine in top round. The inosine monophosphate content of top round significantly decreased with age, while the hypoxanthine content increased. The concentrations of creatine, carnosine, and anserine in top round were not influenced by aging. In total, 24 volatile compound were identified in aged, cooked top round. Of these, the quantities of aldehydes (propanal, pentanal, hexanal, heptanal, octanal, and nonanal), hydrocarbons (pentane and octane), 2-butanone, ethyl acetate, and pyridines (4-ethynyl-pyridine and 4-acetyl-pyridine) significantly increased after aging. We conclude that the flavor of top round can be improved by aging.

• Journal of the Korea Society for Simulation
• /
• v.24 no.4
• /
• pp.153-161
• /
• 2015

We propose a privacy-preserving location-based service (LBS) which supports top-k search service. The previous schemes hurt the privacy of either the user and the location of the objects because they are sent to the LBS server in a plaintext form. In the proposed method, by encrypting them with the fully-homomorphic encryption, we achieved the top-k search is possible while the information on them is not given to the LBS server. We performed a simulation on the proposed scheme with 16 locations where k is 3. The required time is 270 hours in a conventional desktop machine, which seems infeasible to be used in practice. However, as the progress of the hardware, the performance will be improved.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.590-595
• /
• 2016

In this study, we propose an efficient method for monitoring continuous top-k queries. In contrast to the conventional top-k queries, the presented top-k query considers both spatial and non-spatial attributes. We proposed a novel main-memory based grid access method, called Bit-Vector Grid Index (BVGI). The proposed method quickly identifies whether the moving objects are included in some of the grid cell by encoding a non-spatial attribute value of the moving object to bit-vector. Experimental simulations demonstrate that the proposed method is several times faster than the previous method and uses considerably less memory.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.28 no.3
• /
• pp.89-94
• /
• 2016

In this experimental study, the effects of top clearance on the performance of automotive a/c compressor were studied. Top clearance measuring device was also developed to ensure the reliability using vacuum conditions to secure constant control of top clearance without external environmental influence. Our results revealed that the improvements in compressor performance according to different top clearance values using the same compressor and same operator were about 4.12% at 800 rpm and about 7.8% at 2,000 rpm in 0.243~0.252 mm of top clearance compared to 0.431~0.456 mm of top clearance. To confirm the consistency in measuring top clearance affecting compressor performance, the top clearance measuring device was developed in this study using a vacuum pump. After performing reliable tests repeatedly, the distribution of measuring values under this device was within 0.99~1.83%, indicating that the constant test data in compressor performance was not affected by any other external environment.