Open Access
2014 Grid-PPPS: A Skyline Method for Efficiently Handling Top-k Queries in Internet of Things
Sun-Young Ihm, Aziz Nasridinov, Young-Ho Park
J. Appl. Math. 2014(SI01): 1-10 (2014). DOI: 10.1155/2014/401618


A rapid development in wireless communication and radio frequency technology has enabled the Internet of Things (IoT) to enter every aspect of our life. However, as more and more sensors get connected to the Internet, they generate huge amounts of data. Thus, widespread deployment of IoT requires development of solutions for analyzing the potentially huge amounts of data they generate. A top-k query processing can be applied to facilitate this task. The top-k queries retrieve k tuples with the lowest or the highest scores among all of the tuples in the database. There are many methods to answer top-k queries, where skyline methods are efficient when considering all attribute values of tuples. The representative skyline methods are soft-filter-skyline (SFS) algorithm, angle-based space partitioning (ABSP), and plane-project-parallel-skyline (PPPS). Among them, PPPS improves ABSP by partitioning data space into a number of spaces using hyperplane projection. However, PPPS has a high index building time in high-dimensional databases. In this paper, we propose a new skyline method (called Grid-PPPS) for efficiently handling top-k queries in IoT applications. The proposed method first performs grid-based partitioning on data space and then partitions it once again using hyperplane projection. Experimental results show that our method improves the index building time compared to the existing state-of-the-art methods.


Download Citation

Sun-Young Ihm. Aziz Nasridinov. Young-Ho Park. "Grid-PPPS: A Skyline Method for Efficiently Handling Top-k Queries in Internet of Things." J. Appl. Math. 2014 (SI01) 1 - 10, 2014.


Published: 2014
First available in Project Euclid: 1 October 2014

Digital Object Identifier: 10.1155/2014/401618

Rights: Copyright © 2014 Hindawi

Vol.2014 • No. SI01 • 2014
Back to Top